2013
DOI: 10.1016/j.neucom.2012.09.019
|View full text |Cite
|
Sign up to set email alerts
|

Robot path planning in uncertain environment using multi-objective particle swarm optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
139
0
3

Year Published

2014
2014
2021
2021

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 323 publications
(142 citation statements)
references
References 22 publications
0
139
0
3
Order By: Relevance
“…To prepare an optimal intelligent controller for an autonomous wheeled mobile robot, the Castillo et al [120] have designed the hybridization of an Ant Colony Optimization (ACO) algorithm and the Particle Swarm Optimization (PSO) algorithm to optimize the membership function of a fuzzy controller. Zhang et al [121] have proposed the Multi-Objective Particle Swarm Optimization Algorithm (MOPSO) to search a collision-free optimal path in the uncertain dynamic environment. Zhang & Li [122] have presented a new objective function for mobile robot navigation using PSO.…”
Section: Particle Swarm Optimization Algorithm For Mobile Robot Navigmentioning
confidence: 99%
“…To prepare an optimal intelligent controller for an autonomous wheeled mobile robot, the Castillo et al [120] have designed the hybridization of an Ant Colony Optimization (ACO) algorithm and the Particle Swarm Optimization (PSO) algorithm to optimize the membership function of a fuzzy controller. Zhang et al [121] have proposed the Multi-Objective Particle Swarm Optimization Algorithm (MOPSO) to search a collision-free optimal path in the uncertain dynamic environment. Zhang & Li [122] have presented a new objective function for mobile robot navigation using PSO.…”
Section: Particle Swarm Optimization Algorithm For Mobile Robot Navigmentioning
confidence: 99%
“…Typically in swarm robotics, success is achieved when some number of robots reach the goal or find a path [13,29,32,31,42,30]. However, for ACANTO, an activity is only considered completely successful if all the social group members complete the activity, and do so coherently.…”
Section: Robot Assistancementioning
confidence: 99%
“…The velocity of the particle V i can be represented by another D-dimensional vector V i = (V i1 ,...,V iD ). The best position visited by the ith particle is denoted as pbest i = (P i1 ,...,P iD ), and gbest as the index of the particle visited the best position in the swarm; thus, gbest becomes the best solution found so far Zhang et al (2013). The working of PSO algorithm is explained in the following procedures:…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%