Dynamic Reconfiguration Integrated Nested A*: A Path Planner for Reconfigurable Robot to Improve Performance in Confined Spaces

Path planning is crucial in numerous robotic applications. Reconfigurable robots possess the capability to alter their shape, enabling access to confined spaces, a task challenging for fixed-shape robots. However, existing path planners for reconfigurable robots are typically designed with predefined motion patterns for reconfiguration, lacking adaptation to space availability and executing reconfiguration only when the robot is static. This reliance on predefined patterns limits the potential of reconfigurable robots to navigate through confined spaces. This paper proposes a novel path-planning approach based on dynamic reconfiguration to address this limitation. The proposed method employs two nested A* algorithms modified to handle reconfiguration and efficient search, termed Dynamic Reconfiguration integrated Nested A* (DRiNA*). Experimental results demonstrate the proposed method’s ability to find feasible paths for robot navigation using dynamic reconfigurations in confined spaces, surpassing the capabilities of existing path planners. The scalability of the proposed method to reconfigurable robots with varying numbers of blocks is also confirmed. Additionally, DRiNA* significantly reduces energy consumption compared to existing path planners.

Authors

Institutions

Publication Details

Published
2024-10-14
DOI
https://doi.org/10.1109/iros58592.2024.10802331
Primary Topic
Modular Robots and Swarm Intelligence
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Reconfiguration Integrated Nested A*: A Path Planner for Reconfigurable Robot to Improve Performance in Confined Spaces

Mohan Rajesh Elara, M. A. Viraj J. Muthugala, W. K. R. Sachinthana, S. M. Bhagya P. Samarakoon
Modular Robots and Swarm Intelligence
article

Dynamic Reconfiguration Integrated Nested A*: A Path Planner for Reconfigurable Robot to Improve Performance in Confined Spaces

Mohan Rajesh Elara, M. A. Viraj J. Muthugala, W. K. R. Sachinthana, S. M. Bhagya P. Samarakoon
article en

Abstract

Path planning is crucial in numerous robotic applications. Reconfigurable robots possess the capability to alter their shape, enabling access to confined spaces, a task challenging for fixed-shape robots. However, existing path planners for reconfigurable robots are typically designed with predefined motion patterns for reconfiguration, lacking adaptation to space availability and executing reconfiguration only when the robot is static. This reliance on predefined patterns limits the potential of reconfigurable robots to navigate through confined spaces. This paper proposes a novel path-planning approach based on dynamic reconfiguration to address this limitation. The proposed method employs two nested A* algorithms modified to handle reconfiguration and efficient search, termed Dynamic Reconfiguration integrated Nested A* (DRiNA*). Experimental results demonstrate the proposed method’s ability to find feasible paths for robot navigation using dynamic reconfigurations in confined spaces, surpassing the capabilities of existing path planners. The scalability of the proposed method to reconfigurable robots with varying numbers of blocks is also confirmed. Additionally, DRiNA* significantly reduces energy consumption compared to existing path planners.

Singapore University of Technology and Design (SG)
Affordable and clean energy
Openalex Percentile: Top 75%
Modular Robots and Swarm Intelligence
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.