Cooperative Minimum Time Surveillance With Multiple Ground Vehicles
2010 (English)In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 55, no 12, 2679-2691 p.Article in journal (Refereed) Published
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. The second problem extends the first by additionally requiring the induced information graph to be connected at the time instants when the UGVs perform the surveillance mission, i.e., when they gather and transmit sensor data. In the context of the second problem, we also introduce and utilize the notion of recurrent connectivity, which is a significantly more flexible connectivity constraint than, e.g., the 1-hop connectivity constraints and use it to discuss consensus filter convergence for the group of UGVs.
Place, publisher, year, edition, pages
2010. Vol. 55, no 12, 2679-2691 p.
Minimum time UGV surveillance problem (MTUSP), unmanned ground vehicle (UGV)
IdentifiersURN: urn:nbn:se:kth:diva-28190DOI: 10.1109/TAC.2010.2047438ISI: 000285053700001ScopusID: 2-s2.0-78649993176OAI: oai:DiVA.org:kth-28190DiVA: diva2:385024
QC 201506252011-01-112011-01-102015-06-25Bibliographically approved