Change search
ReferencesLink to record
Permanent link

Direct link
Cooperative Minimum Time Surveillance With Multiple Ground Vehicles
Swedish Defence Research Agency (FOI), Sweden.ORCID iD: 0000-0002-7714-928X
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0003-0177-1993
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
Abstract [en]

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.
Keyword [en]
Minimum time UGV surveillance problem (MTUSP), unmanned ground vehicle (UGV)
National Category
Computational Mathematics
URN: urn:nbn:se:kth:diva-28190DOI: 10.1109/TAC.2010.2047438ISI: 000285053700001ScopusID: 2-s2.0-78649993176OAI: diva2:385024

QC 20150625

Available from: 2011-01-11 Created: 2011-01-10 Last updated: 2015-06-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Ögren, PetterHu, Xiaoming
By organisation
Optimization and Systems TheoryCentre for Autonomous Systems, CASACCESS Linnaeus Centre
In the same journal
IEEE Transactions on Automatic Control
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 88 hits
ReferencesLink to record
Permanent link

Direct link