Referenced Items are not available for this document.
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
)
Date of Publication: Apr 2001
- Page(s):
- 196 - 202
- ISSN :
- 1042-296X
- INSPEC Accession Number:
- 6968916
- Digital Object Identifier :
- 10.1109/70.928565
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 07 August 2002
- Issue Date :
- Apr 2001
- Sponsored by :
- IEEE Robotics and Automation Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
