Modeling a Social Placement Cost to Extend Navigation Among Movable Obstacles (NAMO) Algorithms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Modeling a Social Placement Cost to Extend Navigation Among Movable Obstacles (NAMO) Algorithms

Résumé

Current Navigation Among Movable Obstacles (NAMO) algorithms focus on finding a path for the robot that only optimizes the displacement cost of navigating and moving obstacles out of its way. However, in a human environment, this focus may lead the robot to leave the space in a socially inappropriate state that may hamper human activity (i.e. by blocking access to doors, corridors, rooms or objects of interest). In this paper, we tackle this problem of "Social Placement Choice" by building a social occupation costmap, built using only geometrical information. We present how existing NAMO algorithms can be extended by exploiting this new cost map. Then, we show the effectiveness of this approach with simulations, and provide additional evaluation criteria to assess the social acceptability of plans.
Fichier principal
Vignette du fichier
IROS_2020_Camera_Ready.pdf (2.13 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02912925 , version 1 (09-11-2020)

Identifiants

Citer

Benoit Renault, Jacques Saraydaryan, Olivier Simonin. Modeling a Social Placement Cost to Extend Navigation Among Movable Obstacles (NAMO) Algorithms. IROS 2020 - IEEE/RSJ International Conference on Intelligent Robots and Systems, Oct 2020, Las Vegas, United States. pp.11345-11351, ⟨10.1109/IROS45743.2020.9340892⟩. ⟨hal-02912925⟩
101 Consultations
169 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More