In the literature, numerous path planning algorithms have been proposed. Although the objective of these algorithms is to find the shortest path between two positions A and B in a particular environment, there are several algorithms based on a diversity of approaches to find a solution to this problem. The complexity of algorithms depends on the underlying techniques and on other external parameters, including the accuracy of the map and the number of obstacles. It is impossible to enumerate all these approaches in this chapter, but we will shed the light on the most used approaches in the literature.
CITATION STYLE
Koubaa, A., Bennaceur, H., Chaari, I., Trigui, S., Ammar, A., Sriti, M. F., … Javed, Y. (2018). Background on artificial intelligence algorithms for global path planning. In Studies in Computational Intelligence (Vol. 772, pp. 13–51). Springer Verlag. https://doi.org/10.1007/978-3-319-77042-0_2
Mendeley helps you to discover research relevant for your work.