Abstract
Multi-agent patrolling problem has received growing attention from many researchers due to its wide range of potential applications. In realistic environment, e.g., security patrolling, each location has different visitation requirement according to the required security level. Therefore, a patrolling system with non-uniform visiting frequency is preferable. The difference in visiting frequency generally causes imbalanced workload amongst agents leading to inefficiency. This paper, thus, aims at partitioning a given area to balance agents’ workload by considering that different visiting frequency and then generating route inside each sub-area. We formulate the problem of frequency-based multi-agent patrolling and propose its semi-optimal solution method, whose overall process consists of two steps – graph partitioning and sub-graph patrolling. Our work improve traditional k-means clustering algorithm by formulating a new objective function and combine it with simulated annealing – a useful tool for operations research. Experimental results illustrated the effectiveness and reasonable computational efficiency of our approach.
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
References
Almeida, A., Ramalho, G., Santana, H., Tedesco, P., Menezes, T., Corruble, V., Chevaleyre, Y.: Recent advances on multi-agent patrolling. In: Bazzan, A.L.C., Labidi, S. (eds.) SBIA 2004. LNCS (LNAI), vol. 3171, pp. 474–483. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-28645-5_48
Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209–219 (2006)
Elor, Y., Bruckstein, A.M.: Multi-a(ge)nt graph patrolling and partitioning. In: 2009 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, pp. 52–57 (2009)
Elth, O., Benno, O., Maarten van, S., Frances, B.: A method for decentralized clustering in large multi-agent systems. In: AAMAS 2003, pp. 789–796 (2003)
I-Ming, C., Bruce, L.G., Edward, A.W.: The team orienteering problem. Eur. J. Oper. Res. 88(3), 464–474 (1996)
Jeyhun, K., Murat, O.: Clustering quality improvement of k-means using a hybrid evolutionary model. Procedia Comput. Sci. 61, 38–45 (2015)
Mihai-Ioan, P., Hervé, R., Olivier, S.: Multi-robot patrolling in wireless sensor networks using bounded cycle coverage. In: 2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 169–176 (2016)
Nallusamy, R., Duraiswamy, K., Dhanalaksmi, R., Parthiban, P.: Optimization of non-linear mutiple traveling salesman problem using k-means clustering, shrink wrap algorithm and meta-heuristics. Int. J. Non Linear Sci. 9(2), 171–177 (2010)
Fazli, P., Alireza, D., Alan, K.M.: Multi-robot repeated area coverage. Auton. Robot 34, 251–276 (2013)
Portugal, D., Rocha, R.: MSP algorithm: muti-robot patrolling based on territory allocation using balanced graph partitioning. In: SAC 2010, pp. 1271–1276 (2010)
Portugal, D., Pippin, C., Rocha, R.P., Christensen, H.: Finding optimal routes for multi-robot patrolling in generic graphs. In: 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 363–369 (2014)
Portugal, D., Rocha, R.: A survey on multi-robot patrolling algorithms. In: Camarinha-Matos, L.M. (ed.) DoCEIS 2011. IAICT, vol. 349, pp. 139–146. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19170-1_15
Sea, V., Sugawara, T.: Area partitioning method with learning of dirty areas and obstacles in environments for cooperative sweeping robots. In: 2015 IIAI 4th International Congress on Advanced Applied Informatics (IIAI-AAI), pp. 523–529 (2015)
Sea, V., Kato, C., Sugawara, T.: Coordinated area partitioning method by autonomous agents for continuous cooperative tasks. J. Inf. Process. (JIP) 25, 75–87 (2017)
Sugiyama, A., Sea, V., Sugawara, T.: Effective task allocation by enhancing divisional cooperation in multi-agent continuous patrolling tasks. In: 2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 33–40 (2016)
Tao, M., Laura, E.R.: Frequency-based patrolling with heterogeneous agents and limited communication. arXiv preprint arXiv: 1402.1757 (2014)
Sak, T., Wainer, J., Goldenstein, S.K.: Probabilistic multiagent patrolling. In: Zaverucha, G., da Costa, A.L. (eds.) SBIA 2008. LNCS (LNAI), vol. 5249, pp. 124–133. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-88190-2_18
Yann, C., Francois, S., Geber, R.: A theoretical analysis of multi-agent patrolling strategies. In: Third International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 1524–1525 (2004)
Yann, C.: Theoretical analysis of the multi-agent patrolling problem. In: IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT), pp. 302–308 (2004)
Yasuyuki, S., Hirofumi, O., Tadashi, M., Maya, H.: Cooperative capture by multi-agent using reinforcement learning application for security patrol systems. In: 2015 10th Asian Control Conference (ASCC), pp. 1–6 (2015)
Yehuda, E., Noa, A., Gal, A.K.: Multi-robot area patrol under frequency constraints. In: 2007 IEEE International Conference on Robotics and Automation, pp. 385–390 (2007)
Definition of Facilities Security Work. https://www.security-law.com/security-services-act/kikai.html
Acknowledgments
This work is partly supported by JSPS KAKENHI grant number 17KT0044.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Sea, V., Sugiyama, A., Sugawara, T. (2018). Frequency-Based Multi-agent Patrolling Model and Its Area Partitioning Solution Method for Balanced Workload. In: van Hoeve, WJ. (eds) Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR 2018. Lecture Notes in Computer Science(), vol 10848. Springer, Cham. https://doi.org/10.1007/978-3-319-93031-2_38
Download citation
DOI: https://doi.org/10.1007/978-3-319-93031-2_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93030-5
Online ISBN: 978-3-319-93031-2
eBook Packages: Computer ScienceComputer Science (R0)