Cooperative Routing for an Air-Ground Vehicle Team-Exact Algorithm, Transformation Method, and Heuristics

• Published in: IEEE transactions on automation science and engineering Vol. 17; no. 1; pp. 537 - 547
• Main Authors: Manyam, Satyanarayana G., Sundar, Kaarthik, Casbeer, David W.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.01.2020; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: ADVANCED PROPULSION SYSTEMS; Algorithms; Base stations; Branch-and-cut; Communication; communication constraints; cooperative vehicle routing; Heuristic algorithms; Heuristic methods; heuristics; Intelligence; Land vehicles; mixed-integer linear program; Optimization; path planning; Reconnaissance; Route planning; Routing; Surveillance; Traffic surveillance; Transformations; Traveling salesman problem; Unmanned aerial vehicles; unmanned aerial vehicles (UAVs); Vehicle routing; Vehicles
• ISSN: 1545-5955; 1558-3783
• DOI: 10.1109/TASE.2019.2931894

This paper considers a cooperative vehicle routing problem for an intelligence, surveillance, and reconnaissance mission in the presence of communication constraints between the vehicles. The proposed framework uses a ground vehicle and an unmanned aerial vehicle (UAV) that travel cooperatively and visit a set of targets while satisfying the communication constraints. The problem is formulated as a mixed-integer linear program, and a branch-and-cut algorithm is developed to solve the problem to optimality. Furthermore, a transformation method and a heuristic are also developed for the problem. The effectiveness of all the algorithms is corroborated through extensive computational experiments on several randomly generated instances. This paper is motivated by an intelligence, surveillance, and reconnaissance mission involving a single unmanned aerial vehicle (UAV) and a ground vehicle, where the vehicles must coordinate their activity in the presence of communication constraints. The combination of a small UAV and a ground vehicle is an ideal platform for such missions, since small UAVs can fly at low altitudes and can avoid obstacles or threats that would be problematic for the ground vehicle alone. This paper addresses the coordinated routing problem involving these two vehicles and presents an algorithm to obtain an optimal solution for this problem, fast heuristics to obtain good feasible solutions, and also a transformation method to transform any instance of this cooperative vehicle routing problem to an instance of the one-in-a-set traveling salesman problem.