Skip to main content
Log in

UAV Path Planning with Derivative of the Heuristic Angle

  • Original Paper
  • Published:
International Journal of Aeronautical and Space Sciences Aims and scope Submit manuscript

Abstract

This paper introduces improved weighted A* (WA*DH), an advanced version of the weighted A* (WA*). To increase the performance of WA*, we suggest a new parameter, the heuristic angle, which is defined as the angle between the direction of an nth node to the target and the direction of the heading from the (n−1)th node to the nth node on the path. The process of WA*DH involves searching nodes that degrade the optimality of the generated path using the derivative of the heuristic angle, and then searching for escape nodes that avoid an obstacle. Finally, local re-planning of the path is performed using the nodes obtained in the aforementioned two steps. We can verify that the cost of WA*DH is lower than WA*, although the elapsed time is not shorter than WA* because of the additional procedures.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. González-Arribas D, Soler M, Sanjurjo-Rivo M, Kamgarpour M, Simarro J (2019) Robust aircraft trajectory planning under uncertain convective environments with optimal control and rapidly developing thunderstorms. Aerosp Sci Technol 89:445–459

    Article  Google Scholar 

  2. Kott A, Saks V, Mercer A (1999) A new technique enables dynamic replanning and rescheduling of aeromedical evacuation. AI Mag 20(1):43–43

    Google Scholar 

  3. Myers KL (1999) CPEF: A continuous planning and execution framework. AI Mag 20(4):63–63

    Google Scholar 

  4. Dancila BD, Botez RM (2018) Vertical flight path segments sets for aircraft flight plan prediction and optimisation. Aeronaut J 122(1255):1371–1424

    Article  Google Scholar 

  5. Bagherian M, Alos A (2015) 3D UAV trajectory planning using evolutionary algorithms: A comparison study. Aeronaut J 119(1220):1271–1285

    Article  Google Scholar 

  6. Yang L et al (2016) Survey of robot 3D path planning algorithms. J Control Sci Eng 2016

  7. Yang L et al (2014) A literature review of UAV 3D path planning. In: Proceeding of the 11th world congress on intelligent control and automation, IEEE

  8. Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100–107

    Article  Google Scholar 

  9. Koenig S, Likhachev M, Furcy D (2004) Lifelong planning A*. Artif Intell 155(1–2):93–146. https://doi.org/10.1016/j.artint.2003.12.001

    Article  MathSciNet  MATH  Google Scholar 

  10. Bjornsson Y, Bulitko V, Sturtevant N (2009) TBA*: time-bounded A*. In: Twenty-first international joint conference on artificial intelligence

  11. Korf RE (1990) Real-time heuristic search. Artif Intell 42(2-3):189–211

    Article  Google Scholar 

  12. Koenig S (2004) A comparison of fast search methods for real-time situated agents. In: Proceedings of the third international joint conference on autonomous agents and multiagent systems, vol 2. IEEE Computer Society

  13. Pohl I (1970) Heuristic search viewed as path finding in a graph. Artif Intell 1(3–4):193–204. https://doi.org/10.1016/0004-3702(70)90007-X

    Article  MathSciNet  MATH  Google Scholar 

  14. Pohl I (1973) The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving. In: Proceedings of the 3rd international joint conference on Artificial intelligence, pp 12–17

  15. Pearl J, Kim JH (1982) Studies in semi-admissible heuristics. IEEE Trans Pattern Analysis Mach Intell 4:392–399

    Article  Google Scholar 

  16. Thayer JT, Ruml W (2009) Using distance estimates in heuristic search. In: Gerevini A, Howe A, Cesta A, Refanidis I (eds) Proceedings of nineteenth international conference on automated planning and scheduling, vol 1, University of Macedonia, Thessaloniki, pp 382–385

  17. ThayerJT, Ruml W (2008) Faster than weighted A*: an optimistic approach to bounded suboptimal search. In: ICAPS, pp 355–362

  18. Hansen EA, Zhou R (2007) Anytime heuristic search. J Artif Intell Res 28:267–297. https://doi.org/10.1613/jair.2096

    Article  MathSciNet  MATH  Google Scholar 

  19. Gong BL, Jiang Y, Nasry H, Xiong G (2012) ARA*+: improved path planning algorithm based on ARA. In: 2012 IEEE/WIC/ACM international conferences on web intelligence and intelligent agent technology, vol 2, pp 361–365. 10.1109/wi-iat.2012.13

  20. Hornung A, Dombush A, Likhachev M, Bennewitz M (2012) Anytime search-based footstep planning with suboptimality bounds. In: 2012 12th IEEE-RAS international conference on humanoid robots. IEEE, pp 674–679. https://doi.org/10.1109/humanoids.2012.6651592.

  21. Likhachev M, Gordon GJ, Thrun S (2004) ARA*: anytime A* with provable bounds on sub-optimality. In: Advanced in neural information processing systems, pp 767–774

Download references

Acknowledgements

This work was supported by a 2-Year Research Grant of Pusan National University.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Daewoo Lee.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lim, D., Park, J., Han, D. et al. UAV Path Planning with Derivative of the Heuristic Angle. Int. J. Aeronaut. Space Sci. 22, 140–150 (2021). https://doi.org/10.1007/s42405-020-00323-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s42405-020-00323-1

Keywords

Navigation