A bottom-up search algorithm for size-constrained partitioning of modules to generate configurations in modular robots

We consider the problem of partitioning a set of modules for efficient and dynamic shape or configuration generation in modular robotic systems, where the size of any configuration formed by the modules is constrained by a maximum, userprovided value denoted by nmax. The objective is to determine the best partition of the module set that gives the highest utility to the modules. This problem is non-trivial as the set of partitions that needs to be explored grows exponentially with the number of modules and an exhaustive search in the space of partitions makes the problem intractable. To address this problem, we propose a branch and bound based search algorithm, called bottomUpCSGSearch, which is able to intelligently prune the unpromising search space and find the best partition of the modules in a reasonable amount of time. We have provided analytical results related to the completeness, anytime nature and time complexity of our proposed algorithm. Our experimental results show that our proposed algorithm performs better in terms of number of nodes explored (up to 28 times fewer nodes explored) and the time required to find the best partition (improvement up to the order of 104 ms) than existing comparable algorithms. We have simulated with different number of modules and different values of maximum coalition size of a modular self-reconfigurable robot (MSR) called ModRED, and, shown that our algorithm takes nominal time to find the best solution.

[1]  P. Meier,et al.  Variance of a Weighted Mean , 1953 .

[2]  Nicholas R. Jennings,et al.  An improved dynamic programming algorithm for coalition structure generation , 2008, AAMAS.

[3]  Eiichi Yoshida,et al.  A Self-Reconfigurable Modular Robot: Reconfiguration Planning and Experiments , 2002 .

[4]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[5]  G. Chirikjian,et al.  Evaluating efficiency of self-reconfiguration in a class of modular robots , 1996 .

[6]  Onn Shehory,et al.  Coalition structure generation with worst case guarantees , 2022 .

[7]  Emil Grosswald,et al.  The Theory of Partitions , 1984 .

[8]  Carl A. Nelson,et al.  Modular robot locomotion based on a distributed fuzzy controller: The combination of modred's basic module motions , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[9]  Yoav Shoham,et al.  Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .

[10]  Roger B. Myerson,et al.  Game theory - Analysis of Conflict , 1991 .

[11]  Kasper Stoy,et al.  Self-Reconfigurable Robots: An Introduction , 2010 .

[12]  J. Kuijpers,et al.  Heterogeneous Teams of Modular Robots for Mapping and Exploration , 2008 .

[13]  Ronald M. Harstad,et al.  Computationally Manageable Combinational Auctions , 1998 .

[14]  Carl A. Nelson,et al.  ModRED: Hardware design and reconfiguration planning for a high dexterity modular self-reconfigurable robot for extra-terrestrial exploration , 2014, Robotics Auton. Syst..

[15]  Henrik Hautop Lund,et al.  Modular ATRON: modules for a self-reconfigurable robot , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[16]  Sarit Kraus,et al.  Methods for Task Allocation via Agent Coalition Formation , 1998, Artif. Intell..

[17]  H. Wilf.  generatingfunctionology: Third Edition , 1990 .

[18]  Shlomo Zilberstein,et al.  Using Anytime Algorithms in Intelligent Systems , 1996, AI Mag..

[19]  Gregory S. Chirikjian,et al.  Modular Self-Reconfigurable Robot Systems [Grand Challenges of Robotics] , 2007, IEEE Robotics & Automation Magazine.

[20]  Carl A. Nelson,et al.  Design of a Four-DOF Modular Self-Reconfigurable Robot With Novel Gaits , 2011 .

[21]  Sandip Sen,et al.  Searching for optimal coalition structures , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[22]  Carl A. Nelson,et al.  RoGenSiD: A Rotary Plate Genderless Single-Sided Docking Mechanism for Modular Self-Reconfigurable Robots , 2013 .

[23]  Ricardo Franco Mendoza Garcia,et al.  Mechanical design of odin, an extendable heterogeneous deformable modular robot , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[24]  Vladimir Ufimtsev,et al.  Dynamic reconfiguration in modular robots using graph partitioning-based coalitions , 2012, AAMAS.

[25]  Carl A. Nelson,et al.  searchUCSG: a fast coalition structure search algorithm for modular robot reconfiguration under uncertainty , 2014, Robotica.

[26]  Zack J. Butler,et al.  Million Module March: Scalable Locomotion for Large Self-Reconfiguring Robots , 2008, Int. J. Robotics Res..

[27]  Carl A. Nelson,et al.  A block partitioning algorithm for modular robot reconfiguration under uncertainty , 2013, 2013 European Conference on Mobile Robots.

[28]  Sarvapali D. Ramchurn,et al.  An Anytime Algorithm for Optimal Coalition Structure Generation , 2014, J. Artif. Intell. Res..

[29]  Satoshi Murata,et al.  Distributed Self-Reconfiguration of M-TRAN III Modular Robotic System , 2008, Int. J. Robotics Res..

[30]  Wei-Min Shen,et al.  Distributed, dynamic, and autonomous reconfiguration planning for chain-type self-reconfigurable robots , 2008, 2008 IEEE International Conference on Robotics and Automation.

[31]  Gregory S. Chirikjian,et al.  Design of a new independently-mobile reconfigurable modular robot , 2010, 2010 IEEE International Conference on Robotics and Automation.

[32]  Carl A. Nelson,et al.  Kinematics and interfacing of ModRED: A self-healing capable, 4DOF modular self-reconfigurable robot , 2014 .

[33]  Carl A. Nelson,et al.  A Bottom-Up Search Algorithm for Dynamic Reformation of Agent Coalitions under Coalition Size Constraints , 2013, 2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT).