Auction-Based Strategies for the Open-System Patrolling Task

  • Cyril Poulet
  • Vincent Corruble
  • Amal El Fallah Seghrouchni
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7455)


The Multi-Agent Patrolling task constitutes a challenging issue for the MAS field and has the potential to cover a variety of domains ranging from agent-based simulations to distributed system design.

Several techniques have been proposed in the last few years to address the basic multi-agent patrolling task. Recently, a variation of this task was proposed, in which agents can enter or leave the task at will: the patrolling task with an open system setting. A few centralized strategies were also described to address this new problem.

In this article, we propose to adapt to a dynamic population a completely decentralized strategy that was proposed for the original basic patrolling task: an auction-based strategy in which agents trade the nodes they have to visit. We describe and compare several entry and exit algorithms on various graph topologies and show the interest of basing these mechanisms on geographical proximity. Finally, we compare this strategy to the centralized ones on simulations with multiple variations in the population of agents, and show that it provides a strong stability and reactivity to changes in the population of agents.


Asynchronous Communication Proximity Mechanism Random Mechanism Entry Mechanism Initiator Agent 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Almeida, A., Castro, P., Menezes, T., Ramalho, G.: Combining idleness and distance to design heuristic agents for the patrolling task. In: II Brazilian Workshop in Games and Digital Entertainment, pp. 33–40 (2003)Google Scholar
  2. 2.
    Chevaleyre, Y.: Theoretical analysis of the multi-agent patrolling problem. In: Proceedings of the Intelligent Agent Technology, IEEE/WIC/ACM International Conference, pp. 302–308 (2004)Google Scholar
  3. 3.
    Chu, H., Glad, A., Simonin, O., Sempe, F., Drogoul, A., Charpillet, F.: Swarm approaches for the patrolling problem, information propagation vs. pheromone evaporation. In: ICTAI 2007 IEEE International Conference on Tools with Artificial Intelligence, vol. 7, pp. 442–449 (2007)Google Scholar
  4. 4.
    Machado, A., Ramalho, G., Zucker, J., Drogoul, A.: Multi-agent Patrolling: An Empirical Analysis of Alternative Architectures. In: Sichman, J.S., Bousquet, F., Davidsson, P. (eds.) MABS 2002. LNCS (LNAI), vol. 2581, pp. 155–170. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Menezes, T., Tedesco, P., Ramalho, G.: Negotiator Agents for the Patrolling Task. In: Sichman, J.S., Coelho, H., Rezende, S.O. (eds.) IBERAMIA 2006 and SBIA 2006. LNCS (LNAI), vol. 4140, pp. 48–57. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  6. 6.
    Moreira, D., Ramalho, G., Tedesco, P.: Simpatrol - towards the establishment of multi-agent patrolling as a benchmark for multi-agent systems. In: ICAART, pp. 570–575 (2009)Google Scholar
  7. 7.
    Poulet, C., Corruble, V., El Fallah Seghrouchni, A., Ramalho, G.: The open system setting in timed multiagent patrolling. In: WI-IAT 2011, Proc. of Web Intelligence - Intelligent Agent Technologies 2011 (2011)Google Scholar
  8. 8.
    Sampaio, G., Ramalho, G., Tedesco, P.: A technique inspired by the law of gravitation for the timed multi-agent patrolling. In: 22nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), vol. 1, pp. 113–120 (2010)Google Scholar
  9. 9.
    Santana, H., Ramalho, G., Corruble, V., Ratitch, B.: Multi-agent patrolling with reinforcement learning. In: AAMAS 2004 - Proceedings of the Third International Joint Conference on Autonomous Agents and Multi Agent Systems (2004)Google Scholar
  10. 10.
    Sempé, F.: Auto-organisation d’une collectivité de robots: application à l’activité de patrouille en présence de perturbations. PhD thesis, Université Paris VI (2004)Google Scholar
  11. 11.
    Wagner, I., Lindenbaum, M., Bruckstein, A.: Distributed covering by ant-robots using evaporating traces. IEEE Transactions on Robotics and Automation 15(5), 918–933 (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Cyril Poulet
    • 1
  • Vincent Corruble
    • 1
  • Amal El Fallah Seghrouchni
    • 1
  1. 1.LIP6, UPMCParisFrance

Personalised recommendations