Value of Incomplete Information in Mobile Target Allocation
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.
KeywordsMultiagent System Mobile Agent Communication Range Communication Graph Random Geometric Graph
Unable to display preview. Download preview PDF.
- 1.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)Google Scholar
- 3.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)Google Scholar
- 4.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)Google Scholar
- 7.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)Google Scholar
- 9.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)Google Scholar
- 10.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)Google Scholar
- 13.Michael, N., Zavlanos, M., Kumar, V., Pappas, G.: Maintaining connectivity in mobile robot networks. Experim. Robotics, 117–126 (2009)Google Scholar
- 17.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)Google Scholar
- 18.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)Google Scholar
- 20.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)Google Scholar