Change search
ReferencesLink to record
Permanent link

Direct link
Communication constrained multi-UGV surveillance
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.). (Optimization and Systems Theory)
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.). (Optimization and Systems Theory)ORCID iD: 0000-0003-0177-1993
2008 (English)In: IFAC World Congress, Seoul, Korea, 2008Conference paper (Refereed)
Abstract [en]

This paper addresses the problem of connectivity constrained surveillance of a given polyhedral area with obstacles using a group of Unmanned Ground Vehicles (UGVs). The considered communication restrictions may involve both line-of-sight constraints and limited sensor range constraints. In this paper, the focus is on dynamic information graphs, G, which are required to be kept recurrently connected. The main motivation for introducing this weaker notion of connectivity is security and surveillance applications where the sentry vehicles may have to split temporary in order to complete the given mission efficiently but are required to establish contact recurrently in order to exchange information or to make sure that all units are intact and well-functioning. From a theoretical standpoint, recurrent connectivity is shown to be sufficient for exponential convergence of consensus filters for the collected sensor data.

Place, publisher, year, edition, pages
Seoul, Korea, 2008.
National Category
Natural Sciences
URN: urn:nbn:se:kth:diva-10060OAI: diva2:202391
17th IFAC World Congress, July 6-11, 2008
QC 20111010Available from: 2009-03-10 Created: 2009-03-10 Last updated: 2011-11-21Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Anisi, David A.Ögren, PetterHu, Xiaoming
By organisation
Mathematics (Dept.)
Natural Sciences

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

Total: 70 hits
ReferencesLink to record
Permanent link

Direct link