Applying the MOVNS (multi-objective variable neighborhood search) algorithm to solve the path planning problem in mobile robotics

Nowadays, robots are playing a fundamental role.The Path Planning problem is one of the most researched topics in mobile robotics.A new multi-objective approach based on Variable Neighborhood Search is proposed.Three objectives were optimized: path safety, path length, and path smoothness.We used eight realistic scenarios and compared with the state of the art. Mobile robots must calculate the appropriate navigation path before starting to move to its destination. This calculation is known as the Path Planning (PP) problem. The PP problem is one of the most researched topics in mobile robotics. Taking into account that the PP problem is an NP-hard problem, Multi-Objective Evolutionary Algorithms (MOEAs) are good candidates to solve this problem. In this work, a new multi-objective evolutionary approach based on the Variable Neighborhood Search (MOVNS) is proposed to solve the PP problem. To the best of our knowledge, this is the first time that MOVNS is proposed to solve the path planning of mobile robots. The proposed MOVNS handles three different objectives in order to obtain accurate and efficient paths. These objectives are: the path safety, the path length, and the path smoothness (related to the energy consumption). Furthermore, in order to test the proposed MOEA, we have used eight realistic scenarios for the paths calculation. On the other hand, we also compared our proposal with other approaches of the state of the art, showing the advantages of MOVNS. In particular, in order to evaluate the obtained results we applied different quality metrics. Moreover, to demonstrate the statistical robustness of the obtained results we also performed a statistical analysis. Finally, the study shows that the proposed MOVNS is a good alternative to solve the PP problem, producing good paths with less length, more safety, and more smooth movements. We think this is an important contribution to the mobile robotics, and therefore, to the field of expert and intelligent systems.

[1]  Jianhua Zhang,et al.  Multi-objective Particle Swarm Optimization for Robot Path Planning in Environment with Danger Sources , 2011, J. Comput..

[2]  S. Geetha,et al.  Multi objective mobile robot path planning based on hybrid algorithm , 2011, 2011 3rd International Conference on Electronics Computer Technology.

[3]  Kalyanmoy Deb,et al.  Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms , 2012, Soft Computing.

[4]  Corina Cimpanu,et al.  Multiobjective hybrid evolutionary path planning with adaptive pareto ranking of variable-length chromosomes , 2014, 2014 IEEE 12th International Symposium on Applied Machine Intelligence and Informatics (SAMI).

[5]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[6]  Alexander Lavin,et al.  A Pareto Front-Based Multiobjective Path Planning Algorithm , 2015, ArXiv.

[7]  Jing-Sin Liu,et al.  Generating minimax-curvature and shorter η3-spline path using multi-objective variable-length genetic algorithm , 2010, 2010 International Conference on Networking, Sensing and Control (ICNSC).

[8]  Anand Nayyar,et al.  Advances in Swarm Intelligence for Optimizing Problems in Computer Science , 2018 .

[9]  R. Bartle The elements of integration and Lebesgue measure , 1995 .

[10]  Hu Jun,et al.  Multi-objective Mobile Robot Path Planning Based on Improved Genetic Algorithm , 2010, 2010 International Conference on Intelligent Computation Technology and Automation.

[11]  Hesam Omranpour,et al.  Solving robot path planning problem by using a new elitist multi-objective IWD algorithm based on coefficient of variation , 2015, Soft Computing.

[12]  Yan-tao Tian,et al.  Multi-objective path planning for unrestricted mobile , 2009, 2009 IEEE International Conference on Automation and Logistics.

[13]  Jing-Sin Liu,et al.  High-quality path planning for autonomous mobile robots with η3-splines and parallel genetic algorithms , 2009, 2008 IEEE International Conference on Robotics and Biomimetics.

[14]  Kalyanmoy Deb,et al.  Multi-objective path planning using spline representation , 2011, 2011 IEEE International Conference on Robotics and Biomimetics.

[15]  Alexander Lavin,et al.  A Pareto Optimal D* Search Algorithm for Multiobjective Path Planning , 2015, ArXiv.

[16]  P. Hansen,et al.  Variable neighborhood search for the p-median , 1997 .

[17]  Miguel A. Vega-Rodríguez,et al.  MOSFLA-MRPP: Multi-Objective Shuffled Frog-Leaping Algorithm applied to Mobile Robot Path Planning , 2015, Eng. Appl. Artif. Intell..

[18]  Artificial Intelligence and Computational Intelligence , 2011, Lecture Notes in Computer Science.

[19]  Dunwei Gong,et al.  Robot path planning in an environment with many terrains based on interval multi-objective PSO , 2013, 2013 IEEE Congress on Evolutionary Computation.

[20]  Jianhua Zhang,et al.  Robot path planning in uncertain environment using multi-objective particle swarm optimization , 2013, Neurocomputing.

[21]  Ellips Masehian,et al.  A multi-objective PSO-based algorithm for robot path planning , 2010, 2010 IEEE International Conference on Industrial Technology.

[22]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[23]  Jong-Hwan Kim,et al.  Evolutionary multi-objective optimization in robot soccer system for education , 2009, IEEE Computational Intelligence Magazine.

[24]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[25]  Hongwei Mo,et al.  Constrained Multi-objective Biogeography Optimization Algorithm for Robot Path Planning , 2013, ICSI.

[26]  Lingfeng Wang,et al.  Design and Control of Intelligent Robotic Systems , 2009 .

[27]  Jong-Hwan Kim,et al.  Multiobjective quantum-inspired evolutionary algorithm for fuzzy path planning of mobile robot , 2009, 2009 IEEE Congress on Evolutionary Computation.

[28]  Nafiseh Sedaghat,et al.  Mobile robot path planning by new structured multi-objective genetic algorithm , 2011, 2011 International Conference of Soft Computing and Pattern Recognition (SoCPaR).

[29]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[30]  Dalong Wang,et al.  Ranked Pareto Particle Swarm Optimization for Mobile Robot Motion Planning , 2009 .

[31]  Ellips Masehian,et al.  Multi-Objective PSO- and NPSO-based Algorithms for Robot Path Planning , 2010 .

[32]  Zexuan Zhu,et al.  Global Path Planning of Wheeled Robots Using a Multi-Objective Memetic Algorithm , 2013, IDEAL.

[33]  Pierre Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[34]  Ellips Masehian,et al.  Multi-objective robot motion planning using a particle swarm optimization model , 2010, Journal of Zhejiang University SCIENCE C.

[35]  Shiyin Qin,et al.  Multi-objective Path Planning for Space Exploration Robot Based on Chaos Immune Particle Swarm Optimization Algorithm , 2011, AICI.

[36]  Corina Cimpanu,et al.  Pareto genetic path planning hybridized with multi-objective Dijkstra's algorithm , 2014, 2014 18th International Conference on System Theory, Control and Computing (ICSTCC).

[37]  Tiong Sieh Kiong,et al.  Cognitive Map approach for mobility path optimization using multiple objectives genetic algorithm , 2000, 2009 4th International Conference on Autonomous Robots and Agents.

[38]  Mansoor Davoodi Monfared,et al.  Multi-objective path planning in discrete space , 2013, Appl. Soft Comput..

[39]  P. Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[40]  Chen-Yuan Chen,et al.  RETRACTED: Path planning for autonomous robots – a comprehensive analysis by a greedy algorithm , 2013 .

[41]  David J. Sheskin,et al.  Handbook of Parametric and Nonparametric Statistical Procedures , 1997 .

[42]  Miguel A. Vega-Rodríguez,et al.  Solving the multi-objective path planning problem in mobile robotics with a firefly-based approach , 2015, Soft Computing.