Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2016
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1602.03104 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915380878901248 |
|---|---|
| author | Dutta, Ayan Dasgupta, Prithviraj Nelson, Carl |
| author_facet | Dutta, Ayan Dasgupta, Prithviraj Nelson, Carl |
| contents | We consider the problem of configuration formation in modular robot systems where a set of modules that are initially in different configurations and located at different locations are required to assume appropriate positions so that they can get into a new, user-specified, target configuration. We propose a novel algorithm based on graph isomorphism, where the modules select locations or spots in the target configuration using a utility-based framework, while retaining their original configuration to the greatest extent possible, to reduce the time and energy required by the modules to assume the target configuration. We have shown analytically that our proposed algorithm is complete and guarantees a Pareto-optimal allocation. Experimental simulations of our algorithm with different number of modules in different initial configurations and located initially at different locations, show that the planning time of our algorithm is nominal (order of msec. for 100 modules). We have also compared our algorithm against a market-based allocation algorithm and shown that our proposed algorithm performs better in terms of time and number of messages exchanged. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1602_03104 |
| institution | arXiv |
| publishDate | 2016 |
| record_format | arxiv |
| spellingShingle | A Graph Isomorphism-based Decentralized Algorithm for Modular Robot Configuration Formation Dutta, Ayan Dasgupta, Prithviraj Nelson, Carl Robotics Distributed, Parallel, and Cluster Computing Data Structures and Algorithms We consider the problem of configuration formation in modular robot systems where a set of modules that are initially in different configurations and located at different locations are required to assume appropriate positions so that they can get into a new, user-specified, target configuration. We propose a novel algorithm based on graph isomorphism, where the modules select locations or spots in the target configuration using a utility-based framework, while retaining their original configuration to the greatest extent possible, to reduce the time and energy required by the modules to assume the target configuration. We have shown analytically that our proposed algorithm is complete and guarantees a Pareto-optimal allocation. Experimental simulations of our algorithm with different number of modules in different initial configurations and located initially at different locations, show that the planning time of our algorithm is nominal (order of msec. for 100 modules). We have also compared our algorithm against a market-based allocation algorithm and shown that our proposed algorithm performs better in terms of time and number of messages exchanged. |
| title | A Graph Isomorphism-based Decentralized Algorithm for Modular Robot Configuration Formation |
| topic | Robotics Distributed, Parallel, and Cluster Computing Data Structures and Algorithms |
| url | https://arxiv.org/abs/1602.03104 |