Research on Robot Path Planning Based on Dijkstra and Ant Colony Optimization
| Main Author: | Zhen Nie, Huailin Zhao: SIT, Shanghai |
|---|---|
| Format: | Article Journal |
| Bahasa: | eng |
| Terbitan: |
, 2020
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/4261640 |
Daftar Isi:
- This paper studied on the path planning problem in known environments. According to Dijkstra algorithm and ant colony optimization (ACO), a hybrid algorithm to search the path was designed. Based on the environment model, constructed by using visual graph method, Dijkstra algorithm was used for initial path planning. Then the ACO was improved and used to optimize the initial path to minimize the path of the robot. The simulation on MATLAB showed that the path planning algorithm based on Dijkstra-ACO has higher efficiency of path search and good effect of path planning, and the algorithm is effective and feasible. Keywords: Dijkstra Algorithm, Ant Colony Optimization (ACO), Path Planning
- Applied Science and Computer Science Publications.