Precedence-constrained path planning of messenger UAV for air-ground coordination
- 10 Downloads
This paper addresses an unmanned aerial vehicle (UAV) path planning problem for a team of cooperating heterogeneous vehicles composed of one UAV and multiple unmanned ground vehicles (UGVs). The UGVs are used as mobile actuators and scattered in a large area. To achieve multi-UGV communication and collaboration, the UAV serves as a messenger to fly over all task points to collect the task information and then flies all UGVs to transmit the information about tasks and UGVs. The path planning of messenger UAV is formulated as a precedence-constrained dynamic Dubins traveling salesman problem with neighborhood (PDDTSPN). The goal of this problem is to find the shortest route enabling the UAV to fly over all task points and deliver information to all requested UGVs. When solving this path planning problem, a decoupling strategy is proposed to sequentially and rapidly determine the access sequence in which the UAV visits task points and UGVs as well as the access location of UAV in the communication neighborhood of each task point and each UGV. The effectiveness of the proposed approach is corroborated through computational experiments on randomly generated instances. The computational results on both small and large instances demonstrate that the proposed approach can generate high-quality solutions in a reasonable time as compared with two other heuristic algorithms.
KeywordsAir-ground coordination curvature-constrained path planning precedence constraints Dubins traveling salesman problem
Unable to display preview. Download preview PDF.
- B. Xin, Y. G. Zhu, Y. L. Ding, et al. Coordinated motion planning of multiple robots in multi-point dynamic aggregation task. Proceedings of the IEEE International Conference on Control and Automation, Nepal: IEEE, 2016: 933–938.Google Scholar
- J. T. Isaacs, D. J. Klein, J. P. Hespanha. Algorithms for the traveling salesman problem with neighborhoods involving a Dubins vehicle. Proceedings of the American Control Conference, New York: IEEE, 2011: 1704–1709.Google Scholar
- Y. L. Ding, B. Xin, J. Chen, et al. Path planning of messenger UAV in air-ground coordination. The 20th World Congress of the International Federation of Automatic Control, Toulouse: IFAC Secretariat, 2017: 8045–8051.Google Scholar
- X. N. Bui, J. D. Boissonnat. Accessibility Region for A Car that Only Moves Forwards along Optimal Paths. Technical report. France: Institut national de recherche en informatique et en automatique, 1994: Research Report INRIA 2181.Google Scholar
- Z. H. Ahmed. The ordered clustered travelling salesman problem: a hybrid genetic algorithm. Scientific World Journal, 2014: DOI 10.1155/2014/258207.Google Scholar
- X. Zhang, Y. Bai, B. Xin, et al. Differential evolution based receding horizon control for UAVmotion planning in dynamic environments. Jiqiren/Robot, 2013, 35(1): 107–114.Google Scholar