arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.10085cs.RO
收藏

移动机器人探测中目标选择的一种综合方法

An Integrated Approach to Goal Selection in Mobile Robot Exploration

Czech Institute of Informatics, Robotics, and Cybernetics(捷克信息学、机器人学与控制论研究所);Czech Technical University in Prague(捷克布拉格技术大学)

Miroslav Kulich, Jiří Kubalík, Libor Přeučil

摘要:

研究了移动机器人在未知二维环境中的自主导航问题,以尽可能有效地探索环境。我们假设一个地面移动机器人配备了测距传感器,具有有限的范围和360度的视野。探索过程的关键部分被制定为d-Watchman路线问题,它包括两个耦合的任务-候选目标生成和通过目标的子集找到最佳路径-这是解决在每个探索步骤。后者已被定义为广义旅行商问题的一个受约束的变种,并使用进化算法解决。提出了一种基于间接表示和最近邻构造过程的进化算法来解决该问题。在这种进化算法中进化的个体并不直接编码问题的解决方案。相反,它们表示构造可行解的指令序列。有效地产生可行的解决方案时,通常会出现传统的进化算法约束优化问题的问题,消除这种方式。在三张地图上的模拟环境中对拟议的探索框架进行了评估,并将探索整个环境所需的时间与最先进的探索方法进行了比较。实验结果表明,我们的方法优于比较的环境中的低密度的障碍物高达12.5%,而它是在办公室一样的环境中最多4.5%略差。该框架还被部署在一个真正的机器人上,以证明所提出的解决方案与真正的硬件的适用性。

英文摘要:

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 360 degrees field of view. The key part of the exploration process is formulated as the d-Watchman Route Problem which consists of two coupled tasks - candidate goals generation and finding an optimal path through a subset of goals - 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 12.5%, while it is slightly worse in office-like environments by 4.5% at maximum. The framework has also been deployed on a real robot to demonstrate the applicability of the proposed solution with real hardware.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑