Accompaniment and collision avoidance for a cane-type robot using dynamic cost maps and MPC

Abstract This paper presents a dynamic object collision avoidance algorithm for a cane-type accompanying robot designed to support individuals who can walk independently but experience anxiety. The proposed method ensures a consistent light-touch contact support point while preserving the user’s voluntary walking behavior in dynamic environments. Our approach comprises two core components. First, we propose a tentative target point selection algorithm based on a dynamic cost map. This map reflects not only static objects but also dynamic objects, allowing the robot to determine an optimal target from candidate points positioned around the user. Second, we develop a velocity command generation method using Model Predictive Control tailored for accompaniment tasks. This formulation incorporates dynamic obstacle constraints to compute optimal velocity commands in real-time. To evaluate the effectiveness of the proposed algorithm, we conducted experiments in a living lab and with a real robot. The results demonstrate that the proposed framework achieves safe and smooth accompaniment while effectively avoiding dynamic objects.

Authors

Institutions

Publication Details

Journal
ROBOMECH Journal
Published
2026-05-14
DOI
https://doi.org/10.1186/s40648-026-00345-6
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Accompaniment and collision avoidance for a cane-type robot using dynamic cost maps and MPC

Yuki MIYACHI, Kenji Kato, Yasuhisa Hasegawa
ROBOMECH Journal
Robotic Path Planning Algorithms
article

Accompaniment and collision avoidance for a cane-type robot using dynamic cost maps and MPC

Yuki MIYACHI, Kenji Kato, Yasuhisa Hasegawa
article en

Abstract

Abstract This paper presents a dynamic object collision avoidance algorithm for a cane-type accompanying robot designed to support individuals who can walk independently but experience anxiety. The proposed method ensures a consistent light-touch contact support point while preserving the user’s voluntary walking behavior in dynamic environments. Our approach comprises two core components. First, we propose a tentative target point selection algorithm based on a dynamic cost map. This map reflects not only static objects but also dynamic objects, allowing the robot to determine an optimal target from candidate points positioned around the user. Second, we develop a velocity command generation method using Model Predictive Control tailored for accompaniment tasks. This formulation incorporates dynamic obstacle constraints to compute optimal velocity commands in real-time. To evaluate the effectiveness of the proposed algorithm, we conducted experiments in a living lab and with a real robot. The results demonstrate that the proposed framework achieves safe and smooth accompaniment while effectively avoiding dynamic objects.

ROBOMECH JournalVol. 13(1)
National Center for Geriatrics and Gerontology (JP), Nagoya University (JP), Meijo University (JP)
Reduced inequalities
Openalex Percentile: Top 3%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.