{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:18:26Z","timestamp":1761488306315},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,9,3]],"date-time":"2009-09-03T00:00:00Z","timestamp":1251936000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Intel Serv Robotics"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s11370-009-0050-y","type":"journal-article","created":{"date-parts":[[2009,9,2]],"date-time":"2009-09-02T03:31:29Z","timestamp":1251862289000},"page":"247-263","source":"Crossref","is-referenced-by-count":34,"title":["Scalable and practical pursuit-evasion with networked robots"],"prefix":"10.1007","volume":"2","author":[{"given":"Marcos A. M.","family":"Vieira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramesh","family":"Govindan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaurav S.","family":"Sukhatme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,3]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(84)90073-8","volume":"8","author":"M Aigner","year":"1984","unstructured":"Aigner M, Fromme M (1984) A Game of cops and robber. Discrete Appl. Math 8: 1\u201312","journal-title":"Discrete Appl. Math"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Alankus G, Atay N, Lu C, Bayazit B (2007) Adaptive embedded roadmaps for sensor networks. In: IEEE international conference on robotics and automation","DOI":"10.1109\/ROBOT.2007.364037"},{"key":"50_CR3","first-page":"5","volume":"59","author":"B Alspach","year":"2004","unstructured":"Alspach B (2004) Searching and sweeping graphs: a brief survey. Le Matematiche (Catania) 59: 5\u201337","journal-title":"Le Matematiche (Catania)"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Batalin MA, Sukhatme GS (2003) Coverage, exploration and deployment by a mobile robot and communication network. In: Telecommunication systems journal. Special issue on wireless sensor networks, pp 376\u2013391","DOI":"10.1007\/3-540-36978-3_25"},{"issue":"4","key":"50_CR5","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1006\/aama.1993.1019","volume":"14","author":"A Berarducci","year":"1993","unstructured":"Berarducci A, Intrigila B (1993) On the cop number of a graph. Adv Appl Math 14(4): 389\u2013403. doi: 10.1006\/aama.1993.1019","journal-title":"Adv Appl Math"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Bhattacharya S, Candido S, Hutchinson S (2007) Motion strategies for surveillance. In: Robotics: science and systems. http:\/\/www.roboticsproceedings.org\/rss03\/p32.html","DOI":"10.15607\/RSS.2007.III.032"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Burkard RE, \u00c7ela E (1999) Linear assignment problems and extensions. handbook of combinatorial optimization, vol. 4, Kluwer Academic Publishers, pp. 75\u2013149","DOI":"10.1007\/978-1-4757-3023-4_2"},{"key":"50_CR8","unstructured":"Cheung W (2005) Constrained pursuit-evasion problems in the plane. Master Thesis, University of British Columbia"},{"key":"50_CR9","unstructured":"Corke PI, Hrabar SE, Peterson R, Rus D, Saripalli S, Sukhatme GS (2004) Deployment and connectivity repair of a sensor net. In: 9th international symposium on experimental robotics"},{"issue":"9","key":"50_CR10","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1177\/0278364905057118","volume":"24","author":"P Corker","year":"2005","unstructured":"Corker P, Peterson R, Rus D (2005) Localization and navigation assisted by networked cooperating sensors and robots. Int J Robot Res 24(9): 771\u2013786","journal-title":"Int J Robot Res"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Gerkey BP, Vaughan RT, St\u00f8y K, Howard A, Sukhatme GS, Mataric MJ (2001) Most valuable player: a robot device server for distributed control. Maui, HI, USA, pp 1226\u20131231","DOI":"10.1109\/IROS.2001.977150"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Gnawali O, Greenstein B, Jang KY, Joki A, Paek J, Vieira M, Estrin D, Govindan R, Kohler E (2006) The TENET architecture for tiered sensor networks. In: Proceedings of the ACM conference on embedded networked sensor systems. Boulder, Colorado","DOI":"10.1145\/1182807.1182823"},{"issue":"1","key":"50_CR13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(95)80026-6","volume":"143","author":"AS Goldstein","year":"1995","unstructured":"Goldstein AS, Reingold EM (1995) The complexity of pursuit on a graph. Theor Comput Sci 143(1): 93\u2013112. doi: 10.1016\/0304-3975(95)80012-3","journal-title":"Theor Comput Sci"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Guibas LJ, Latombe JC, LaValle SM, Lin D, Motwani R (1997) Visibility-based pursuit-evasion in a polygonal environment. In: WADS '97: proceedings of the 5th international workshop on algorithms and data structures. Springer-Verlag, London, UK, pp 17\u201330. ISBN:3-540-63307-3","DOI":"10.1007\/3-540-63307-3_45"},{"issue":"2","key":"50_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1023\/A:1019625207705","volume":"13","author":"A Howard","year":"2002","unstructured":"Howard A, Matari\u0107 MJ, Sukhatme GS (2002) An incremental self-deployment algorithm for mobile sensor networks. Auton Robots 13(2): 113\u2013126","journal-title":"Auton Robots"},{"issue":"21","key":"50_CR16","first-page":"864","volume":"5","author":"V Isler","year":"2005","unstructured":"Isler V, Kannan S, Khanna S (2005) Randomized pursuit-evasion in a polygonal environment. IEEE Trans Robot 5(21): 864\u2013875","journal-title":"IEEE Trans Robot"},{"issue":"4","key":"50_CR17","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R Jonker","year":"1987","unstructured":"Jonker R, Volgenant A (1987) A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38(4): 325\u2013340. doi: 10.1007\/BF02278710","journal-title":"Computing"},{"key":"50_CR18","unstructured":"Kuipers B, Byun YT (1990) A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations. Tech. Rep. AI90-120"},{"issue":"1","key":"50_CR19","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1077391.1077393","volume":"1","author":"Q Li","year":"2005","unstructured":"Li Q, Rus D (2005) Navigation protocols in sensor networks. ACM Trans Sensor Netw 1(1): 3\u201335","journal-title":"ACM Trans Sensor Netw"},{"issue":"3","key":"50_CR20","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1109\/70.143349","volume":"8","author":"MJ Matari\u0107","year":"1992","unstructured":"Matari\u0107 MJ (1992) Integration of representation into goal-driven behavior-based robots. IEEE Trans Robot Autom 8(3): 304\u2013312","journal-title":"IEEE Trans Robot Autom"},{"key":"50_CR21","volume-title":"The robotics primer","author":"MJ Matari\u0107","year":"2007","unstructured":"Matari\u0107 MJ (2007) The robotics primer. MIT Press, Cambridge"},{"issue":"4","key":"50_CR22","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1109\/TRO.2007.903809","volume":"23","author":"B Maxim","year":"2007","unstructured":"Maxim B, Gaurav SS (2007) The design and analysis of an efficient local algorithm for coverage and exploration based on sensor network deployment. IEEE Trans Robot 23(4): 661\u2013675","journal-title":"IEEE Trans Robot"},{"issue":"3","key":"50_CR23","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1177\/0278364907077083","volume":"26","author":"R Murrieta-Cid","year":"2007","unstructured":"Murrieta-Cid R, Muppirala T, Sarmiento A, Bhattacharya S, Hutchinson S (2007) Surveillance strategies for a pursuer with finite sensor range. Int J Rob Res 26(3): 233\u2013253. doi: 10.1177\/0278364907077083","journal-title":"Int J Rob Res"},{"key":"50_CR24","unstructured":"Neufeld E, Myrvold W (1997) Practical toroidality testing. In: SODA '97: Proceedings of the eighth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp 574\u2013580. ISBN:0-89871-390-0"},{"issue":"1\u20133","key":"50_CR25","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0012-365X(97)00165-9","volume":"186","author":"S Neufeld","year":"1998","unstructured":"Neufeld S, Nowakowski R (1998) A game of cops and robbers played on products of graphs. Discrete Math 186(1\u20133): 253\u2013266. doi: 10.1016\/S0012-365X(97)00165-9","journal-title":"Discrete Math"},{"issue":"2\u20133","key":"50_CR26","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"RJ Nowakowski","year":"1983","unstructured":"Nowakowski RJ, Winkler P (1983) Vertex-to-vertex pursuit in a graph. Discrete Math 43(2\u20133): 235\u2013239","journal-title":"Discrete Math"},{"key":"50_CR27","doi-asserted-by":"crossref","unstructured":"Oh S, Schenato L, Chen P, Sastry S (2007) Tracking and coordination of multiple agents using sensor networks: system design, algorithms and experiments. Proceedings IEEE 95(1):234\u2013254. http:\/\/www.truststc.org\/pubs\/244.html","DOI":"10.1109\/JPROC.2006.887296"},{"key":"50_CR28","doi-asserted-by":"crossref","unstructured":"O\u2019Hara KJ, Bigio V, Dodson E, Irani A, Walker D, Balch T (2005) Physical path planning using the gnats. In: IEEE international conference on robotics and automation","DOI":"10.1109\/ROBOT.2005.1570201"},{"key":"50_CR29","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/BFb0070400","volume":"642","author":"TD Parsons","year":"1978","unstructured":"Parsons TD (1978) Pursuit-evasion in a graph. Lect Notes Math 642: 426\u2013441. doi: 10.1007\/BFb0070400","journal-title":"Lect Notes Math"},{"issue":"3","key":"50_CR30","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02684443","volume":"59","author":"U Pferschy","year":"1997","unstructured":"Pferschy U (1997) Solution methods and computational investigations for the linear bottleneck assignment problem. Computing 59(3): 237\u2013258. doi: 10.1007\/BF02684443","journal-title":"Computing"},{"issue":"1","key":"50_CR31","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0095-8956(85)90093-0","volume":"38","author":"A Quilliot","year":"1985","unstructured":"Quilliot A (1985) A short note about pursuit games played on a graph with a given genus. J Comb Theory, Ser B 38(1): 89\u201392","journal-title":"J Comb Theory, Ser B"},{"key":"50_CR32","doi-asserted-by":"crossref","unstructured":"Reich J, Misra V, Rubenstein D (2008) Roomba MADNeT: a mobile ad-hoc delay tolerant network testbed. In: MC2R: Mobile Computing and Communications Review. ACM Sigmobile","DOI":"10.1145\/1374512.1374536"},{"key":"50_CR33","unstructured":"Russell, Stuart J, Norvig, Peter (2003) Artificial Intelligence: A Modern Approach. http:\/\/portal.acm.org\/citation.cfm?id=773294"},{"issue":"1","key":"50_CR34","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"PD Seymour","year":"1993","unstructured":"Seymour PD, Thomas R (1993) Graph searching and a min\u2013max theorem for tree-width. J Comb Theory Ser B 58(1): 22\u201333. doi: 10.1006\/jctb.1993.1027","journal-title":"J Comb Theory Ser B"},{"issue":"1\u20132","key":"50_CR35","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1016\/S0304-3975(00)00411-4","volume":"259","author":"J Sgall","year":"2001","unstructured":"Sgall J (2001) Solution of David Gale\u2019s lion and man problem. Theor Comput Sci 259(1\u20132): 663\u2013670","journal-title":"Theor Comput Sci"},{"key":"50_CR36","unstructured":"Sumo Robot (2008) http:\/\/msdn2.microsoft.com\/en-us\/robotics\/bb403184.aspx"},{"key":"50_CR37","doi-asserted-by":"crossref","unstructured":"Tekdas O, Isler V (2008) Robotic routers. In: Proceeding of IEEE international conference on robotics and automation. http:\/\/www.cs.rpi.edu\/%7Eisler\/new\/pub\/pubs\/icra08routers.pdf (to appear)","DOI":"10.1109\/ROBOT.2008.4543416"},{"key":"50_CR38","unstructured":"The SmURV Robotics Platform. http:\/\/robotics.cs.brown.edu\/projects\/smurv\/"},{"issue":"5","key":"50_CR39","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TRA.2002.804040","volume":"18","author":"R Vidal","year":"2002","unstructured":"Vidal R, Shakernia O, Kim HJ, Shim DH, Sastry S (2002) Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation. IEEE Trans Robot Autom 18(5): 662\u2013669","journal-title":"IEEE Trans Robot Autom"},{"key":"50_CR40","doi-asserted-by":"crossref","unstructured":"Wang X, Jose B. Cruz J, Chen G, Pham K, Blasch E (2007) Formation control in multi-player pursuit evasion game with superior evaders, p 657811. SPIE. doi: 10.1117\/12.723300 . http:\/\/link.aip.org\/link\/?PSI\/6578\/657811\/1","DOI":"10.1117\/12.723300"},{"key":"50_CR41","doi-asserted-by":"crossref","unstructured":"Wei M, Chen G, Cruz J, Hayes L, Chang MH (2006) A decentralized approach to pursuer-evader games with multiple superior evaders. Intelligent Transportation Systems Conference. ITSC '06. IEEE pp 1586\u20131591.doi: 10.1109\/ITSC.2006.1707450","DOI":"10.1109\/ITSC.2006.1707450"},{"key":"50_CR42","unstructured":"Weisstein EW. Grid graph. MathWorld\u2014a wolfram web resource. http:\/\/mathworld.wolfram.com\/GridGraph.html"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-009-0050-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11370-009-0050-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-009-0050-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T14:23:36Z","timestamp":1559571816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11370-009-0050-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,3]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["50"],"URL":"https:\/\/doi.org\/10.1007\/s11370-009-0050-y","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,3]]}}}