http://iet.metastore.ingenta.com
1887

Robust Kalman filter-based decentralised target search and prediction with topology maps

Robust Kalman filter-based decentralised target search and prediction with topology maps

For access to this article, please select a purchase option:

Buy eFirst article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
— Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A novel distributed approach for searching and tracking of targets is presented for sensor network environments in which physical distance measurement using techniques such as signal strength is not feasible. The solution consists of a robust Kalman filter combined with a non-linear least-square method, and maximum likelihood topology maps. The primary input for estimating target location and direction of motion is provided by time stamps recorded by the sensor nodes when the target is detected within their sensing range. An autonomous robot following the target collects this information from sensors in its neighbourhood to determine its own path in search of the target. While the maximum likelihood topology coordinate space is a robust alternative to physical coordinates, it contains significant non-linear distortions when compared with physical distances between nodes. The authors overcome this using time stamps corresponding to target detection by nodes instead of relying on distances. The performance of the proposed algorithm is compared with recently proposed pseudo gradient algorithm based on hop count and received signal strength. Even though the proposed algorithm does not depend on distance measurements, the results show that it is able to track the target effectively even when the target changes its moving pattern frequently.

http://iet.metastore.ingenta.com/content/journals/10.1049/iet-wss.2017.0039
Loading

Related content

content/journals/10.1049/iet-wss.2017.0039
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address