{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:16:13Z","timestamp":1762917373355,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_59","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"701-712","source":"Crossref","is-referenced-by-count":52,"title":["Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2-4","key":"59_CR1","doi-asserted-by":"publisher","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.\u00a052(2-4), 143\u2013168 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"key":"59_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"},{"key":"59_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-540-28645-5_48","volume-title":"Advances in Artificial Intelligence \u2013 SBIA 2004","author":"A. Almeida","year":"2004","unstructured":"Almeida, A., Ramalho, G., Santana, H., Azevedo 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.\u00a03171, pp. 474\u2013483. Springer, Heidelberg (2004)"},{"key":"59_CR4","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":"59_CR5","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.\u00a05805, pp. 423\u2013435. Springer, Heidelberg (2009)"},{"key":"59_CR6","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.endm.2007.07.085","volume":"29","author":"J. Barajas","year":"2007","unstructured":"Barajas, J., Serra, O.: Regular chromatic number and the lonely runner problem. Electronic Notes in Discrete Mathematics\u00a029, 479\u2013483 (2007)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"59_CR7","doi-asserted-by":"crossref","unstructured":"Barajas, J., Serra, O.: The lonely runner with seven runners. Electron. J. Combin 15(1) (2008)","DOI":"10.37236\/772"},{"issue":"1","key":"59_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1997.1770","volume":"72","author":"W. Bienia","year":"1998","unstructured":"Bienia, W., Goddyn, L., Gvozdjak, P., Seb\u0151, A., Tarsi, M.: Flows, View Obstructions, and the Lonely Runner. Journal of Combinatorial Theory, Series B\u00a072(1), 1\u20139 (1998)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"59_CR9","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"},{"issue":"3-4","key":"59_CR10","doi-asserted-by":"publisher","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.\u00a057(3-4), 293\u2013320 (2009)","journal-title":"Ann. Math. Artif. Intell."},{"key":"59_CR11","unstructured":"Elmaliach, Y., Shiloni, A., Kaminka, G.A.: A realistic model of frequency-based multi-robot polyline patrolling. In: AAMAS (1), pp. 63\u201370 (2008)"},{"key":"59_CR12","doi-asserted-by":"crossref","unstructured":"Elor, Y., Bruckstein, A.M.: Autonomous multi-agent cycle based patrolling. In: ANTS Conference, pp. 119\u2013130 (2010)","DOI":"10.1007\/978-3-642-15461-4_11"},{"key":"59_CR13","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"},{"issue":"12","key":"59_CR14","doi-asserted-by":"publisher","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. Robotics and Autonomous Systems\u00a056(12), 1102\u20131114 (2008)","journal-title":"Robotics and Autonomous Systems"},{"key":"59_CR15","unstructured":"Horvat, C.H., Stoffregen, M.: A solution to the lonely runner conjecture for almost all points. Technical Report arXiv:1103.1662v1 (2011)"},{"key":"59_CR16","series-title":"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.L., Zucker, J.-D., 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.\u00a02581, pp. 155\u2013170. Springer, Heidelberg (2003)"},{"key":"59_CR17","unstructured":"Marey, E.J.: La m\u00e9thode graphique (1878)"},{"key":"59_CR18","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":"59_CR19","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"},{"issue":"3","key":"59_CR20","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01298332","volume":"71","author":"J.M. Wills","year":"1967","unstructured":"Wills, J.M.: Zwei S\u00e4tze \u00fcber inhomogene diophantische Approximation von Irrationalzehlen. Monatshefte f\u00fcr Mathematik\u00a071(3), 263\u2013269 (1967)","journal-title":"Monatshefte f\u00fcr Mathematik"},{"issue":"3","key":"59_CR21","doi-asserted-by":"publisher","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\u00a037(3), 165\u2013186 (2003)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T12:10:56Z","timestamp":1741522256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}