2020
DOI: 10.1016/j.asoc.2020.106076
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective path planning of an autonomous mobile robot using hybrid PSO-MFB optimization algorithm

Abstract: The main aim of this paper is to solve a path planning problem for an autonomous mobile robot in static and dynamic environments. The problem is solved by determining the collision-free path that satisfies the chosen criteria for shortest distance and path smoothness. The proposed path planning algorithm mimics the real world by adding the actual size of the mobile robot to that of the obstacles and formulating the problem as a moving point in the free-space. The proposed algorithm consists of three modules. T… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
86
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
4

Relationship

3
7

Authors

Journals

citations
Cited by 142 publications
(87 citation statements)
references
References 38 publications
(52 reference statements)
0
86
0
1
Order By: Relevance
“…An improved version of the genetic algorithm (GA), based on special selection and the crossover function, led to a reduced computation time of GA. In addition to the shortest global path in hexagonal grid modelling, which was investigated in Reference [6], the shortest and smoothest safest path in static and dynamic environment was obtained using the Hybrid PSO-MFB algorithm and a local search, in addition to the obstacle detection and avoidance (ODA) technique, as presented in Reference [7]. Researchers in Reference [8] developed an ant colony optimization (ACO) path planner by improving the probability of selecting the optimal path to establish target attraction and proposed a wolf colony to update pheromones for an explosion proof robot (EPR).…”
Section: Introductionmentioning
confidence: 99%
“…An improved version of the genetic algorithm (GA), based on special selection and the crossover function, led to a reduced computation time of GA. In addition to the shortest global path in hexagonal grid modelling, which was investigated in Reference [6], the shortest and smoothest safest path in static and dynamic environment was obtained using the Hybrid PSO-MFB algorithm and a local search, in addition to the obstacle detection and avoidance (ODA) technique, as presented in Reference [7]. Researchers in Reference [8] developed an ant colony optimization (ACO) path planner by improving the probability of selecting the optimal path to establish target attraction and proposed a wolf colony to update pheromones for an explosion proof robot (EPR).…”
Section: Introductionmentioning
confidence: 99%
“…Although the collision path can be moved to the feasible region depending on the searching ability of the algorithm itself, it requires many iterations of the algorithm and is a slow process. Therefore, some methods [26,27] are proposed to move the collision path to the feasible region. All of these processing methods speed up the convergence of the algorithm by moving the collision path to the outside of the obstacle in one operation, and also reduce the infeasible paths in the population rapidly.…”
Section: B the Treatment Of Infeasible Pathmentioning
confidence: 99%
“…This optimization tuner is characterized by fast convergence, the efficiency of computation and it has the capability to find local and global solutions [ 31 , 32 ]. Other modern and generalized optimization techniques can be employed either to improve the optimization process or to make a comparison in performance among each other [ 33 , 34 , 35 , 36 , 37 , 38 , 39 , 40 , 41 ].…”
Section: Introductionmentioning
confidence: 99%