An Effective Way to Large-Scale Robot-Path-Planning Using a Hybrid Approach of Pre-Clustering and Greedy Heuristic

In this paper, a new robot path planning algorithm based on Quantum-inspired Evolutionary Algorithm (QEA) is proposed. QEA is an advanced evolutionary computing scheme with the quantum computing features such as qubits and superposition. It is suitable for solving large scale optimization problems. The proposed QEA algorithm works in the discretized environment, and approximates the optimal robot planing path in a highly computationally efficient fashion. The simulation results indicate that the proposed QEA algorithm is suitable for both complex static and dynamic environment and considerably outperforms the conventional genetic algorithm (GA) for solving the robot path planning problem. Our algorithm runs in only about 2[Formula: see text]s, which demonstrates that it can well tackle the optimization problem in robot path planning.

Download Full-text

Multi-robot Path Planning Based on Spatio-Temporal Information in Large-scale Unknown Environment

10.1109/m2vip49856.2021.9665033 ◽

2021 ◽

Author(s):

Junfeng Ding ◽

Lin Zhang ◽

Jiyu Cheng

Keyword(s):

Path Planning ◽

Large Scale ◽

Temporal Information ◽

Robot Path Planning ◽

Unknown Environment ◽

Spatio Temporal ◽

Robot Path ◽

Multi Robot

Download Full-text

Evaluation of a large scale pervasive embedded network for robot path planning

Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. ◽

10.1109/robot.2006.1642010 ◽

2006 ◽

Cited By ~ 5

Author(s):

K.J. O'Hara ◽

V. Bigio ◽

S. Whitt ◽

D. Walker ◽

T. Balch

Keyword(s):

Path Planning ◽

Large Scale ◽

Robot Path Planning ◽

Embedded Network ◽

Robot Path

Download Full-text

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

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.607.778 ◽

2014 ◽

Vol 607 ◽

pp. 778-781 ◽

Cited By ~ 1

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.

Download Full-text