TY - JOUR
T1 - Multi-objective evolutionary approach to prevent premature convergence in Monte Carlo localization
AU - Chien, Chiang Heng
AU - Wang, Wei Yen
AU - Hsu, Chen Chien
N1 - Funding Information:
This research is partially supported by the “Aim for the Top University Project” and “Center of Learning Technology for Chinese” of National Taiwan Normal University (NTNU), sponsored by the Ministry of Education, Taiwan, R.O.C. and the “International Research-Intensive Center of Excellence Program” of NTNU and Ministry of Science and Technology, Taiwan, R.O.C. under Grants no. MOST 104-2911-I-003-301 and MOST 103-2221-E-003-027 .
Publisher Copyright:
© 2016 Elsevier B.V.
PY - 2017/1/1
Y1 - 2017/1/1
N2 - In this paper, we propose a global localization algorithm for mobile robots based on Monte Carlo localization (MCL), which employs multi-objective particle swarm optimization (MOPSO) incorporating a novel archiving strategy, to deal with the premature convergence problem in global localization in highly symmetrical environments. Under three proposed rules, premature convergence occurring during the localization can be easily detected so that the proposed MOPSO is introduced to obtain a uniformly distributed Pareto front based on two objective functions respectively representing weights and distribution of particles in MCL. On the basis of the derived Pareto front, MCL is able to resample particles with balanced weights as well as diverse distribution of the population. As a consequence, the proposed approach provides better diversity for particles to explore the environment, while simultaneously maintaining good convergence to achieve a successful global localization. Simulations have confirmed that the proposed approach can significantly improve global localization performance in terms of success rate and computational time in highly symmetrical environments.
AB - In this paper, we propose a global localization algorithm for mobile robots based on Monte Carlo localization (MCL), which employs multi-objective particle swarm optimization (MOPSO) incorporating a novel archiving strategy, to deal with the premature convergence problem in global localization in highly symmetrical environments. Under three proposed rules, premature convergence occurring during the localization can be easily detected so that the proposed MOPSO is introduced to obtain a uniformly distributed Pareto front based on two objective functions respectively representing weights and distribution of particles in MCL. On the basis of the derived Pareto front, MCL is able to resample particles with balanced weights as well as diverse distribution of the population. As a consequence, the proposed approach provides better diversity for particles to explore the environment, while simultaneously maintaining good convergence to achieve a successful global localization. Simulations have confirmed that the proposed approach can significantly improve global localization performance in terms of success rate and computational time in highly symmetrical environments.
KW - Global localization
KW - Mobile robots
KW - Monte carlo localization
KW - Multi-objective particle swarm optimization
KW - Premature convergence
UR - http://www.scopus.com/inward/record.url?scp=85000472381&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85000472381&partnerID=8YFLogxK
U2 - 10.1016/j.asoc.2016.11.020
DO - 10.1016/j.asoc.2016.11.020
M3 - Article
AN - SCOPUS:85000472381
SN - 1568-4946
VL - 50
SP - 260
EP - 279
JO - Applied Soft Computing
JF - Applied Soft Computing
ER -