作者: Kaarthik Sundar , Satyanarayana G. Manyam , David W. Casbeer
DOI:
关键词:
摘要: This article considers a cooperative vehicle routing problem for an intelligence, surveillance, and reconnaissance mission in the presence of communication constraints between vehicles. The proposed framework uses ground Unmanned Aerial Vehicle (UAV) that travel cooperatively visit set targets while satisfying constraints. is formulated as mixed-integer linear program, branch-and-cut algorithm developed to solve optimality. Furthermore, transformation method heuristic are also problem. effectiveness all algorithms corroborated through extensive computational experiments on several randomly generated instances.