Navigation among movable obstacles using machine learning based total time cost optimization

1 List, CEA, UniversitĀ“e Paris-Saclay, 91120 Palaiseau, France
2 U2IS, ENSTA Paris, Institut Polytechnique de Paris, 91120 Palaiseau, France

Abstract

Most navigation approaches treat obstacles as static objects and choose to bypass them. However, the detour could be costly or could lead to failures in indoor environments. The recently developed navigation among movable obstacles~(NAMO) methods prefer to remove all the movable obstacles blocking the way, which might be not the wisest choice when planning and performing obstacle displacement takes a long time. We propose a pipeline where the robot solves the NAMO problems by optimizing the total time to reach the goal. This is achieved by a supervised learning approach that can predict the time to plan and perform obstacle motion before actually doing it if this leads to faster goal reaching. Besides, a pose generator based on reinforcement learning is proposed to predict the stock region pose, where the robot could unload the obstacles when removing them. The method is evaluated in two kinds of simulation environments and the results demonstrate its advantages compared to the classical bypass and obstacle removal strategies.

Another Carousel

Poster

BibTeX

BibTex Code Here