Unmanned Aerial Vehicles (UAVs), adept at aerial surveillance, are often constrained by their limited battery capacity. Refueling on slow-moving Unmanned Ground Vehicles (UGVs) can significantly enhance UAVs’ operational endurance. This paper explores the computationally complex problem of cooperative UAV-UGV routing for vast area surveillance, considering speed and fuel constraints. It presents a sequential multi-agent planning framework aimed at achieving feasible and optimally satisfactory solutions. By considering the UAV fuel limit and utilizing a minimum set cover algorithm, we determine UGV refueling stops. This, in turn, facilitates UGV route planning as the first step. Through a task allocation technique and energy-constrained vehicle routing problem modeling with time windows (E-VRPTW), we then achieve the UAV route in the second step of the framework. The effectiveness of our multi-agent strategy is demonstrated through the implementation on 30 different task scenarios across three different scales. This work provides significant insight into the collaborative advantages of UAV-UGV systems and introduces heuristic approaches to bypass computational challenges and swiftly reach high-quality solutions.
Unmanned Aerial Vehicles (UAVs), although adept at aerial surveillance, are often constrained by limited battery capacity. By refueling on slow-moving Unmanned Ground Vehicles (UGVs), their operational endurance can be significantly enhanced. This paper explores the computationally complex problem of cooperative UAV-UGV routing for vast area surveillance within the speed and fuel constraints, presenting a sequential multi-agent planning framework for achieving feasible and optimally satisfactory solutions. By considering the UAV fuel limits and utilizing a minimum set cover algorithm, we determine UGV refueling stops, which in turn facilitate UGV route planning at the first step and through a task allocation technique and energy constrained vehicle routing problem modeling with time windows (E-VRPTW) we achieve the UAV route at the second step of the framework. The effectiveness of our multi-agent strategy is demonstrated through the implementation on 30 different task scenarios across 3 different scales. This work offers significant insight into the collaborative advantages of UAV-UGV systems and introduces heuristic approaches to bypass computational challenges and swiftly reach high-quality solutions.
Most stand-alone planners have theoretical guarantees in terms of completeness, optimality and performance. However, no stand-alone planner is able to handle the complexity of real world systems accounting for kinematic and dynamic constraints while being able to operate over long ranges. This leads to hierarchical planning approaches that bring together different stand-alone planners for local and global navigation at the expense of weaker performance guarantees. This paper presents the results of using simulation combined with field testing in order to quantify the performance of integrated hierarchical planners. While these results don't provide performance guarantees, they show clear performance differences depending on the integrated hierarchical planner used. While in general the simulated results were a good predictor of performance in the field, in some scenarios the simulated experiments did not accurately reflect the performance in the field.