Optimal UGV-UAV Cooperative Partitioning and Inspection of Shortest Paths
Ninh Nguyen, Srinivas Akella

TL;DR
This paper develops an optimal cooperative path planning method for UGVs and UAVs to efficiently inspect and navigate environments with unknown blockages, improving travel times significantly.
Contribution
It introduces a novel partitioning strategy for cooperative path planning in unknown environments, extending the Canadian Traveller Problem to UGV-UAV systems with proven optimality.
Findings
UAV assistance reduces UGV travel time by up to 30%.
The proposed algorithm achieves optimal path partitioning on general graphs.
The worst-case competitive ratio improves with UAV assistance and speed ratio.
Abstract
We study cooperative shortest path planning for an unmanned ground vehicle (UGV) assisted by an unmanned aerial vehicle (UAV) in environments with unknown road blockages that are only discovered when a robot reaches the damaged point. This formulation generalizes the original Canadian Traveller Problem (CTP), which assumes a single ground vehicle and that the traversability status of all incident edges is revealed upon arrival at a vertex. We first analyze the case where the start and the goal are connected by disjoint paths, and prove that the worst-case competitive ratio for a single UGV is . With UAV assistance, and under the simplifying assumption of negligible initial transit and deadheading UAV costs, the ratio improves to , where and denote the UGV and UAV speed, respectively. To address general graphs and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
