A block partitioning algorithm for modular robot reconfiguration under uncertainty

Ayan Dutra, Prithviraj Dasgupta, Jose Baca, Carl A Nelson

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

3 Citations (Scopus)

Abstract

We consider the problem of reconfiguring a modular self-reconfigurable robots (MSRs) in the presence of uncertainty due to operational limitations of the robot and dynamic nature of the environment. We employ a coalition game theory-based technique to address this problem by representing a configuration of the modules as a coalition structure and finding the 'best' configuration by searching for the optimal coalition structure. The key contribution of this paper is to speed up the search by making the observation that the maximum size a group or coalition of modules can have is limited to a maximum value, n max, which is determined by the operational and mobility constraints of the modules. We then propose an anytime algorithm called BlockPartitioning that uses integer partitioning along with an intelligent pruning technique to reject coalitions that are infeasible either due to their excessive size or due to excessive cost of coming together under current operational conditions. We have provided analytical results for our algorithm and also simulated it with different number of modules and different values of the maximum coalition size of an MSR called ModRED, and, shown that our algorithm takes nominal time to find the optimal solution (less than 1 sec. for up to 12 modules).

Original languageEnglish (US)
Title of host publication2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings
PublisherIEEE Computer Society
Pages255-260
Number of pages6
ISBN (Print)9781479902637
DOIs
StatePublished - Jan 1 2013
Event2013 6th European Conference on Mobile Robots, ECMR 2013 - Barcelona, Spain
Duration: Sep 25 2013Sep 27 2013

Publication series

Name2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings

Conference

Conference2013 6th European Conference on Mobile Robots, ECMR 2013
CountrySpain
CityBarcelona
Period9/25/139/27/13

Fingerprint

Modular robots
Robots
Game theory
Uncertainty
Costs

ASJC Scopus subject areas

  • Artificial Intelligence
  • Human-Computer Interaction

Cite this

Dutra, A., Dasgupta, P., Baca, J., & Nelson, C. A. (2013). A block partitioning algorithm for modular robot reconfiguration under uncertainty. In 2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings (pp. 255-260). [6698851] (2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings). IEEE Computer Society. https://doi.org/10.1109/ECMR.2013.6698851

A block partitioning algorithm for modular robot reconfiguration under uncertainty. / Dutra, Ayan; Dasgupta, Prithviraj; Baca, Jose; Nelson, Carl A.

2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings. IEEE Computer Society, 2013. p. 255-260 6698851 (2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings).

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

Dutra, A, Dasgupta, P, Baca, J & Nelson, CA 2013, A block partitioning algorithm for modular robot reconfiguration under uncertainty. in 2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings., 6698851, 2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings, IEEE Computer Society, pp. 255-260, 2013 6th European Conference on Mobile Robots, ECMR 2013, Barcelona, Spain, 9/25/13. https://doi.org/10.1109/ECMR.2013.6698851
Dutra A, Dasgupta P, Baca J, Nelson CA. A block partitioning algorithm for modular robot reconfiguration under uncertainty. In 2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings. IEEE Computer Society. 2013. p. 255-260. 6698851. (2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings). https://doi.org/10.1109/ECMR.2013.6698851
Dutra, Ayan ; Dasgupta, Prithviraj ; Baca, Jose ; Nelson, Carl A. / A block partitioning algorithm for modular robot reconfiguration under uncertainty. 2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings. IEEE Computer Society, 2013. pp. 255-260 (2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings).
@inproceedings{edc68eab93c847a19069d470520d324a,
title = "A block partitioning algorithm for modular robot reconfiguration under uncertainty",
abstract = "We consider the problem of reconfiguring a modular self-reconfigurable robots (MSRs) in the presence of uncertainty due to operational limitations of the robot and dynamic nature of the environment. We employ a coalition game theory-based technique to address this problem by representing a configuration of the modules as a coalition structure and finding the 'best' configuration by searching for the optimal coalition structure. The key contribution of this paper is to speed up the search by making the observation that the maximum size a group or coalition of modules can have is limited to a maximum value, n max, which is determined by the operational and mobility constraints of the modules. We then propose an anytime algorithm called BlockPartitioning that uses integer partitioning along with an intelligent pruning technique to reject coalitions that are infeasible either due to their excessive size or due to excessive cost of coming together under current operational conditions. We have provided analytical results for our algorithm and also simulated it with different number of modules and different values of the maximum coalition size of an MSR called ModRED, and, shown that our algorithm takes nominal time to find the optimal solution (less than 1 sec. for up to 12 modules).",
author = "Ayan Dutra and Prithviraj Dasgupta and Jose Baca and Nelson, {Carl A}",
year = "2013",
month = "1",
day = "1",
doi = "10.1109/ECMR.2013.6698851",
language = "English (US)",
isbn = "9781479902637",
series = "2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings",
publisher = "IEEE Computer Society",
pages = "255--260",
booktitle = "2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings",

}

TY - GEN

T1 - A block partitioning algorithm for modular robot reconfiguration under uncertainty

AU - Dutra, Ayan

AU - Dasgupta, Prithviraj

AU - Baca, Jose

AU - Nelson, Carl A

PY - 2013/1/1

Y1 - 2013/1/1

N2 - We consider the problem of reconfiguring a modular self-reconfigurable robots (MSRs) in the presence of uncertainty due to operational limitations of the robot and dynamic nature of the environment. We employ a coalition game theory-based technique to address this problem by representing a configuration of the modules as a coalition structure and finding the 'best' configuration by searching for the optimal coalition structure. The key contribution of this paper is to speed up the search by making the observation that the maximum size a group or coalition of modules can have is limited to a maximum value, n max, which is determined by the operational and mobility constraints of the modules. We then propose an anytime algorithm called BlockPartitioning that uses integer partitioning along with an intelligent pruning technique to reject coalitions that are infeasible either due to their excessive size or due to excessive cost of coming together under current operational conditions. We have provided analytical results for our algorithm and also simulated it with different number of modules and different values of the maximum coalition size of an MSR called ModRED, and, shown that our algorithm takes nominal time to find the optimal solution (less than 1 sec. for up to 12 modules).

AB - We consider the problem of reconfiguring a modular self-reconfigurable robots (MSRs) in the presence of uncertainty due to operational limitations of the robot and dynamic nature of the environment. We employ a coalition game theory-based technique to address this problem by representing a configuration of the modules as a coalition structure and finding the 'best' configuration by searching for the optimal coalition structure. The key contribution of this paper is to speed up the search by making the observation that the maximum size a group or coalition of modules can have is limited to a maximum value, n max, which is determined by the operational and mobility constraints of the modules. We then propose an anytime algorithm called BlockPartitioning that uses integer partitioning along with an intelligent pruning technique to reject coalitions that are infeasible either due to their excessive size or due to excessive cost of coming together under current operational conditions. We have provided analytical results for our algorithm and also simulated it with different number of modules and different values of the maximum coalition size of an MSR called ModRED, and, shown that our algorithm takes nominal time to find the optimal solution (less than 1 sec. for up to 12 modules).

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

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

U2 - 10.1109/ECMR.2013.6698851

DO - 10.1109/ECMR.2013.6698851

M3 - Conference contribution

SN - 9781479902637

T3 - 2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings

SP - 255

EP - 260

BT - 2013 European Conference on Mobile Robots, ECMR 2013 - Conference Proceedings

PB - IEEE Computer Society

ER -