Solving the multi-objective path planning problem in mobile robotics with a firefly-based approach

被引:82
作者
Hidalgo-Paniagua, Alejandro [1 ]
Vega-Rodriguez, Miguel A. [1 ]
Ferruz, Joaquin [2 ]
Pavon, Nieves [3 ]
机构
[1] Univ Extremadura, Dept Technol Comp & Commun, Polytech Sch, Caceres, Spain
[2] Univ Seville, Higher Tech Sch Engn, Dept Syst Engn & Automat, Seville, Spain
[3] Univ Huelva, Higher Tech Sch Engn, Dept Informat Technol, Huelva, Spain
关键词
Path planning; MO-FA; Swarm intelligence; Robotics; Realistic maps; Energy consumption; PARTICLE SWARM OPTIMIZATION; EVOLUTIONARY ALGORITHMS;
D O I
10.1007/s00500-015-1825-z
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Currently, autonomous robotics is one of the most interesting and researched areas of technology. At the beginning, robots only worked in the industrial sector but, gradually, they started to be introduced into other sectors such as medicine or social environments becoming part of society. In mobile robots, the path planning (PP) problem is one of the most researched topics. 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 approach based on the flashing behavior of fireflies in nature, the multi-objective firefly algorithm (MO-FA), is proposed to solve the PP problem. This proposed algorithm is a swarm intelligence algorithm. The proposed MO-FA handles three different objectives to obtain accurate and efficient solutions. These objectives are the following: the path safety, the path length, and the path smoothness (related to the energy consumption). Furthermore, and to test the proposed MOEA, we have used eight realistic scenarios for the path's calculation. On the other hand, we also compare our proposal with other approaches of the state of the art, showing the advantages of MO-FA. In particular, to evaluate the obtained results we applied specific quality metrics. Moreover, to demonstrate the statistical evidence of the obtained results, we also performed a statistical analysis. Finally, the study shows that the proposed MO-FA is a good alternative to solve the PP problem.
引用
收藏
页码:949 / 964
页数:16
相关论文
共 34 条
  • [1] Ahmed F., 2011, 2011 IEEE International Conference on Robotics and Biomimetics (ROBIO), P1047, DOI 10.1109/ROBIO.2011.6181426
  • [2] Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms
    Ahmed, Faez
    Deb, Kalyanmoy
    [J]. SOFT COMPUTING, 2013, 17 (07) : 1283 - 1299
  • [3] [Anonymous], 2006, Planning algorithms
  • [4] [Anonymous], 2011, IRACE PACKAGE ITERAT
  • [5] [Anonymous], ROB BIOM 2008 ROBIO
  • [6] [Anonymous], 2011, INT ENCY STAT SCI
  • [7] Bartle R., 2011, The Elements of Integration and Lebesgue Measure
  • [8] On the Complexity of Computing the Hypervolume Indicator
    Beume, Nicola
    Fonseca, Carlos M.
    Lopez-Ibanez, Manuel
    Paquete, Luis
    Vahrenhold, Jan
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2009, 13 (05) : 1075 - 1082
  • [9] Multi-objective path planning in discrete space
    Davoodi, Mansoor
    Panahi, Fatemeh
    Mohades, Ali
    Hashemi, Seyed Naser
    [J]. APPLIED SOFT COMPUTING, 2013, 13 (01) : 709 - 720
  • [10] A fast and elitist multiobjective genetic algorithm: NSGA-II
    Deb, K
    Pratap, A
    Agarwal, S
    Meyarivan, T
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) : 182 - 197