Abstract
In this work, we focus on problems modeled as a set of activities to be scheduled and accomplished by mobile autonomous devices that communicate via a mobile ad hoc network. In such situations, the communication cost and computational efforts are key challenges. It is well known that keeping information about activities globally known by devices can provide better schedules. However, there are some contexts such as those where activities require startup based on location, whereby information restricted to neighborhood coalitions of devices can still produce satisfactory scheduling. The existing heuristics do not consider this approach. In this paper, we propose a multi-agent system that coordinates the dynamic formation of overlapping coalitions and the scheduling of activities within them. Heuristics for calculating the size of coalitions, as well as for scheduling activities, are proposed. The system is applied to solve the problem of area coverage in a simulated environment, whereby the results show that satisfactory schedules are obtained with lower cost of communication and computation in comparison with the solution based on globally known information.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Choset, H.: Coverage for robotics a survey of recent results. Annals of Mathematics and Artificial Intelligence 31, 113–126 (2001)
Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187(3) (2008)
Barbulescu, L., Rubinstein, Z.B., Smith, S.F., Zimmerman, T.L.: Distributed coordination of mobile agent teams: the advantage of planning ahead. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, AAMAS 2010, Richland, SC, pp. 1331–1338 (2010)
Lin, C.-F., Hu, S.-L.: Multi-task overlapping coalition parallel formation algorithm. In: Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2007, pp. 211-1–21. ACM, USA (2007)
Cheng, K., Dasgupta, P.: Coalition game-based distributed coverage of unknown environments by robot swarms. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, AAMAS 2008, Richland, SC, pp. 1191–1194 (2008)
Gonzalez, E., Gerlein, E.: Bsa-cm: A multi-robot coverage algorithm. In: Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, pp. 383–386. IEEE Computer Society Press, USA (2009)
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
dos Santos, V.A., Barroso, G.C., Aguilar, M.F., Serra, A.B., Soares, J.M. (2011). DynaMOC: A Multiagent System for Coordination of Mobile Teams Based on Dynamic Overlapping Coalitions. In: Brazier, F.M.T., Nieuwenhuis, K., Pavlin, G., Warnier, M., Badica, C. (eds) Intelligent Distributed Computing V. Studies in Computational Intelligence, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24013-3_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-24013-3_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24012-6
Online ISBN: 978-3-642-24013-3
eBook Packages: EngineeringEngineering (R0)