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

Open Access

Abstract: 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

Zhen Nie, Huailin Zhao

The Author field can not be Empty

School of Electrical and Electronic Engineering Shanghai Institute of Technology Shanghai, China

The Institution field can't be Empty

Volume 6, Issue 1

Volume and Issue can't be empty

231-327

The Page Numbers field can't be Empty

2432-5465

01-06-2020

Publication Date field can't be Empty
Want a discount? Become a member by purchasing Membership (1 Yr) – Professional-member, Membership (1 Yr) – Professional-member-renewal, Membership (1 Yr) – Student-member or Membership (1 Yr) – Student-member-renewal, or log in if you are a member.
Categories: , , Tag:

Related products