Abstract
In the multi-robot area coverage problem, a group of mobile robots have to cover an initially unknown environment using a sensor or coverage tool attached to each robot. Multi-robot area coverage is encountered in many applications of multi-robot systems including unmanned search and rescue, aerial reconnaissance, robotic demining, automatic lawn mowing, and inspection of engineering structures. We envisage that multi-robot coverage can be performed efficiently if robots are coordinated to form small teams while covering the environment. In this paper, we use a technique from coalitional game theory called a weighted voting game that allows each robot to dynamically identify other team members and form teams so that the efficiency of the area coverage operation is improved. We propose and evaluate a novel technique of computing the weights of a weighted voting game based on each robot’s coverage capability and finding the best minimal winning coalition(BMWC). Also we designed a greedy method and a heuristic method to find BMWC in O(n log n) time and O(n 2) time respectively. We tested these two algorithm with our base line method.
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
Bachrach, Y., Elkind, E.: Divide and Conquer: False-Name Manipulations in Weighted Voting Games. In: Autonomous Agents and Multiagent Systems (AAMAS), pp. 975–982 (2008)
Bilbao, J.M., Fernandez, J.R., Jiminez, N., Lopez, J.J.: Voting power in the European Union enlargement. European Journal of Operational Research 143, 181–196 (2002)
Cheng, K., Dasgupta, P., Yi, W.: Distributed Area Coverage Using Robot Flocks. In: World Congress on Nature and Biologically Inspired Computing (NaBIC 2009), Coimbatore, India, pp. 678–683 (2009)
Dasgupta, P., Cheng, K., Fan, L.: Flocking-based Distributed Terrain Coverage with Mobile Mini-robots. In: IEEE Swarm Intelligence Symposium, pp. 96–103 (2009)
Cheng, K., Dasgupta, P.: Weighted Voting Game Based Multi-robot Team Formation for Distributed Area Coverage. In: AAMAS 2010 Workshop on Practical Cognitive Agents and Robots, Toronto, Canada (2010)
http://robotics.coroware.com/corobot (accessed by March 25, 2010)
Correll, N.: Coordination Schemes for Distributed Boundary Coverage with A Swarm of Miniature Robots: Synthesis, Analysis and Experimental Validation, Ph.D. Dissertation, Ecole Polytechic Federale Laurence (2007)
Deng, X., Papadimitriou, C.H.: On the complexity of cooperative solution concepts. Math. of Oper. Res. 19(2), 257–266 (1994)
Elkind, E., Goldberg, L.A., Goldberg, P.W., Wooldridge, M.: Comutational Complexity of Weighted Threshold Games. In: Proc. of AAAI 2007 (2007)
Hazon, N., Kaminka, G.: On Redundancy, Efficiency, and Robustness in Coverage for Multiple Robots. Robotics and Autonomous Systems 56(12), 1102–1114 (2008)
Koening, S., Szymanski, B., Liu, Y.: Efficient and Inefficient Ant Coverage Methods. Annals of Mathematics and Artificial Intelligence 31(1-4), 41–76 (2001)
Myerson, R.B.: Game Theory. Harvard University Press, Cambridge (1997)
Shoham, Y., Leyton-Brown, K.: Multiagent Systems: Algorithmic, Game Theoretic and Logical Foundations. Cambridge University Press, Cambridge (2009)
Svennebring, J., Koening, S.: Building Terrain Covering Ant Robots: A Feasibility Study. Autonomous Robots 16, 313–332 (2004)
Taylor, A., Zwicker, W.: Simple Game: Desirablility Relations, Trading, Pseudoweightings. Princeton Univerity Press, Princeton (1999)
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
Cheng, K., Dasgupta, P. (2011). Multi-agent Coalition Formation for Distributed Area Coverage. In: Guttmann, C., Dignum, F., Georgeff, M. (eds) Collaborative Agents - Research and Development. CARE CARE 2009 2010. Lecture Notes in Computer Science(), vol 6066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22427-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-22427-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22426-3
Online ISBN: 978-3-642-22427-0
eBook Packages: Computer ScienceComputer Science (R0)