A Multi-Objective Path Planning Algorithm for Mobile Robots Based on Cellular Automata

Author(s):  
Yousef Naranjani ◽  
Jian-Qiao Sun

Many real-world applications of robot path planning involves not only finding the shortest path, but also achieving some other objectives such as minimizing fuel consumption or avoiding danger areas. This paper introduces a 2D path planning scheme that solves a multi-objective path planning problem on a 3D terrain. This allows the controller to pick the most suitable path among a set of optimal paths. The algorithm generates a cellular automaton for the terrain based on the objectives by applying various weighting factors via an evolutionary algorithm and finds the optimal path between the start point and the goal for each set of parameters considering static obstacles and maximum slope constraints. All the final trajectories share the same characteristic that they are non-dominated with respect to the rest of the set in the Multi-Objective Optimization Problems (MOP) context. The objectives considered in this study includes the path length, the elevation changes and avoiding the radars. Testing the algorithm on several problems showed that the method is very promising for mobile robot path planning applications.

2019 ◽  
Vol 29 (08) ◽  
pp. 2050122
Author(s):  
Liming Gao ◽  
Rong Liu ◽  
Fei Wang ◽  
Weizong Wu ◽  
Baohua Bai ◽  
...  

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.


2018 ◽  
Vol 2018 ◽  
pp. 1-27 ◽  
Author(s):  
Ben Beklisi Kwame Ayawli ◽  
Ryad Chellali ◽  
Albert Yaw Appiah ◽  
Frimpong Kyeremeh

Safe and smooth mobile robot navigation through cluttered environment from the initial position to goal with optimal path is required to achieve intelligent autonomous ground vehicles. There are countless research contributions from researchers aiming at finding solution to autonomous mobile robot path planning problems. This paper presents an overview of nature-inspired, conventional, and hybrid path planning strategies employed by researchers over the years for mobile robot path planning problem. The main strengths and challenges of path planning methods employed by researchers were identified and discussed. Future directions for path planning research is given. The results of this paper can significantly enhance how effective path planning methods could be employed and implemented to achieve real-time intelligent autonomous ground vehicles.


2021 ◽  
Vol 155 ◽  
pp. 107173
Author(s):  
Meng Zhao ◽  
Hui Lu ◽  
Siyi Yang ◽  
Yinan Guo ◽  
Fengjuan Guo

Sign in / Sign up

Export Citation Format

Share Document