By Topic

Covert path planning in unknown environments with known or suspected sentry location

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Marzouqi, M. ; Centre of Intelligent Robotics Res., Monash Univ., Melbourne, Vic., Australia ; Jarvis, R.A.

This paper describes an approach for solving a visibility-based covert path planning problem. It is an extension to our research on covert robotics which aims to create robots with the ability to achieve different covert navigation missions. A promising method is presented that allows a mobile robot in a complex, initially unknown environment to discover a path to a nominated destination with minimum exposure to sentries' at known locations within the same environment. The sentries' locations are known initially, suspected, or discovered during navigation. The presented method estimates a cost value at each non-obstacle location that represents a risk of being visible, given the accumulated map knowledge. A global covert path is generated by propagating the estimated cost values using the distance transform algorithm. The approach has been evaluated on both simulated and real environments. A number of test cases are presented; each shows a generated path with considerable covertness compared to a short path (but perhaps risky) to the same destination.

Published in:

Intelligent Robots and Systems, 2005. (IROS 2005). 2005 IEEE/RSJ International Conference on

Date of Conference:

2-6 Aug. 2005