An Integrated Approach to Goal Selection in Mobile Robot Exploration

This paper deals with the problem of autonomous navigation of a mobile robot in an unknown 2D environment to fully explore the environment as efficiently as possible. We assume a terrestrial mobile robot equipped with a ranging sensor with a limited range and <inline-formula> <math display=...

Full description

Bibliographic Details
Main Authors: Miroslav Kulich, Jiří Kubalík, Libor Přeučil
Format: Article
Language:English
Published: MDPI AG 2019-03-01
Series:Sensors
Subjects:
Online Access:https://www.mdpi.com/1424-8220/19/6/1400
Description
Summary:This paper deals with the problem of autonomous navigation of a mobile robot in an unknown 2D environment to fully explore the environment as efficiently as possible. We assume a terrestrial mobile robot equipped with a ranging sensor with a limited range and <inline-formula> <math display="inline"> <semantics> <msup> <mn>360</mn> <mo>&#176;</mo> </msup> </semantics> </math> </inline-formula> field of view. The key part of the exploration process is formulated as the d-Watchman Route Problem which consists of two coupled tasks&#8212;candidate goals generation and finding an optimal path through a subset of goals&#8212;which are solved in each exploration step. The latter has been defined as a constrained variant of the Generalized Traveling Salesman Problem and solved using an evolutionary algorithm. An evolutionary algorithm that uses an indirect representation and the nearest neighbor based constructive procedure was proposed to solve this problem. Individuals evolved in this evolutionary algorithm do not directly code the solutions to the problem. Instead, they represent sequences of instructions to construct a feasible solution. The problems with efficiently generating feasible solutions typically arising when applying traditional evolutionary algorithms to constrained optimization problems are eliminated this way. The proposed exploration framework was evaluated in a simulated environment on three maps and the time needed to explore the whole environment was compared to state-of-the-art exploration methods. Experimental results show that our method outperforms the compared ones in environments with a low density of obstacles by up to <inline-formula> <math display="inline"> <semantics> <mrow> <mn>12.5</mn> <mo>%</mo> </mrow> </semantics> </math> </inline-formula>, while it is slightly worse in office-like environments by <inline-formula> <math display="inline"> <semantics> <mrow> <mn>4.5</mn> <mo>%</mo> </mrow> </semantics> </math> </inline-formula> at maximum. The framework has also been deployed on a real robot to demonstrate the applicability of the proposed solution with real hardware.
ISSN:1424-8220