Dynamic reconfiguration in modular robots using graph partitioning-based coalitions

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

Research output: Contribution to conferencePaper

11 Citations (Scopus)

Abstract

We consider the problem of dynamic self-reconfiguration in a modular self-reconfigurable robot (MSR). Previous approaches to MSR self-reconfiguration solve this problem using algorithms that search for a goal configuration in the MSR's configuration space. In contrast, we model the self-reconfiguration problem as a constrained optimization problem that attempts to minimize the reconfiguration cost while achieving a desirable configuration. We formulate the MSR self-reconfiguration problem as finding the optimal coalition structure within a coalition game theoretic framework. To reduce the complexity of finding the optimal coalition structure, we represent the set of all robot modules as a fully-connected graph. Each robot module corresponds to a vertex of the graph and edge weights represent the utility of a pair of modules being in the same coalition (or, connected component). The value of a coalition structure is then defined as the sum of the weights of all edges that are completely within the same coalition in that coalition structure. We then use a graph partitioning technique to cluster the vertices (robot modules) in the constructed graph so that the obtained coalition structure has close to optimal value. The clustering algorithm has time complexity polynomial in the number of agents, n, and yields an O(log n) approximation. We have verified our technique experimentally for a variety of settings. Our results show that the graph clustering-based self-reconfiguration algorithm performs comparably with two other existing algorithms for determining optimal coalition structures.

Original languageEnglish (US)
Pages488-495
Number of pages8
StatePublished - Jan 1 2012
Event11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012 - Valencia, Spain
Duration: Jun 4 2012Jun 8 2012

Conference

Conference11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012
CountrySpain
CityValencia
Period6/4/126/8/12

Fingerprint

Modular robots
Robots
Constrained optimization
Clustering algorithms
Polynomials
Costs

Keywords

  • Coalition game
  • Dynamic reconfiguration
  • Graph-based clustering
  • Modular self-reconfigurable robots

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Dasgupta, P., Ufimtsev, V., Nelson, C., & Hossain, S. G. M. (2012). Dynamic reconfiguration in modular robots using graph partitioning-based coalitions. 488-495. Paper presented at 11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012, Valencia, Spain.

Dynamic reconfiguration in modular robots using graph partitioning-based coalitions. / Dasgupta, Prithviraj; Ufimtsev, Vladimir; Nelson, Carl; Hossain, S. G.M.

2012. 488-495 Paper presented at 11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012, Valencia, Spain.

Research output: Contribution to conferencePaper

Dasgupta, P, Ufimtsev, V, Nelson, C & Hossain, SGM 2012, 'Dynamic reconfiguration in modular robots using graph partitioning-based coalitions', Paper presented at 11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012, Valencia, Spain, 6/4/12 - 6/8/12 pp. 488-495.
Dasgupta P, Ufimtsev V, Nelson C, Hossain SGM. Dynamic reconfiguration in modular robots using graph partitioning-based coalitions. 2012. Paper presented at 11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012, Valencia, Spain.
Dasgupta, Prithviraj ; Ufimtsev, Vladimir ; Nelson, Carl ; Hossain, S. G.M. / Dynamic reconfiguration in modular robots using graph partitioning-based coalitions. Paper presented at 11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012, Valencia, Spain.8 p.
@conference{b46a54c7f4ac45878027fa2a9703af21,
title = "Dynamic reconfiguration in modular robots using graph partitioning-based coalitions",
abstract = "We consider the problem of dynamic self-reconfiguration in a modular self-reconfigurable robot (MSR). Previous approaches to MSR self-reconfiguration solve this problem using algorithms that search for a goal configuration in the MSR's configuration space. In contrast, we model the self-reconfiguration problem as a constrained optimization problem that attempts to minimize the reconfiguration cost while achieving a desirable configuration. We formulate the MSR self-reconfiguration problem as finding the optimal coalition structure within a coalition game theoretic framework. To reduce the complexity of finding the optimal coalition structure, we represent the set of all robot modules as a fully-connected graph. Each robot module corresponds to a vertex of the graph and edge weights represent the utility of a pair of modules being in the same coalition (or, connected component). The value of a coalition structure is then defined as the sum of the weights of all edges that are completely within the same coalition in that coalition structure. We then use a graph partitioning technique to cluster the vertices (robot modules) in the constructed graph so that the obtained coalition structure has close to optimal value. The clustering algorithm has time complexity polynomial in the number of agents, n, and yields an O(log n) approximation. We have verified our technique experimentally for a variety of settings. Our results show that the graph clustering-based self-reconfiguration algorithm performs comparably with two other existing algorithms for determining optimal coalition structures.",
keywords = "Coalition game, Dynamic reconfiguration, Graph-based clustering, Modular self-reconfigurable robots",
author = "Prithviraj Dasgupta and Vladimir Ufimtsev and Carl Nelson and Hossain, {S. G.M.}",
year = "2012",
month = "1",
day = "1",
language = "English (US)",
pages = "488--495",
note = "11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012 ; Conference date: 04-06-2012 Through 08-06-2012",

}

TY - CONF

T1 - Dynamic reconfiguration in modular robots using graph partitioning-based coalitions

AU - Dasgupta, Prithviraj

AU - Ufimtsev, Vladimir

AU - Nelson, Carl

AU - Hossain, S. G.M.

PY - 2012/1/1

Y1 - 2012/1/1

N2 - We consider the problem of dynamic self-reconfiguration in a modular self-reconfigurable robot (MSR). Previous approaches to MSR self-reconfiguration solve this problem using algorithms that search for a goal configuration in the MSR's configuration space. In contrast, we model the self-reconfiguration problem as a constrained optimization problem that attempts to minimize the reconfiguration cost while achieving a desirable configuration. We formulate the MSR self-reconfiguration problem as finding the optimal coalition structure within a coalition game theoretic framework. To reduce the complexity of finding the optimal coalition structure, we represent the set of all robot modules as a fully-connected graph. Each robot module corresponds to a vertex of the graph and edge weights represent the utility of a pair of modules being in the same coalition (or, connected component). The value of a coalition structure is then defined as the sum of the weights of all edges that are completely within the same coalition in that coalition structure. We then use a graph partitioning technique to cluster the vertices (robot modules) in the constructed graph so that the obtained coalition structure has close to optimal value. The clustering algorithm has time complexity polynomial in the number of agents, n, and yields an O(log n) approximation. We have verified our technique experimentally for a variety of settings. Our results show that the graph clustering-based self-reconfiguration algorithm performs comparably with two other existing algorithms for determining optimal coalition structures.

AB - We consider the problem of dynamic self-reconfiguration in a modular self-reconfigurable robot (MSR). Previous approaches to MSR self-reconfiguration solve this problem using algorithms that search for a goal configuration in the MSR's configuration space. In contrast, we model the self-reconfiguration problem as a constrained optimization problem that attempts to minimize the reconfiguration cost while achieving a desirable configuration. We formulate the MSR self-reconfiguration problem as finding the optimal coalition structure within a coalition game theoretic framework. To reduce the complexity of finding the optimal coalition structure, we represent the set of all robot modules as a fully-connected graph. Each robot module corresponds to a vertex of the graph and edge weights represent the utility of a pair of modules being in the same coalition (or, connected component). The value of a coalition structure is then defined as the sum of the weights of all edges that are completely within the same coalition in that coalition structure. We then use a graph partitioning technique to cluster the vertices (robot modules) in the constructed graph so that the obtained coalition structure has close to optimal value. The clustering algorithm has time complexity polynomial in the number of agents, n, and yields an O(log n) approximation. We have verified our technique experimentally for a variety of settings. Our results show that the graph clustering-based self-reconfiguration algorithm performs comparably with two other existing algorithms for determining optimal coalition structures.

KW - Coalition game

KW - Dynamic reconfiguration

KW - Graph-based clustering

KW - Modular self-reconfigurable robots

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

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

M3 - Paper

AN - SCOPUS:84899443975

SP - 488

EP - 495

ER -