作者: Alejandro Hidalgo-Paniagua , Miguel A. Vega-Rodríguez , Joaquín Ferruz
DOI: 10.1016/J.ESWA.2016.03.035
关键词: Motion planning 、 Any-angle path planning 、 Path length 、 Evolutionary algorithm 、 Shortest path problem 、 Mobile robot 、 Variable neighborhood search 、 Mathematical optimization 、 Path (graph theory) 、 Mathematics 、 General Engineering 、 Artificial intelligence 、 Computer Science Applications
摘要: 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 …