Back to Search
Start Over
Research progress of multi-objective path planning optimization algorithms.
- Source :
-
AIP Conference Proceedings . 2023, Vol. 3017 Issue 1, p1-5. 5p. - Publication Year :
- 2023
-
Abstract
- The field of robotics research has been well developed with the combination of computers and machinery. With the advancement of artificial intelligence, mobile robots are also attracting more attention today, and path planning is a crucial foundational technology for mobile robots to complete transportation requirements and reach pertinent target areas. In an efficiency-conscious society, the single-goal planning of transmission is gradually failing to meet the needs of enterprises and factories for efficient operations, path planning that can simultaneously plan the optimal methods and reach many target points is increasingly replacing the conventional single-goal path planning. However, there are more factors to be considered in the real complex environment to face various complex road conditions, and for this reason, various single or hybrid algorithms are being optimized and solved for this kind of problem. This paper summarizes the main methods of path planning to simulate the scale of obstacles and environmental scene maps in various conditions, focusing on several basic algorithms and their hybrid algorithms for solving multi-objective path planning problems in global and local path planning, as well as their improvements and innovations on the basic algorithms. This paper's primary idea is to divide the multi-path planning process into various components and substitute each part into a suitable algorithm and model to solve it separately to accomplish the task of reaching multiple target points efficiently. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0094243X
- Volume :
- 3017
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- AIP Conference Proceedings
- Publication Type :
- Conference
- Accession number :
- 173657139
- Full Text :
- https://doi.org/10.1063/5.0171019