Research on Robot Path Planning Based on Dijkstra and Ant Colony Optimization

In this paper, the path planning problem in known environments was studied. According to Dijkstra algorithm and ant colony optimization (ACO), we designed a hybrid algorithm to search the path. Based on the environment model, constructed by using visual graph method, Dijkstra algorithm was used for...

Full description

Saved in:
Bibliographic Details
Main Authors: Nie, Zhen, Zhao, Huailin
Format: Conference Proceeding
Language:English
Subjects:
Ant Colony Optimization (ACO)
Dijkstra Algorithm
Path Planning
Citations: Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, the path planning problem in known environments was studied. According to Dijkstra algorithm and ant colony optimization (ACO), we designed a hybrid algorithm to search the path. 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 optimizes 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. The algorithm is effective and feasible.
ISSN:2189-8723
DOI:10.1109/ICIIBMS46890.2019.8991502