원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Path planning algorithm is a key issue among robot control areas. In practical engineering applications, traditional methods have some limitations to a certain degrees in key aspects of cost, efficiency, security, flexibility, portability, etc. Through the analysis and comparison of A-star algorithm and Dijkstra algorithm, path planning problem supporting multiple cars run parallely (PPSMC for short) in a static and dynamic obstacles co-existing environment is studied. An A-STAR-Dijkstra-integrated algorithm is promoted to make multiple cars moving parallely without collision or deadlock. Both two algorithms are optimized too. The algorithm has applied in smart park.
목차
Abstract
1. Introduction
2. Related Works
3. Basic Concept
3.1. Auto Guided Vehicle
3.2. Smart Park
3.3. Multi-path Planning
3.4. Limitations of A-star Algorithm
3.5. Limitations of Dijkstra Algorithm
4. Algorithm Design and Implementation
4.1. Optimized A-star Algorithm
4.2. Dijkstra Algorithm based on Rasterizing
5. Conclusion
Acknowledgements
References
1. Introduction
2. Related Works
3. Basic Concept
3.1. Auto Guided Vehicle
3.2. Smart Park
3.3. Multi-path Planning
3.4. Limitations of A-star Algorithm
3.5. Limitations of Dijkstra Algorithm
4. Algorithm Design and Implementation
4.1. Optimized A-star Algorithm
4.2. Dijkstra Algorithm based on Rasterizing
5. Conclusion
Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보