Abstract
Modular and self-reconfigurable robots are a powerful way to design versatile systems that can adapt themselves to different physical environment conditions. Self-reconfiguration is not an easy task since there are numerous possibilities of module organization. Moreover, some module organizations are equivalent one to another.
In this paper, we apply symbolic representation techniques from model checking to provide an optimized representation of all configurations for a modular robot. The proposed approach captures symmetries of the system and avoids storing all the equivalences generated by permuting modules, for a given configuration. From this representation, we can generate a compact symbolic configuration space and use it to efficiently compute the moves required for self-reconfiguration (i.e. going from one configuration to another). A prototype implementation is used to provide some benchmarks showing promising results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arney, D., Fischmeister, S., Lee, I., Takashima, Y., Yim, M.: Model-based Programming of Modular Robots. In: 13th IEEE International Symposium on Object-Oriented Real-time Distributed Computing (ISORC 2010), pp. 87–91. IEEE Computer Society, Carmona (2010)
Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S.: Stochastic Well-Formed Coloured Nets for Symmetric Modelling Applications. IEEE Transactions on Computers 42(11), 1343–1360 (1993)
Christensen, D.J.: Evolution of shape-changing and self-repairing control for the ATRON self-reconfigurable robot. In: Proceedings 2006 IEEE International Conference on Robotics and Automation, ICRA 2006, pp. 2539–2545 (2006)
Clarke, E.M., Emerson, E.A., Jha, S., Sistla, A.P.: Symmetry Reductions in Model Checking. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol. 1427, pp. 147–158. Springer, Heidelberg (1998)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2003)
Girault, C., Valk, R. (eds.): Petri Nets and System Engineering, ch. 2, pp. 9–23. Springer, Heidelberg (2003)
GreatSPN. Petri nets suite, http://www.di.unito.it/~greatspn
Park, M.G.: Configuration recognition, Communication Fault Tolerance and Self-reassembly for the CKBot. PhD thesis, University of Pennsylvannia (2009)
Shen, W.-M.: Self-reconfigurable robots for adaptive and multifunctional tasks. Technical report, University of Florida, Florida, USA (December 2008)
The CKBot home page, http://modlabupenn.org/ckbot/
Valmari, A.: The State Explosion Problem. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 429–528. Springer, Heidelberg (1998)
Yim, M., White, P., Park, M., Sastra, J.: Modular Self-Reconfigurable Robots. In: Encyclopedia of Complexity and System Science. Springer, Heidelberg (2009)
Yim, M., Zhang, Y., Roufas, K., Duff, D., Eldershaw, C.: Connecting and disconnecting for chain self-reconfiguration with PolyBot. IEEE/ASME Transactions on mechatronics, special issue on Information Technology in Mechatronics (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baarir, S., Hillah, LM., Kordon, F., Renault, E. (2011). Self-reconfigurable Modular Robots and Their Symbolic Configuration Space. In: Calinescu, R., Jackson, E. (eds) Foundations of Computer Software. Modeling, Development, and Verification of Adaptive Systems. Monterey Workshop 2010. Lecture Notes in Computer Science, vol 6662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21292-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-21292-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21291-8
Online ISBN: 978-3-642-21292-5
eBook Packages: Computer ScienceComputer Science (R0)