Self-reconfiguration in modular robots using coalition games with uncertainty

Zachary Ramaekers, Prithviraj Dasgupta, Vladimir Ufimtsev, S. G.M. Hossain, Carl Nelson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

We consider the problem of dynamic self-reconfiguration in a modular self-reconfigurable robot (MSR). Previous MSR self-reconfiguration approaches search for new configurations only within the modules of the MSR that needs reconfiguration. In contrast, we describe a technique where an MSR that needs to reconfigure communicates with other MSRs in its vicinity to determine if modules can be shared from other MSRs, and then determines the best possible configuration among the combined set of modules. We model the MSR self-reconfiguration problem as a coalition structure generation problem within a coalition game theoretic framework. We formulate the coalition structure generation problem as a planning problem in the presence of uncertainty and propose an MDP-based algorithm to solve it. We have implemented our algorithm within an MSR called ModRED that is simulated on the Webots simulation platform. Our results show that using our self-reconfiguration algorithm, when an MSR needs to reconfigure, a new configuration that is within 5-7% of the globally optimal configuration can be determined. We have also shown that our algorithm performs comparably with another existing algorithm for determining optimal coalition structure.

Original languageEnglish (US)
Title of host publicationAutomated Action Planning for Autonomous Mobile Robots - Papers from the 2011 AAAI Workshop, Technical Report
Pages57-63
Number of pages7
StatePublished - Nov 2 2011
Event2011 AAAI Workshop - San Francisco, CA, United States
Duration: Aug 7 2011Aug 7 2011

Publication series

NameAAAI Workshop - Technical Report
VolumeWS-11-09

Conference

Conference2011 AAAI Workshop
CountryUnited States
CitySan Francisco, CA
Period8/7/118/7/11

Fingerprint

Modular robots
Robots
Uncertainty
Planning

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Ramaekers, Z., Dasgupta, P., Ufimtsev, V., Hossain, S. G. M., & Nelson, C. (2011). Self-reconfiguration in modular robots using coalition games with uncertainty. In Automated Action Planning for Autonomous Mobile Robots - Papers from the 2011 AAAI Workshop, Technical Report (pp. 57-63). (AAAI Workshop - Technical Report; Vol. WS-11-09).

Self-reconfiguration in modular robots using coalition games with uncertainty. / Ramaekers, Zachary; Dasgupta, Prithviraj; Ufimtsev, Vladimir; Hossain, S. G.M.; Nelson, Carl.

Automated Action Planning for Autonomous Mobile Robots - Papers from the 2011 AAAI Workshop, Technical Report. 2011. p. 57-63 (AAAI Workshop - Technical Report; Vol. WS-11-09).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ramaekers, Z, Dasgupta, P, Ufimtsev, V, Hossain, SGM & Nelson, C 2011, Self-reconfiguration in modular robots using coalition games with uncertainty. in Automated Action Planning for Autonomous Mobile Robots - Papers from the 2011 AAAI Workshop, Technical Report. AAAI Workshop - Technical Report, vol. WS-11-09, pp. 57-63, 2011 AAAI Workshop, San Francisco, CA, United States, 8/7/11.
Ramaekers Z, Dasgupta P, Ufimtsev V, Hossain SGM, Nelson C. Self-reconfiguration in modular robots using coalition games with uncertainty. In Automated Action Planning for Autonomous Mobile Robots - Papers from the 2011 AAAI Workshop, Technical Report. 2011. p. 57-63. (AAAI Workshop - Technical Report).
Ramaekers, Zachary ; Dasgupta, Prithviraj ; Ufimtsev, Vladimir ; Hossain, S. G.M. ; Nelson, Carl. / Self-reconfiguration in modular robots using coalition games with uncertainty. Automated Action Planning for Autonomous Mobile Robots - Papers from the 2011 AAAI Workshop, Technical Report. 2011. pp. 57-63 (AAAI Workshop - Technical Report).
@inproceedings{627054a7ad304878b7b75910c9e741b9,
title = "Self-reconfiguration in modular robots using coalition games with uncertainty",
abstract = "We consider the problem of dynamic self-reconfiguration in a modular self-reconfigurable robot (MSR). Previous MSR self-reconfiguration approaches search for new configurations only within the modules of the MSR that needs reconfiguration. In contrast, we describe a technique where an MSR that needs to reconfigure communicates with other MSRs in its vicinity to determine if modules can be shared from other MSRs, and then determines the best possible configuration among the combined set of modules. We model the MSR self-reconfiguration problem as a coalition structure generation problem within a coalition game theoretic framework. We formulate the coalition structure generation problem as a planning problem in the presence of uncertainty and propose an MDP-based algorithm to solve it. We have implemented our algorithm within an MSR called ModRED that is simulated on the Webots simulation platform. Our results show that using our self-reconfiguration algorithm, when an MSR needs to reconfigure, a new configuration that is within 5-7{\%} of the globally optimal configuration can be determined. We have also shown that our algorithm performs comparably with another existing algorithm for determining optimal coalition structure.",
author = "Zachary Ramaekers and Prithviraj Dasgupta and Vladimir Ufimtsev and Hossain, {S. G.M.} and Carl Nelson",
year = "2011",
month = "11",
day = "2",
language = "English (US)",
isbn = "9781577355250",
series = "AAAI Workshop - Technical Report",
pages = "57--63",
booktitle = "Automated Action Planning for Autonomous Mobile Robots - Papers from the 2011 AAAI Workshop, Technical Report",

}

TY - GEN

T1 - Self-reconfiguration in modular robots using coalition games with uncertainty

AU - Ramaekers, Zachary

AU - Dasgupta, Prithviraj

AU - Ufimtsev, Vladimir

AU - Hossain, S. G.M.

AU - Nelson, Carl

PY - 2011/11/2

Y1 - 2011/11/2

N2 - We consider the problem of dynamic self-reconfiguration in a modular self-reconfigurable robot (MSR). Previous MSR self-reconfiguration approaches search for new configurations only within the modules of the MSR that needs reconfiguration. In contrast, we describe a technique where an MSR that needs to reconfigure communicates with other MSRs in its vicinity to determine if modules can be shared from other MSRs, and then determines the best possible configuration among the combined set of modules. We model the MSR self-reconfiguration problem as a coalition structure generation problem within a coalition game theoretic framework. We formulate the coalition structure generation problem as a planning problem in the presence of uncertainty and propose an MDP-based algorithm to solve it. We have implemented our algorithm within an MSR called ModRED that is simulated on the Webots simulation platform. Our results show that using our self-reconfiguration algorithm, when an MSR needs to reconfigure, a new configuration that is within 5-7% of the globally optimal configuration can be determined. We have also shown that our algorithm performs comparably with another existing algorithm for determining optimal coalition structure.

AB - We consider the problem of dynamic self-reconfiguration in a modular self-reconfigurable robot (MSR). Previous MSR self-reconfiguration approaches search for new configurations only within the modules of the MSR that needs reconfiguration. In contrast, we describe a technique where an MSR that needs to reconfigure communicates with other MSRs in its vicinity to determine if modules can be shared from other MSRs, and then determines the best possible configuration among the combined set of modules. We model the MSR self-reconfiguration problem as a coalition structure generation problem within a coalition game theoretic framework. We formulate the coalition structure generation problem as a planning problem in the presence of uncertainty and propose an MDP-based algorithm to solve it. We have implemented our algorithm within an MSR called ModRED that is simulated on the Webots simulation platform. Our results show that using our self-reconfiguration algorithm, when an MSR needs to reconfigure, a new configuration that is within 5-7% of the globally optimal configuration can be determined. We have also shown that our algorithm performs comparably with another existing algorithm for determining optimal coalition structure.

UR - http://www.scopus.com/inward/record.url?scp=80055037372&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80055037372&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:80055037372

SN - 9781577355250

T3 - AAAI Workshop - Technical Report

SP - 57

EP - 63

BT - Automated Action Planning for Autonomous Mobile Robots - Papers from the 2011 AAAI Workshop, Technical Report

ER -