We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Computer Science & Information Technology/Programming for modular reconfigurable robots
PeriodicalsComputer Science & Information Technology

Programming for modular reconfigurable robots

Checking your access to this record.

Abstract & Overview

Composed of multiple modular robotic units, self-reconfigurable modular robots are metamorphic systems that can autonomously rearrange the modules and form different configurations depending on dynamic environments and tasks. The goal of self-reconfiguration is to determine how to change connectivity of modules to transform the robot from the current configuration to the goal configuration subject to restrictions of physical implementation. The existing reconfiguration algorithms use different methods, such as divide-and-conquer, graph matching, and the like, to reduce the reconfiguration cost. However, an optimal solution with a minimal number of reconfiguration steps has not been found yet. The optimal reconfiguration planning problem consists in finding the least number of reconfiguration steps transforming the robot from one configuration to another. This is an NP-complete problem. In this paper, we describe an approach to solve this problem. The approach is based on constructing logical models of the problem under study.

Cite this record

Anna Gorbenko, Vladimir Popov (2012). Programming for modular reconfigurable robots. Programming and Computer Software, 38(1), 13–23. https://doi.org/10.1134/s0361768812010033

Copy in another style

Gorbenko, A., & Popov, V. (2012). Programming for modular reconfigurable robots. Programming and Computer Software, 38(1), 13–23. https://doi.org/10.1134/s0361768812010033
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.