Navigation among movable obstacles using machine learning based total time cost optimization - Institut Polytechnique de Paris Access content directly
Conference Papers Year : 2023

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

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 best choice when planning and moving obstacles 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 of planning and performing obstacle motion before actually doing it if this leads to faster goal reaching. Besides, a pose generator based on reinforcement learning is proposed to decide where the robot can move the obstacle. 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.

Domains

Automatic
Fichier principal
Vignette du fichier
namo_iros2023_preprint.pdf (3.04 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04250608 , version 1 (19-10-2023)

Identifiers

  • HAL Id : hal-04250608 , version 1

Cite

Kai Zhang, Eric Lucet, Julien Alexandre Dit Sandretto, David Filliat. Navigation among movable obstacles using machine learning based total time cost optimization. IROS 2023 - IEEE/RSJ International Conference on Intelligent Robots and Systems, Oct 2023, Detroit (MI), United States. ⟨hal-04250608⟩
57 View
34 Download

Share

Gmail Facebook X LinkedIn More