A fast coalition structure search algorithm for modular robot reconfiguration planning under uncertainty

Ayan Dutta, Prithviraj Dasgupta, Jose Baca, Carl Nelson

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

Abstract

We consider the problem of reconfiguration planning in modular robots. Current techniques for reconfiguration planning usually specify the destination configuration for a modular robot explicitly.We posit that in uncertain environments the desirable configuration for a modular robot is not known beforehand and has to be determined dynamically. In this paper, we consider this problem of how to identify a new’best’ configuration when a modular robot is unable to continue operating efficiently in its current configuration.We build on a technique that enumerates all the possible partitions of a set of modules requiring reconfiguring as a coalition structure graph (CSG) and finds the’best’ node in that graph. We propose a new data structure called an uncertain CSG (UCSG) that augments the CSG to handle uncertainty originating from the motion and performance of the robot. We then propose a new search algorithm called searchUCSG that intelligently prunes nodes from the UCSG using a modified branch and bound technique. Experimental results show that our algorithm is able to find a node that is within a worst bound of 80% of the optimal or best node in the UCSG while exploring only half the nodes in the UCSG. The time taken by our algorithm in terms of the number of nodes explored is also consistently lower than existing algorithms (that do not model uncertainty) for searching a CSG.

Original languageEnglish (US)
Title of host publicationDistributed Autonomous Robotic Systems - The 11th International Symposium
EditorsGregory Chirikjian, M. Ani Hsieh
PublisherSpringer Verlag
Pages177-191
Number of pages15
ISBN (Electronic)9783642551451
DOIs
StatePublished - Jan 1 2014
Event11th International Symposium on Distributed Autonomous Robotic Systems, DARS 2012 - Baltimore, United States
Duration: Nov 8 2012Nov 11 2012

Publication series

NameSpringer Tracts in Advanced Robotics
Volume104
ISSN (Print)1610-7438
ISSN (Electronic)1610-742X

Conference

Conference11th International Symposium on Distributed Autonomous Robotic Systems, DARS 2012
CountryUnited States
CityBaltimore
Period11/8/1211/11/12

Fingerprint

Modular robots
Planning
Data structures
Robots
Uncertainty

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Artificial Intelligence

Cite this

Dutta, A., Dasgupta, P., Baca, J., & Nelson, C. (2014). A fast coalition structure search algorithm for modular robot reconfiguration planning under uncertainty. In G. Chirikjian, & M. Ani Hsieh (Eds.), Distributed Autonomous Robotic Systems - The 11th International Symposium (pp. 177-191). (Springer Tracts in Advanced Robotics; Vol. 104). Springer Verlag. https://doi.org/10.1007/978-3-642-55146-8_13

A fast coalition structure search algorithm for modular robot reconfiguration planning under uncertainty. / Dutta, Ayan; Dasgupta, Prithviraj; Baca, Jose; Nelson, Carl.

Distributed Autonomous Robotic Systems - The 11th International Symposium. ed. / Gregory Chirikjian; M. Ani Hsieh. Springer Verlag, 2014. p. 177-191 (Springer Tracts in Advanced Robotics; Vol. 104).

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

Dutta, A, Dasgupta, P, Baca, J & Nelson, C 2014, A fast coalition structure search algorithm for modular robot reconfiguration planning under uncertainty. in G Chirikjian & M Ani Hsieh (eds), Distributed Autonomous Robotic Systems - The 11th International Symposium. Springer Tracts in Advanced Robotics, vol. 104, Springer Verlag, pp. 177-191, 11th International Symposium on Distributed Autonomous Robotic Systems, DARS 2012, Baltimore, United States, 11/8/12. https://doi.org/10.1007/978-3-642-55146-8_13
Dutta A, Dasgupta P, Baca J, Nelson C. A fast coalition structure search algorithm for modular robot reconfiguration planning under uncertainty. In Chirikjian G, Ani Hsieh M, editors, Distributed Autonomous Robotic Systems - The 11th International Symposium. Springer Verlag. 2014. p. 177-191. (Springer Tracts in Advanced Robotics). https://doi.org/10.1007/978-3-642-55146-8_13
Dutta, Ayan ; Dasgupta, Prithviraj ; Baca, Jose ; Nelson, Carl. / A fast coalition structure search algorithm for modular robot reconfiguration planning under uncertainty. Distributed Autonomous Robotic Systems - The 11th International Symposium. editor / Gregory Chirikjian ; M. Ani Hsieh. Springer Verlag, 2014. pp. 177-191 (Springer Tracts in Advanced Robotics).
@inproceedings{d091f0439c634cc9bcb4fe2d67a4aa47,
title = "A fast coalition structure search algorithm for modular robot reconfiguration planning under uncertainty",
abstract = "We consider the problem of reconfiguration planning in modular robots. Current techniques for reconfiguration planning usually specify the destination configuration for a modular robot explicitly.We posit that in uncertain environments the desirable configuration for a modular robot is not known beforehand and has to be determined dynamically. In this paper, we consider this problem of how to identify a new’best’ configuration when a modular robot is unable to continue operating efficiently in its current configuration.We build on a technique that enumerates all the possible partitions of a set of modules requiring reconfiguring as a coalition structure graph (CSG) and finds the’best’ node in that graph. We propose a new data structure called an uncertain CSG (UCSG) that augments the CSG to handle uncertainty originating from the motion and performance of the robot. We then propose a new search algorithm called searchUCSG that intelligently prunes nodes from the UCSG using a modified branch and bound technique. Experimental results show that our algorithm is able to find a node that is within a worst bound of 80{\%} of the optimal or best node in the UCSG while exploring only half the nodes in the UCSG. The time taken by our algorithm in terms of the number of nodes explored is also consistently lower than existing algorithms (that do not model uncertainty) for searching a CSG.",
author = "Ayan Dutta and Prithviraj Dasgupta and Jose Baca and Carl Nelson",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/978-3-642-55146-8_13",
language = "English (US)",
series = "Springer Tracts in Advanced Robotics",
publisher = "Springer Verlag",
pages = "177--191",
editor = "Gregory Chirikjian and {Ani Hsieh}, M.",
booktitle = "Distributed Autonomous Robotic Systems - The 11th International Symposium",

}

TY - GEN

T1 - A fast coalition structure search algorithm for modular robot reconfiguration planning under uncertainty

AU - Dutta, Ayan

AU - Dasgupta, Prithviraj

AU - Baca, Jose

AU - Nelson, Carl

PY - 2014/1/1

Y1 - 2014/1/1

N2 - We consider the problem of reconfiguration planning in modular robots. Current techniques for reconfiguration planning usually specify the destination configuration for a modular robot explicitly.We posit that in uncertain environments the desirable configuration for a modular robot is not known beforehand and has to be determined dynamically. In this paper, we consider this problem of how to identify a new’best’ configuration when a modular robot is unable to continue operating efficiently in its current configuration.We build on a technique that enumerates all the possible partitions of a set of modules requiring reconfiguring as a coalition structure graph (CSG) and finds the’best’ node in that graph. We propose a new data structure called an uncertain CSG (UCSG) that augments the CSG to handle uncertainty originating from the motion and performance of the robot. We then propose a new search algorithm called searchUCSG that intelligently prunes nodes from the UCSG using a modified branch and bound technique. Experimental results show that our algorithm is able to find a node that is within a worst bound of 80% of the optimal or best node in the UCSG while exploring only half the nodes in the UCSG. The time taken by our algorithm in terms of the number of nodes explored is also consistently lower than existing algorithms (that do not model uncertainty) for searching a CSG.

AB - We consider the problem of reconfiguration planning in modular robots. Current techniques for reconfiguration planning usually specify the destination configuration for a modular robot explicitly.We posit that in uncertain environments the desirable configuration for a modular robot is not known beforehand and has to be determined dynamically. In this paper, we consider this problem of how to identify a new’best’ configuration when a modular robot is unable to continue operating efficiently in its current configuration.We build on a technique that enumerates all the possible partitions of a set of modules requiring reconfiguring as a coalition structure graph (CSG) and finds the’best’ node in that graph. We propose a new data structure called an uncertain CSG (UCSG) that augments the CSG to handle uncertainty originating from the motion and performance of the robot. We then propose a new search algorithm called searchUCSG that intelligently prunes nodes from the UCSG using a modified branch and bound technique. Experimental results show that our algorithm is able to find a node that is within a worst bound of 80% of the optimal or best node in the UCSG while exploring only half the nodes in the UCSG. The time taken by our algorithm in terms of the number of nodes explored is also consistently lower than existing algorithms (that do not model uncertainty) for searching a CSG.

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

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

U2 - 10.1007/978-3-642-55146-8_13

DO - 10.1007/978-3-642-55146-8_13

M3 - Conference contribution

AN - SCOPUS:84927597013

T3 - Springer Tracts in Advanced Robotics

SP - 177

EP - 191

BT - Distributed Autonomous Robotic Systems - The 11th International Symposium

A2 - Chirikjian, Gregory

A2 - Ani Hsieh, M.

PB - Springer Verlag

ER -