Reconfiguring Non-Convex Holes in Pivoting Modular Cube Robots

Loading...
Thumbnail Image
Penn collection
Lab Papers (GRASP)
Degree type
Discipline
Subject
GRASP
CPS Theory
Cellular and Modular Robots
Motion and Path Planning
Computational Geometry
Artificial Intelligence and Robotics
Computer Sciences
Engineering
Mechanical Engineering
Robotics
Theory and Algorithms
Funder
Grant number
License
Copyright date
Distributor
Contributor
Abstract

We present an algorithm for self-reconfiguration of admissible 3D configurations of pivoting modular cube robots with holes of arbitrary shape and number. Cube modules move across the surface of configurations by pivoting about shared edges, enabling configurations to reshape themselves. Previous work provides a reconfiguration algorithm for admissible 3D configurations containing no non-convex holes; we improve upon this by handling arbitrary admissible 3D configurations. The key insight specifies a point in the deconstruction of layers enclosing non-convex holes at which we can pause and move inner modules out of the hole. We prove this happens early enough to maintain connectivity, but late enough to open enough room in the enclosing layer for modules to escape the hole. Our algorithm gives reconfiguration plans with O(n^2) moves for n modules.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2021-07-07
Journal title
IEEE Robotics and Automation Letters
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Recommended citation
@ARTICLE{9477019, author={Feshbach, Daniel A. and Sung, Cynthia}, journal={IEEE Robotics and Automation Letters}, title={Reconfiguring Non-Convex Holes in Pivoting Modular Cube Robots}, year={2021}, volume={}, number={}, pages={1-1}, doi={10.1109/LRA.2021.3095030}}
Collection