Referenced Items are not available for this document.
In this paper, we formulate and solve two different minimum time problems related to unmanned ground vehicle (UGV) surveillance. The first problem is the following. Given a set of surveillance UGVs and a polyhedral area, find waypoint-paths for all UGVs such that every point of the area is visible from a point on a path and such that the time for executing the search in parallel is minimized. Here, the sensors' field of view are assumed to have a limited coverage range and be occluded by the obstacles.
Published in:
Automatic Control, IEEE Transactions on
(Volume:55
,
Issue:
12
)
Date of Publication: Dec. 2010
- Page(s):
- 2679 - 2691
- ISSN :
- 0018-9286
- INSPEC Accession Number:
- 11685047
- Digital Object Identifier :
- 10.1109/TAC.2010.2047438
- Product Type:
- Journals & Magazines
- Date of Publication :
- 08 April 2010
- Date of Current Version :
- 03 December 2010
- Issue Date :
- Dec. 2010
- Sponsored by :
- IEEE Control Systems 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.
