By Topic

Visibility-based pursuit-evasion: the case of curved environments

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)
LaValle, S.M. ; Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA ; Hinrichsen, J.E.

We consider the problem of visually searching for an unpredictable target that can move arbitrarily fast in a simply-connected two-dimensional curved environment. A complete algorithm is presented and is based on critical visibility events that occur because of inflections and bitangents on the environment boundary. By generalizing the notion of inflections and bitangents to polygonal and piecewise-smooth environments, the approach is considered as a step toward developing pursuit-evasion strategies that have little dependency on the representation of the environment

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:17 ,  Issue: 2 )