Cooperative Minimum Time Surveillance With Multiple Ground Vehicles

QC 20150625
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.

Ögren, Petter,1974-Swedish Defence Research Agency (FOI), Sweden(Swepub:kth)u1izkr9z (författare)
Hu, XiaomingKTH,Optimeringslära och systemteori,Centrum för Autonoma System, CAS,ACCESS Linnaeus Centre(Swepub:kth)u12tfc77 (författare)
Swedish Defence Research Agency (FOI), SwedenOptimeringslära och systemteori (creator_code:org_t)

Ingår i:IEEE Transactions on Automatic Control55:12, s. 2679-26910018-92861558-2523

Av författaren/redakt...: Anisi, David A.; Ögren, Petter, 1 ...; Hu, Xiaoming

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.