On the Communication Range in Auction-Based Multi-Agent Target Assignment

  • Marin Lujak
  • Stefano Giordani
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6557)

Abstract

In this paper, we consider a decentralized approach to the multi-agent target assignment problem and explore the deterioration of the quality of assignment solution in respect to the decrease of the quantity of the information exchanged among communicating agents and their communication range when the latter is not sufficient to maintain the connected communication graph. The assignment is achieved through a dynamic iterative auction algorithm in which agents (robots) assign the targets and move towards them in each period. In the case of static targets and connected communication graph, the algorithm results in an optimal assignment solution. The assignment results are compared with two benchmark cases: a centralized one in which all the global information is known and therefore, the optimal assignment can be found, and the greedy one in which each agent moves towards the target with the highest benefit without communication with any other agent.

Keywords

Multi-agent auction algorithm target assignment random geometric graph network optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bertsekas, D.P.: Auction algorithms for network flow problems: A tutorial introduction. Comput. Opt. and Applications 1(1), 7–66 (1992)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Díaz, J., Mitsche, D., Pérez-Giménez, X.: On the connectivity of dynamic random geometric graphs. In: Proc. of 19th ACM-SIAM Symposium on Discrete Algorithms, pp. 601–610 (2008)Google Scholar
  3. 3.
    Finke, J., Passino, K.M., Sparks, A.: Cooperative control via task load balancing for networked uninhabited autonomous vehicles. In: Proc. of 42nd IEEE Conference on Decision and Control, vol. 1, pp. 31–36 (2003)Google Scholar
  4. 4.
    Gil, A.E., Passino, K.M., Ganapathy, S., Sparks, A.: Cooperative scheduling of tasks for networked uninhabited autonomous vehicles. In: Proc. of 42nd IEEE Conference on Decision and Control, pp. 522–527 (2003)Google Scholar
  5. 5.
    Giordani, S., Lujak, M., Martinelli, F.: A Distributed Algorithm for the Multi-Robot Task Allocation Problem. In: García-Pedrajas, N., Herrera, F., Fyfe, C., Benítez, J.M., Ali, M. (eds.) IEA/AIE 2010. LNCS, vol. 6096, pp. 721–730. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  6. 6.
    Keshavarz, H.A., Ribeiro, V., Riedi, R.: Broadcast capacity in multihop wireless networks. In: Proc. of 12th Int. Conf. on Mob. Comp. & Netw., pp. 239–250 (2006)Google Scholar
  7. 7.
    Korkmaz, G., Ekici, E., Özgüner, F., Özgüner, Ü.: Urban multi-hop broadcast protocol for inter-vehicle communication systems. In: Proc. of 1st ACM Int. Workshop on Vehicular Ad-hoc Networks, pp. 76–85 (2004)Google Scholar
  8. 8.
    Moore, B.J., Passino, K.M.: Coping with information delays in the assignment of mobile agents to stationary tasks. In: IEEE Conference on Decision and Control, Institute of Electrical and Electronics Engineers, UK, pp. 3339–3344 (2004)Google Scholar
  9. 9.
    Moore, B.J., Passino, K.M.: Distributed task assignment for mobile agents. IEEE Transactions on Automatic Control 52(4), 749–753 (2007)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Murphy, A.L., Picco, G.P.: Reliable communication for highly mobile agents. Aut. Agents and Multi-Ag. Sys. 5(1), 81–100 (2002)CrossRefGoogle Scholar
  11. 11.
    Penrose, M.: Random geometric graphs. Oxford University Press, USA (2003)CrossRefMATHGoogle Scholar
  12. 12.
    Ren, W., Beard, R.W., McLain, T.W.: Coordination Variables and Consensus Building in Multiple Vehicle Systems. In: Coop. Control: a Post-Workshop: Block Island Workshop on Coop. Control, pp. 171–188 (2004)Google Scholar
  13. 13.
    Santi, P.: The critical transmitting range for connectivity in mobile ad hoc networks. IEEE Trans. on Mob. Comp. 4(3), 310–317 (2005)MathSciNetCrossRefGoogle Scholar
  14. 14.
    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
  15. 15.
    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
  16. 16.
    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)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Smith, S., Bullo, F.: A Geometric Assignment Problem for Robotic Networks. In: Modeling, Estimation and Control, pp. 271–284. Springer, Heidelberg (2008)Google Scholar
  18. 18.
    Zavlanos, M.M., Pappas, G.J.: Dynamic assignment in distributed motion planning with local coordin. IEEE Trans. on Rob. 24(1), 232–242 (2008)CrossRefGoogle Scholar
  19. 19.
    Zavlanos, M.M., Pappas, G.J.: Sensor-based dynamic assignment in distributed motion planning. In: IEEE Int. Conf. on Rob. and Autom., pp. 3333–3338 (2007)Google Scholar
  20. 20.
    Zavlanos, M.M., Spesivtsev, L., Pappas, G.J.: A distributed auction algorithm for the assignment problem. In: Proc. of 47th IEEE Conf. on Decision and Control, pp. 1212–1217 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Marin Lujak
    • 1
  • Stefano Giordani
    • 1
  1. 1.Dip. Ingegneria dell’ImpresaUniversity of Rome “Tor Vergata”Italy

Personalised recommendations