2015
DOI: 10.1016/j.advengsoft.2014.09.006
|View full text |Cite
|
Sign up to set email alerts
|

Efficient collision-free path-planning of multiple mobile robots system using efficient artificial bee colony algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
54
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 112 publications
(54 citation statements)
references
References 26 publications
0
54
0
Order By: Relevance
“…Equations (19) and (20) correspond to the trajectory tests 1 to 4, respectively. We have to mention that for the compared methods, joint limits are not considered, and we did not solve the orientation problem due to the kinematic limitations of the considered 4-DOF car-like mobile manipulator.…”
Section: Comparison Testsmentioning
confidence: 99%
See 1 more Smart Citation
“…Equations (19) and (20) correspond to the trajectory tests 1 to 4, respectively. We have to mention that for the compared methods, joint limits are not considered, and we did not solve the orientation problem due to the kinematic limitations of the considered 4-DOF car-like mobile manipulator.…”
Section: Comparison Testsmentioning
confidence: 99%
“…9 With respect to robotic researches, these algorithms are wisely used to solve the inverse kinematics and pathtracking problems, [10][11][12][13] motion planning, 14,15 visual servo control, 16,17 and mobile navigation. [18][19][20][21][22][23] In this work, we propose the use of metaheuristic algorithms to solve the inverse kinematics of mobile manipulators as a constrained optimization problem. Initially, we define an objective function to minimize the error between the desired and the actual end-effector pose.…”
Section: Introductionmentioning
confidence: 99%
“…Evolutionary algorithms such as Particle Swarm Optimization (PSO) [17][18][19], Ant Colony Optimization (ACO) [20] and Genetic Algorithm (GA) [21] are suitable for multi-objective problems. Many other evolutionary algorithms such as Artificial Bee Colony (ABC) [22], Bacterial Foraging Optimization (BFO) [23], Bio Inspired Neural Networks [24,25], and Fire Fly algorithm [26] are often trapped in local optimum, and bear high computational cost. Moreover, they are highly sensitive to search space size and data representation scheme of problem [27,28].…”
Section: Introductionmentioning
confidence: 99%
“…To be able to find this path, the mobile robot should run an adequate path planning algorithm. Several research works, for path planning of mobile robots, have been proposed in the literature (Cai and Peng, 2002;Liang and Lee, 2015;Nishitani and Matsumura, 2015;Liu and Arimoto, 1991;Zhong et al, 2014).…”
Section: Introductionmentioning
confidence: 99%