Technical Papers
Oct 27, 2016

Online Trajectory Generation with Rendezvous for UAVs Using Multistage Path Prediction

Publication: Journal of Aerospace Engineering
Volume 30, Issue 3

Abstract

To improve the overall performance of mission planning for the unmanned aerial vehicles (UAVs), a multistage path prediction (MPP) for trajectory generation with rendezvous is addressed in this paper. The proposed real-time algorithm consists of four stages: path estimation, path planning, flyable trajectory generation, and trajectory modification for rendezvous. In every planning horizon, each UAV utilizes the local A* algorithm to estimate all probable paths and then the results serve as input for the task assignment system. A simple assignment algorithm is briefly introduced to validate the effectiveness of MPP. Based on the assignment, the polygonal paths are further obtained by using the global A* algorithm. Then these paths are smoothed to be flyable by using the cubic b-spline curve. In the last stage, the trajectories are modified for rendezvous of the UAVs to execute specific many-to-one tasks. Results of different stages are continuously revised and delivered to the task assignment system as feedback in the whole mission process. Numerical results demonstrate the performance of the proposed approach for stochastic scenarios.

Get full access to this article

View all available purchase options and get full access to this article.

References

Dubins, L. E. (1957). “On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents.” Am J. Math., 79(3), 497–516.
Eck, M., and Hadenfeld, J. (1995). “Local energy fairing of B-spline curves.” Springer, Vienna, Austria, 129–147.
Eun, Y., and Bang, H. (2009). “Cooperative task assignment/path planning of multiple unmanned aerial vehicles using genetic algorithms.” J. Aircr., 46(1), 338–343.
Jia, D., and Vagners, J. (2004). “Parallel evolutionary algorithms for UAV path planning.” Proc., AIAA 1st Intelligent Systems Technical Conf., AIAA, Chicago, 20–22.
Jung, D., and Tsiotras, P. (2013). “On-line path generation for unmanned aerial vehicles using B-spline path templates.” J. Guid. Control Dyn., 36(6), 1642–1653.
Kothari, M., Postlethwaite, I., and Gu, D. W. (2009). “Multi-UAV path planning in obstacle rich environments using rapidly-exploring random trees.” Proc., Joint 48th IEEE Conf. on Decision and Control and 28th Chinese Control Conf., IEEE, Shanghai, China, 3069–3074.
Koyuncu, E., Ure, N. K., and Inalhan, G. (2010). “Integration of path/maneuver planning in complex environments for agile maneuvering UCAVs.” J. Intell. Rob. Syst., 57(1–4), 143–170.
Lozano-Pérez, T., and Wesley, M. A. (1979). “An algorithm for planning collision-free paths among polyhedral obstacles.” Commun. ACM, 22(10), 560–570.
Manathara, J. G., and Ghose, D. (2014). “Rendezvous of multiple UAVs with collision avoidance using consensus.” J. Aerosp. Eng., 480–489.
MATLAB [Computer software]. MathWorks, Natick, MA.
Mclain, T. W., Chandler, P. R., and Pachter, M. (2000). “A decomposition strategy for optimal coordination of unmanned air vehicles.” Proc., American Control Conf., American Automatic Control Council (AACC), 369–373.
Moon, S., Oh, E., and Shim, D. H. (2013). “An integral framework of task assignment and path planning for multiple unmanned aerial vehicles in dynamic environments.” J. Intell. Rob. Syst., 70(1–4), 303–313.
Nikolos, I. K., Valavanis, K. P., Tsourveloudis, N. C., and Kostaras, A. N. (2003). “Evolutionary algorithm based offline/online path planner for UAV navigation.” IEEE Trans. Syst. Man Cybern. Part B Cybern., 33(6), 898–912.
Oh, H., Kim, S., Sing, H. S., White, B. A., and Rabbath, C. A. (2013). “Rendezvous and standoff target tracking guidance using differential geometry.” J. Intell. Rob. Syst., 69(1–4), 389–405.
Pettersson, P. O., and Doherty, P. (2006). “Probabilistic roadmap based path planning for an autonomous unmanned helicopter.” J. Intell. Fuzzy Syst., 17(4), 395–405.
Shanmugavel, M., Tsourdos, A., White, B. A., and Zbikowski, R. (2010). “Co-operative path planning of multiple UAVs using Dubins paths with clothoid arcs.” Control Eng. Pract., 18(9), 1084–1092.
Sun, T. Y., Huo, C. L., Tsai, S. J., Yu, Y. H., and Liu, C. C. (2011). “Intelligent flight task algorithm for unmanned aerial vehicle.” Expert Syst. Appl., 38(8), 10036–10048.
Vachtsevanos, G., Tang, L., Drozeski, G., and Gutierrez, L. (2005). “From mission planning to flight control of unmanned aerial vehicles: Strategies and implementation tools.” Annu. Rev. Control., 29(1), 101–115.
Wang, Y., Wang, S., Tan, M., Zhou, C., and Wei, Q. (2015). “Real-time dynamic Dubins-helix method for 3-D trajectory smoothing.” IEEE Trans. Control Syst. Technol., 23(2), 730–736.

Information & Authors

Information

Published In

Go to Journal of Aerospace Engineering
Journal of Aerospace Engineering
Volume 30Issue 3May 2017

History

Received: Jul 5, 2015
Accepted: Aug 3, 2016
Published online: Oct 27, 2016
Discussion open until: Mar 27, 2017
Published in print: May 1, 2017

Permissions

Request permissions for this article.

Authors

Affiliations

Ph.D. Candidate, School of Astronautics, Harbin Institute of Technology, Harbin 150001, China (corresponding author). ORCID: https://orcid.org/0000-0002-6570-3888. E-mail: [email protected]
Professor, School of Astronautics, Harbin Institute of Technology, Harbin 150001, China. E-mail: [email protected]
Yanfang Liu [email protected]
Lecturer, School of Astronautics, Harbin Institute of Technology, Harbin 150001, China. E-mail: [email protected]

Metrics & Citations

Metrics

Citations

Download citation

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited by

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share