Algorithms for the connectivity constrained unmanned ground vehicle surveillance problem
2009 (English)In: European Control Conference (ECC), Budapest, Hungary: EUCA , 2009Conference paper (Refereed)
The Connectivity Constrained UGV Surveillance Problem (CUSP) considered in this paper is the following. Given a set of surveillance UGVs and a user defined area to be covered, find waypoint-paths such that; 1) the area is completely surveyed, 2) the time for performing the search is minimized and 3) the induced information graph is kept recurrently connected. It has previously been shown that the CUSP is NP-hard. This paper presents four different heuristic algorithms for solving the CUSP, namely, the Token Station Algorithm, the Stacking Algorithm, the Visibility Graph Algorithm and the Connectivity Primitive Algorithm. These algorithms are then compared by means of Monte Carlo simulations. The conclusions drawn are that the Token Station Algorithm provides the most optimal solutions, the Stacking Algorithm has the lowest computational complexity, while the Connectivity Primitive Algorithm provides the best trade-off between optimality and computational complexity for larger problem instances.
Place, publisher, year, edition, pages
Budapest, Hungary: EUCA , 2009.
Cooperative control, Optimization algorithms, Autonomous systems
IdentifiersURN: urn:nbn:se:kth:diva-10058OAI: oai:DiVA.org:kth-10058DiVA: diva2:202383
European Control Conference 2009 - ECC’09. 23-26 August 2009, Budapest, Hungary
QC 201110102009-03-102009-03-102011-11-21Bibliographically approved