Mobile robot path planning algorithm by equivalent conduction heat flow topology optimization

2011 ◽  
Vol 45 (5) ◽  
pp. 703-715 ◽  
Author(s):  
Jae Chun Ryu ◽  
Frank Chongwoo Park ◽  
Yoon Young Kim
Keyword(s):  
Topology Optimization ◽  
Heat Flow ◽  
Path Planning ◽  
Mobile Robot ◽  
Robot Path Planning ◽  
Flow Topology ◽  
Planning Algorithm ◽  
Path Planning Algorithm ◽  
Conduction Heat Flow ◽  
Robot Path

A New Artificial Immune Network Model for Mobile Robot Path Planning

2013 ◽  
Vol 416-417 ◽  
pp. 757-761 ◽  
Author(s):  
Ming Xin Yuan ◽  
Pan Pan Zhang ◽  
Han Yang Li ◽  
Shuai Cheng ◽  
Yi Shen
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Antibody Concentration ◽  
Immune Network ◽  
Robot Path Planning ◽  
Uncertain Environments ◽  
Planning Algorithm ◽  
Immune Network Model ◽  
Path Planning Algorithm ◽  
Robot Path

To solve the mobile robot path planning in uncertain environments, a new path planning algorithm is presented on the basis of the biological immune network. The environment surrounding the robot is taken as the antigen, and the behavior strategy of robot is taken as the antibody. The selection model of antibody concentration is defined based on the Jernes idiotypic immune network hypothesis, and the mobile robot path planning is realized through the selection of the antibody concentration. The simulation of path planning for mobile robot in multi-obstacle environments shows that the robot can find a safe path in complicated environments, which verifies the better adaptivity of proposed planning model. The simulation in dynamic environments shows that the robot can safely avoid all dynamic obstacles, which verifies the better flexility of new algorithm.

scholarly journals A mobile robot path planning algorithm based on improved A*

2020 ◽  
Vol 1486 ◽  
pp. 032018
Author(s):  
Jinzheng Shi ◽  
Yifan Su ◽  
Chunguang Bu ◽  
Xiaoliang Fan
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Robot Path Planning ◽  
Planning Algorithm ◽  
Path Planning Algorithm ◽  
Robot Path

Comparison between Normal Waveform and Modified Wavefront Path Planning Algorithm for Mobile Robot

2014 ◽  
Vol 607 ◽  
pp. 778-781 ◽  
Author(s):  
Swee Ho Tang ◽  
Che Fai Yeong ◽  
Eileen Lee Ming Su
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Large Scale ◽  
Simulation Software ◽  
Robot Path Planning ◽  
Full Wave ◽  
Planning Algorithm ◽  
Path Planning Algorithm ◽  
Grid Based ◽  
Robot Path

Mobile robot path planning is about finding a movement from one position to another without collision. The wavefront is typically used for path planning jobs and appreciated for its efficiency, but it needs full wave expansion which takes significant amount of time and process in large scale environment. This study compared wavefront algorithm and modified wavefront algorithm for mobile robots to move efficiently in a collision free grid based static environment. The algorithms are compared in regards to parameters such as execution time of the algorithm and planned path length which is carried out using Player/Stage simulation software. Results revealed that modified wavefront algorithm is a much better path planning algorithm compared to normal wavefront algorithm in static environment.

Sign in / Sign up

Export Citation Format

Share Document