Developing a deterministic patrolling strategy for security agents

Proceedings - 2009 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2009

Volumn 2, Issue , 2009, Pages 565-572

  Basilico, Nicola ^a   Gatti, Nicola ^a   Amigoni, Francesco ^a  

^a POLITECNICO DI MILANO   (Italy)

Author keywords

Constraint satisfaction problem; Robotic patrolling with adversaries; Traveling salesman problem

Indexed keywords

AUTONOMOUS SYSTEMS; CONSTRAINT SATISFACTION PROBLEMS; CYCLIC PATH; LARGE PARTS; SECURITY AGENTS; SECURITY APPLICATION; SOLVING ALGORITHM; TEMPORAL CONSTRAINTS; TRAVELING SALESMAN;

TRAVELING SALESMAN PROBLEM;

INTELLIGENT AGENTS;

EID: 78049260847     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WI-IAT.2009.212     Document Type: Conference Paper

References (20)

1. L. Martins-Filho and E. Macau, "Patrol mobile robots and chaotic trajectories," in Mathematical Problems in Engineering. Hindawi, 2007.
2. S. Ruan, C. Meirina, F. Yu, K. Pattipati, and R. Popp, "Patrolling in a stochastic environment," in Proceedings of the Symposium on Command and Control Research and Technology (CCRTS), Washington, USA, June 2005.
3. P. Paruchuri, M. Tambe, F. Ordonez, and S. Kraus, "Security in multiagent systems by policy randomization," in Proceedings of the International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Hakodate, Japan, May 8-12 2006, pp. 273-280.
4. N. Agmon, S. Kraus, and G. Kaminka, "Multi-robot perimeter patrol in adversarial settings," in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Pasadena, USA, May 19-23 2008, pp. 2339-2345.
5. P. Paruchuri, J. Pearce, J. Marecki, M. Tambe, F. Ordonez, and S. Kraus, "Playing games for security: An efficient exact algorithm for solving Bayesian Stackelberg games," in Proceedings of the International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Lisbon, Portugal, May 12-17 2008, pp. 895-902.
6. F. Amigoni, N. Basilico, and N. Gatti, "Finding the optimal strategies in robotic patrolling with adversaries in topologically-represented environments," in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Kobe, Japan, May 12-19 2009, pp. 819-824.
7. N. Basilico, N. Gatti, and F. Amigoni, "Leader-follower strategies for robotic patrolling in environments with arbitrary topologies," in Proceedings of the International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Budapest, Hungary, May 10-15 2009, pp. 57-64.
8. N. Basilico, N. Gatti, T. Rossi, S. Ceppi, and F. Amigoni, "Developing a deterministic patrolling strategy for security agents," in Proceedings of the ACM/WIC/IEEE International Conference on Intelligent Agent Technology (IAT), Milan, Italy, September 15-18 2009.
9. F. Amigoni, N. Gatti, and A. Ippedico, "A game-theoretic approach to determining efficient patrolling strategies for mobile robots," in Proceedings of the ACM/WIC/IEEE Conference on Intelligent Agent Technology (IAT), Sidney, Australia, December 9-12 2008, pp. 500-503.
10. N. Gatti, "Game theoretical insights in strategic patrolling: Model and algorithm in normal-form," in Proceedings of the European Conference on Artificial Intelligence (ECAI), Patras, Greece, July 21-25 2008, pp. 403-407.
11. N. Agmon, S. Kraus, and G. Kaminka, "A realistic model of frequencybased multi-robot polyline patrolling," in Proceedings of the International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Lisbon, Portugal, May 12-17 2008, pp. 63-70.
12. V. Isler, S. Kannan, and S. Khanna, "Randomized pursuit-evasion in a polygonal environment," IEEE Transactions on Robotics, vol. 5, no. 21, pp. 864-875, 2005.
13. R. Vidal, O. Shakernia, J. Kim, D. Shim, and S. Sastry, "Probabilistic pursuit-evasion games: Theory, implementation and experimental results," IEEE Transactions on Robotics and Automation, vol. 18, no. 5, pp. 662-669, 2002.
14. J. Tsitsiklis, "Special cases of traveling salesman and repairman problems with time windows," Networks, vol. 22, no. 3, pp. 263-282, 1992.
15. A. Kolen, A. R. Kan, and H. Trienekens, "Vehicle routing with time windows," Operations Research, vol. 35, no. 2, pp. 266-273, 1987.
16. N. Christofides and J. Beasley, "The period routing problem," Networks, vol. 14, no. 2, pp. 237-256, 1984.
17. P. Francis, K. Smilowitz, and M. Tzur, "The period vehicle routing problem with service choice," Transportation Science, vol. 40, no. 4, pp. 439-454, 2006.
18. B. Raa and E. H. Aghezzaf, "A practical solution approach for the cyclic inventory routing problem," European Journal of Operational Research, vol. 192, no. 2, pp. 429-441, 2009.
19. S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach (Second Edition). Prentice Hall, 2003.
20. D. Draper, A. Jónsson, D. Clements, and D. Joslin, "Cyclic scheduling," in Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), Stockholm, Sweden, July 31 - August 6 1999, pp. 1016-1021.