Abstract
This paper mainly solves a path planning problem of messenger UAV in an air-ground collaborative system which is composed of a fixed-wing unmanned aerial vehicle (UAV) and multiple unmanned ground vehicles (UGVs). The UGVs play the role of mobile actuators, while the UAV serves as a messenger to achieve information sharing among the UGVs. The UAV needs to fly over each UGV periodically to collect the information and then transmit the information to the other UGVs. The path planning problem for the messenger UAV can be modeled as a Dynamic Dubins Traveling Salesman Problem with Neighborhood (DDTSPN). The goal of this problem is to find a shortest path which enables the UAV to access all the UGVs periodically. In the paper, we proposes a solution algorithm for the UAV’s path planning with uncertainty constraints which means the UAV doesn’t know the UGVs’ motion parameters. The algorithm is based on the idea of decoupling: firstly the sequence for the UAV to access the UGVs are determined by the genetic algorithm (GA), and then a reasonable prediction mechanism are proposed to determine the access locations of the UAV to the UGVs’ communication neighborhoods. Then the theoretical analysis of the effectiveness for the UAV’s path planning strategy is emphasized. At last, the effectiveness of the proposed approach is corroborated through computational experiments on several different scale instances.
This work was supported in part by the National Outstanding Youth Talents Support Program 61822304, in part by the National Natural Science Foundation of China under Grant 61673058, in part by the “Thousand Talents Plan” (the State Recruitment Program of Global Experts) (Foreign Experts, Long-term Program) under Grant WQ20141100198, in part by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China under Grant 61621063, in part by the Projects of Major International (Regional) Joint Research Program of NSFC under Grant 61720106011.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Xin, B., Chen, J., Xu, D.L., Chen, Y.W.: Hybrid encoding based differential evolution algorithms for Dubins traveling salesman problem with neighborhood. Control Theory Appl. 31(7), 941–954 (2014)
Boissonnat, J.D., Bui, X.N.: Accessibility Region for a Car That Only Moves Forwards Along Optimal Paths. INRIA France (1994)
Chen, J., Zhang, X., Xin, B., Fang, H.: Coordination between unmanned aerial and ground vehicles: a taxonomy and optimization perspective. IEEE Trans. Cybern. 46(4), 959–972 (2015)
Cohen, I., Epstein, C., Isaiah, P., Kuzi, S., Shima, T.: Discretization-based and look-ahead algorithms for the dubins traveling salesperson problem. IEEE Trans. Autom. Sci. Eng. 14(1), 383–390 (2016)
Garone, E., Determe, J.F., Naldi, R.: Generalized traveling salesman problem for carrier-vehicle systems. J. Guid. Control Dyn. 37(3), 766–774 (2014)
Isaiah, P., Shima, T.: Motion planning algorithms for the dubins travelling salesperson problem. Automatica 53, 247–255 (2015)
Ji, X., Niu, Y., Shen, L.: Robust satisficing decision making for unmanned aerial vehicle complex missions under severe uncertainty. PloS one 11(11), e0166448 (2016)
Mathew, N., Smith, S.L., Waslander, S.L.: Planning paths for package delivery in heterogeneous multirobot teams. IEEE Trans. Autom. Sci. Eng. 12(4), 1298–1308 (2015)
Saska, M., Vonásek, V., Krajník, T., Přeučil, L.: Coordination and navigation of heterogeneous mav-ugv formations localized by a hawk-eye-like approach under a model predictive control scheme. Int. J. Robot. Res. 33(10), 1393–1412 (2014)
Xin, B., Zhu, Y.G., Ding, Y.L., Gao, G.Q.: Coordinated motion planning of multiple robots in multi-point dynamic aggregation task. In: 2016 12th IEEE International Conference on Control and Automation (ICCA), pp. 933–938. IEEE (2016)
Yulong, D., et al.: Path planning of messenger uav in air-ground coordination. IFAC-PapersOnLine 50(1), 8045–8051 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Zhang, H., Xin, B., Ding, Y., Wang, M. (2020). Path Planning for Messenger UAV in AGCS with Uncertainty Constraints. In: Pan, L., Liang, J., Qu, B. (eds) Bio-inspired Computing: Theories and Applications. BIC-TA 2019. Communications in Computer and Information Science, vol 1160. Springer, Singapore. https://doi.org/10.1007/978-981-15-3415-7_56
Download citation
DOI: https://doi.org/10.1007/978-981-15-3415-7_56
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-3414-0
Online ISBN: 978-981-15-3415-7
eBook Packages: Computer ScienceComputer Science (R0)