{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:47Z","timestamp":1759638707978,"version":"3.41.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319519654"},{"type":"electronic","value":"9783319519661"}],"license":[{"start":{"date-parts":[[2016,12,29]],"date-time":"2016-12-29T00:00:00Z","timestamp":1482969600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51966-1_22","type":"book-chapter","created":{"date-parts":[[2016,12,28]],"date-time":"2016-12-28T11:11:08Z","timestamp":1482923468000},"page":"331-344","source":"Crossref","is-referenced-by-count":4,"title":["Patrolling Trees with Mobile Robots"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Najmeh","family":"Taleb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,29]]},"reference":[{"issue":"2\u20134","key":"22_CR1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10472-009-9121-1","volume":"52","author":"N Agmon","year":"2008","unstructured":"Agmon, N., Hazon, N., Kaminka, G.A.: The giving tree: constructing trees for efficient offline and online multi-robot coverage. Ann. Math. Artif. Intell. 52(2\u20134), 143\u2013168 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Agmon, N., Kraus, S., Kaminka, G.A.: Multi-robot perimeter patrol in adversarial settings. In: ICRA, pp. 2339\u20132345 (2008)","DOI":"10.1109\/ROBOT.2008.4543563"},{"issue":"4","key":"22_CR3","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1137\/0403039","volume":"3","author":"DJ Aldous","year":"1990","unstructured":"Aldous, D.J.: The random walk construction of uniform spanning trees and uniform labelled trees. SIAM J. Discrete Math. 3(4), 450\u2013465 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"22_CR4","unstructured":"Alpern, S., Morton, A., Papadaki, K.: Optimizing randomized patrols. Operational Research Group, London School of Economics and Political Science (2009)"},{"issue":"5","key":"22_CR5","doi-asserted-by":"crossref","first-page":"1246","DOI":"10.1287\/opre.1110.0983","volume":"59","author":"S Alpern","year":"2011","unstructured":"Alpern, S., Morton, A., Papadaki, K.: Patrolling games. Oper. Res. 59(5), 1246\u20131257 (2011)","journal-title":"Oper. Res."},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Amigoni, F., Basilico, N., Gatti, N., Saporiti, A., Troiani, S.: Moving game theoretical patrolling strategies from theory to practice: an USARSim simulation. In: ICRA, pp. 426\u2013431 (2010)","DOI":"10.1109\/ROBOT.2010.5509943"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-04355-0_44","volume-title":"Distributed Computing","author":"E Bampas","year":"2009","unstructured":"Bampas, E., G\u0105sieniec, L., Hanusse, N., Ilcinkas, D., Klasing, R., Kosowski, A.: Euler tour lock-in problem in the rotor-router model. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 423\u2013435. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04355-0_44"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Broder, A.: Generating random spanning trees. In: 30th Annual Symposium on Foundations of Computer Science, pp. 442\u2013447 (1989)","DOI":"10.1109\/SFCS.1989.63516"},{"key":"22_CR9","unstructured":"Chalopin, J., Das, S., Gawrychowski, P., Kosowski, A., Labourel, A., Uznanski, P.: Lock-in problem for parallel rotor-router walks. CoRR abs\/1407.3200 (2014)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Chevaleyre, Y.: Theoretical analysis of the multi-agent patrolling problem. In: IAT, pp. 302\u2013308 (2004)","DOI":"10.1109\/IAT.2004.1342959"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Collins, A., Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., Krizanc, D., Martin, R., Morales Ponce, O.: Optimal patrolling of fragmented boundaries. In: Proceedings of SPAA (2013)","DOI":"10.1145\/2486159.2486176"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-642-23719-5_59","volume-title":"Algorithms \u2013 ESA 2011","author":"J Czyzowicz","year":"2011","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Kosowski, A., Kranakis, E.: Boundary patrolling by mobile agents with distinct maximal speeds. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 701\u2013712. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-23719-5_59"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E., MacQuarrie, F., Pajak, D.: Fence patrolling with two-speed robots. In: Proceedings of ICORES 2016, 5th International Conference on Operations Research and Enterprise Systems, Rome, Italy, 23\u201325 February 2016 (2016)","DOI":"10.5220\/0005687102290241"},{"key":"22_CR14","unstructured":"Dereniowski, D., Kosowski, A., Pajak, D., Uznanski, P.: Bounds on the cover time of parallel rotor walks. In: STACS 2014, Lyon, France, 5\u20138 March 2014, pp. 263\u2013275 (2014)"},{"issue":"3","key":"22_CR15","doi-asserted-by":"crossref","first-page":"P3.4","DOI":"10.37236\/4063","volume":"21","author":"A Dumitrescu","year":"2014","unstructured":"Dumitrescu, A., Ghosh, A., T\u00f3th, C.D.: On fence patrolling by mobile agents. Electr. J. Comb. 21(3), P3.4 (2014)","journal-title":"Electr. J. Comb."},{"issue":"3\u20134","key":"22_CR16","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10472-010-9193-y","volume":"57","author":"Y Elmaliach","year":"2009","unstructured":"Elmaliach, Y., Agmon, N., Kaminka, G.A.: Multi-robot area patrol under frequency constraints. Ann. Math. Artif. Intell. 57(3\u20134), 293\u2013320 (2009)","journal-title":"Ann. Math. Artif. Intell."},{"key":"22_CR17","unstructured":"Elmaliach, Y., Shiloni, A., Kaminka, G.A.: A realistic model of frequency-based multi-robot polyline patrolling. In: AAMAS, vol. 1, pp. 63\u201370 (2008)"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-15461-4_11","volume-title":"Swarm Intelligence","author":"Y Elor","year":"2010","unstructured":"Elor, Y., Bruckstein, A.M.: Autonomous multi-agent cycle based patrolling. In: Dorigo, M., et al. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 119\u2013130. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15461-4_11"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Gabriely, Y., Rimon, E.: Spanning-tree based coverage of continuous areas by a mobile robot. In: ICRA, pp. 1927\u20131933 (2001)","DOI":"10.1109\/ROBOT.2001.932890"},{"key":"22_CR20","doi-asserted-by":"crossref","first-page":"1102","DOI":"10.1016\/j.robot.2008.01.006","volume":"56","author":"N Hazon","year":"2008","unstructured":"Hazon, N., Kaminka, G.A.: On redundancy, efficiency, and robustness in coverage for multiple robots. Rob. Auton. Syst. 56, 1102\u20131114 (2008)","journal-title":"Rob. Auton. Syst."},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-642-35261-4_62","volume-title":"Algorithms and Computation","author":"A Kawamura","year":"2012","unstructured":"Kawamura, A., Kobayashi, Y.: Fence patrolling by mobile agents with distinct speeds. In: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 598\u2013608. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-35261-4_62"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-662-43951-7_46","volume-title":"Automata, Languages, and Programming","author":"A Kosowski","year":"2014","unstructured":"Kosowski, A., Paj\u0105k, D.: Does adding more agents make a difference? A case study of cover time for the rotor-router. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 544\u2013555. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-43951-7_46"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-30303-1_1","volume-title":"Foundations and Practice of Security","author":"E Kranakis","year":"2016","unstructured":"Kranakis, E., Krizanc, D.: Optimization problems in infrastructure security. In: Garcia-Alfaro, J., Kranakis, E., Bonfante, G. (eds.) FPS 2015. LNCS, vol. 9482, pp. 3\u201313. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-30303-1_1"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-36483-8_11","volume-title":"Multi-Agent-Based Simulation II","author":"A Machado","year":"2003","unstructured":"Machado, A., Ramalho, G., Zucker, J.-D., Drogoul, A.: Multi-agent patrolling: an empirical analysis of alternative architectures. In: Sim\u00e3o Sichman, J., Bousquet, F., Davidsson, P. (eds.) MABS 2002. LNCS (LNAI), vol. 2581, pp. 155\u2013170. Springer, Heidelberg (2003). doi: 10.1007\/3-540-36483-8_11"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Marino, A., Parker, L.E., Antonelli, G., Caccavale, F.: Behavioral control for multi-robot perimeter patrol: a finite state automata approach. In: ICRA, pp. 831\u2013836 (2009)","DOI":"10.1109\/ROBOT.2009.5152710"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Marino, A., Parker, L.E., Antonelli, G., Caccavale, F., Chiaverini, S.: A fault-tolerant modular control approach to multi-robot perimeter patrol. In: Robotics and Biomimetics (ROBIO), pp. 735\u2013740 (2009)","DOI":"10.1109\/ROBIO.2009.5420581"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Pasqualetti, F., Franchi, A., Bullo, F.: On optimal cooperative patrolling. In: CDC, pp. 7153\u20137158 (2010)","DOI":"10.1109\/CDC.2010.5717873"},{"key":"22_CR28","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-19170-1_15","volume-title":"Technological Innovation for Sustainability","author":"D Portugal","year":"2011","unstructured":"Portugal, D., Rocha, R.: A survey on multi-robot patrolling algorithms. In: Camarinha-Matos, L.M. (ed.) DoCEIS 2011. IAICT, vol. 349, pp. 139\u2013146. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-19170-1_15"},{"issue":"3","key":"22_CR29","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s00453-003-1030-9","volume":"37","author":"V Yanovski","year":"2003","unstructured":"Yanovski, V., Wagner, I.A., Bruckstein, A.M.: A distributed ant algorithm for efficiently patrolling a network. Algorithmica 37(3), 165\u2013186 (2003)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Foundations and Practice of Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51966-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T22:52:34Z","timestamp":1749855154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51966-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,29]]},"ISBN":["9783319519654","9783319519661"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51966-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016,12,29]]}}}