Abstract
The graph-search algorithms developed between 60s and 80s were widely used in many fields, from robotics to video games. The A* algorithm shall be mentioned between some of the most important solutions explicitly oriented to motion-robotics, improving the logic of graph search with heuristic principles inside the loop. Nevertheless, one of the most important drawbacks of the A* algorithm resides in the heading constraints connected with the grid characteristics. Different solutions were developed in the last years to cope with this problem, based on post-processing algorithms or on improvements of the graph-search algorithm itself. A very important one is Theta* that refines the graph search allowing to obtain paths with “any” heading. In the last two years, the Flight Mechanics Research Group of Politecnico di Torino studied and implemented different path planning algorithms. A Matlab based planning tool was developed, collecting four separate approaches: geometric predefined trajectories, manual waypoint definition, automatic waypoint distribution (i.e. optimizing camera payload capabilities) and a comprehensive A*-based algorithm used to generate paths, minimizing risk of collision with orographic obstacles. The tool named PCube exploits Digital Elevation Maps (DEMs) to assess the risk maps and it can be used to generate waypoint sequences for UAVs autopilots. In order to improve the A*-based algorithm, the solution is extended to tri-dimensional environments implementing a more effective graph search (based on Theta*). In this paper the application of basic Theta* to tri-dimensional path planning will be presented. Particularly, the algorithm is applied to orographic obstacles and in urban environments, to evaluate the solution for different kinds of obstacles. Finally, a comparison with the A* algorithm will be introduced as a metric of the algorithm performances.
Similar content being viewed by others
References
Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87–90 (1958)
Bertuccelli, L.F., How, J.P.: Robust UAV search for environmentas with imprecise probability maps. In: IEEE Conference of Decision and Control, Seville, Spain (2005)
Capozzi, B.J.: Evolution-based path planning and management for autonomous UAVs. Ph.D. Dissertation, University of Washington, USA (2001)
De Filippis, L., Guglieri, G., Quagliotti, F.: A minimum risk approach for path planning of UAVs. J. Intell. Robot. Syst. 1(2011), 203–222 (2011)
De Filippis, L., Guglieri, G., Quagliotti, F.: Flight Analysis and Design for Mini-UAVs. XX AIDAA Congress, Milano, Italy (2009)
Dijkstra, E.W.: A note to two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)
Ferguson, D., Stentz, A.: Using interpolation to improve path planning: the field D* algorithm. J. Field Robot. 23(2), 79–101 (2006)
Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)
Ford, L.R., Jr., Fulkerson, D.R.: Flows in Networks. Princeton University Press (1962)
Guglieri, G., Quagliotti, F., Speciale, G.: Optimal trajectory tracking for an autonomous Uav. In: Automatic Control in Aerospace, vol. 1(1) (2008)
Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. SCC-4(2), 100–107 (1968)
Horner, D.P., Healey, A.J.: Use of artificial potential fields for UAV guidance and optimization of WLAN communications. In: Autonomous Underwater Vehicles, 2004 IEEE/OES, pp. 88–95, 17–18 June 2004
Koenig, S., Likhachev, M.: D* Lite. In: Proceeding of the AAAI Conference on Artificial Intelligence, pp. 476–483 (2002)
Koenig, S., Likhachev, M.: Incremental A*. In: Proceeding of the Natural Information Processing Systems (2001)
Nash, A., Daniel, K., Koenig, S., Felner, A.: Theta*: any-angle path planning on grids. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 1177–1183 (2007)
Nikolos, I.K., Tsourveloudis, N.C., Valavanis, K.P.: Evolutionary algorithm based offline/online path planner for UAV navigation. IEEE Trans. Syst. Man Cybern., Part B, Cybern. 33(6), 898–912 (2003)
Pfeiffer, B., Batta, R., Klamroth, K., Nagi, R.: Path planning for UAVs in the presence of threat zones using probabilistic modelling. In: Handbook of Military Industrial Engineering. Taylor and Francis, USA (2008)
Stentz, A.: Optimal and efficient path planning for unknown and dynamic environments. Carnegie Mellon Robotics Institute Technical Report, CMU-RI-TR-93-20 (1993)
Stentz, A.: The focussed D* algorithm for real-time replanning. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 1652–1659 (1995)
Warshall, S.: A theorem on Boolean matrices. J. ACM 9(1), 11–12 (1962)
Waydo, S., Murray, R.M.: Vehicle motion planning using stream functions. In: 2003 IEEE International Conference on Robotics and Automation (2003)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
De Filippis, L., Guglieri, G. & Quagliotti, F. Path Planning Strategies for UAVS in 3D Environments. J Intell Robot Syst 65, 247–264 (2012). https://doi.org/10.1007/s10846-011-9568-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10846-011-9568-2