Improved dynamic double mutation particle swarm optimization for mobile robot path planning

This paper presents a new path planning approach, in which the MAKLINK graph is constructed to describe the complex environment of the mobile robot, the enumeration method ideas into Dijkstra algorithm is used to obtain the shortest path, and the dynamic double mutation particle swarm optimization a...

Full description

Saved in:
Bibliographic Details
Published in2016 Chinese Control and Decision Conference (CCDC) pp. 3235 - 3239
Main Authors Liao, Linling, Cai, Xiushan, Huang, Huadong, Liu, Yanhong
Format Conference Proceeding Journal Article
LanguageEnglish
Published IEEE 01.05.2016
Subjects
Algorithm design and analysis
Algorithms
Conferences
Dijkstra algorithm
Double mutation particle swarm
Dynamics
enumeration method
Heuristic algorithms
MAKLINK graph
Mutations
Optimization
Particle swarm optimization
Path planning
Planning
Robots
Swarm intelligence
Online AccessGet full text

Cover

More Information
Summary:This paper presents a new path planning approach, in which the MAKLINK graph is constructed to describe the complex environment of the mobile robot, the enumeration method ideas into Dijkstra algorithm is used to obtain the shortest path, and the dynamic double mutation particle swarm optimization algorithm is adopted to get the optimal path. Finally, simulation results are used to illustrate the validity of the proposed method.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:1948-9447
DOI:10.1109/CCDC.2016.7531540