Abstract
In this paper, we consider a decentralized approach to the multi-agent target allocation problem where agents are partitioned in two groups and every member of each group is a possible target for the members of the opposite group. Each agent has a limited communication range (radius) and individual preferences for the target allocation based on its individual local utility function. Furthermore, all agents are mobile and the allocation is achieved through a proposed dynamic iterative auction algorithm. Every agent in each step finds its best target based on the auction algorithm and the exchange of information with connected agents and moves towards it without any insight in the decision-making processes of other agents in the system. In the case of connected communication graph among all agents, the algorithm results in an optimal allocation solution. We explore the deterioration of the allocation solution in respect to the decrease of the quantity of the information exchanged among agents and agents’ varying communication range when the latter is not sufficient to maintain connected communication graph.
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
Beard, R.W., McLain, T.W.: Multiple UAV cooperative search under collision avoidance and limited range communication constraints. In: Proc. of Conf. on Decision and Control, vol. 1, pp. 25–30. IEEE, Los Alamitos (2003)
Bertsekas, D.P.: Auction algorithms for network flow problems: A tutorial introduction. Comput. Opt. and Applications 1(1), 7–66 (1992)
Dias, M.B., Zlot, R., Kalra, N., Stentz, A.: Market-based multirobot coordination: A survey and analysis. Proc. of IEEE, Spec. iss. on multirob. coord. 94(7), 1257–1270 (2006)
Díaz, J., Mitsche, D., et al.: On the connectivity of dynamic random geometric graphs. In: Proc. of 19th ACM-SIAM Symposium on Discrete Algorithms, pp. 601–610 (2008)
Elango, M., Nachiappan, S., Tiwari, M.K.: Balancing task allocation in multi-robot systems using k means clustering and auction based mechanisms. Expert Systems With Applications 38(6), 6486–6491 (2010)
Gerkey, B.P., Matarić, M.J.: A formal analysis and taxonomy of task allocation in multi-robot systems. The Intern. Journ. of Rob. Research 23(9), 939–954 (2004)
Gerkey, B.P., Matarić, M.J.: Multi-robot task allocation: Analyzing the complexity and optimality of key architectures. In: Proc. of ICRA 2003, vol. 3, pp. 3862–3868 (2003)
Gerkey, B.P., Matarić, M.J.: Sold!: Auction methods for multi-robot control. Proc. IEEE Trans. on Robotics and Automat. 18(5), 758–768 (2002)
Gil, A.E., Passino, K.M., Ganapathy, S., Sparks, A.: Cooperative scheduling of tasks for networked uninhabited autonomous vehicles. In: Proc. of 42nd IEEE Conf. on Decision and Control, pp. 522–527 (2003)
Hoeing, M., Dasgupta, P., Petrov, P., O’Hara, S.: Auction-based multi-robot task allocation in comstar. In: Proc. of the 6th Inter. Joint Conf. on Auton. Agents and Multiagent Systems, pp. 1–8 (2007)
Lerman, K., Jones, C., Galstyan, A., Matarić, M.J.: Analysis of dynamic task allocation in multi-robot systems. The Intern. Journal of Robotics Research 25(3), 225–253 (2006)
Lujak, M., Giordani, S.: On the communication range in auction-based multi-agent target assignment. In: Bettstetter, C., Gershenson, C. (eds.) IWSOS 2011. LNCS, vol. 6557, pp. 32–43. Springer, Heidelberg (2011)
Michael, N., Zavlanos, M., Kumar, V., Pappas, G.: Maintaining connectivity in mobile robot networks. Experim. Robotics, 117–126 (2009)
Nanjanath, M., Gini, M.: Repeated auctions for robust task execution by a robot team. Robotics and Autonomous Sys. 58(7), 900–909 (2010)
Penrose, M.: Random geometric graphs. Oxford Univ. Press, USA (2003)
Santi, P.: The critical transmitting range for connectivity in mobile ad hoc networks. IEEE Trans. on Mob. Comp. 4(3), 310–317 (2005)
Santi, P., Blough, D.M.: An evaluation of connectivity in mobile wireless ad hoc networks. In: Proc. of Int. Conf. on Depend. Sys. and Netw., pp. 89–98 (2002)
Santi, P., Blough, D.M., Vainstein, F.: A probabilistic analysis for the range assignment problem in ad-hoc networks. In: Proc. of ACM Mobihoc, pp. 212–220 (2001)
Savkin, A.V.: The problem of coordination and consensus achievement in groups of autonomous mobile robots with limited communication. Nonlinear Analysis 65(5), 1094–1102 (2006)
Zavlanos, M.M., Spesivtsev, L., Pappas, G.J.: A distributed auction algorithm for the assignment problem. In: Proc. of 47th IEEE Conf. on Dec. and Contr., pp. 1212–1217 (2008)
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
Lujak, M., Giordani, S., Ossowski, S. (2011). Value of Incomplete Information in Mobile Target Allocation. In: Klügl, F., Ossowski, S. (eds) Multiagent System Technologies. MATES 2011. Lecture Notes in Computer Science(), vol 6973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24603-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-24603-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24602-9
Online ISBN: 978-3-642-24603-6
eBook Packages: Computer ScienceComputer Science (R0)