{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:20:50Z","timestamp":1767651650578},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633075"},{"type":"electronic","value":"9783540694229"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63307-3_45","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T19:22:48Z","timestamp":1270495368000},"page":"17-30","source":"Crossref","is-referenced-by-count":37,"title":["Visibility-based pursuit-evasion in a polygonal environment"],"prefix":"10.1007","author":[{"given":"Leonidas J.","family":"Guibas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Claude","family":"Latombe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven M.","family":"Lavalle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Motwani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"3_CR1","volume-title":"Dynamic Noncooperative Game Theory","author":"T. Ba\u00a7ar","year":"1982","unstructured":"T. Ba\u00a7ar and G. J. Olsder. Dynamic Noncooperative Game Theory. Academic Press, London, 1982."},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D. Bienstock","year":"1991","unstructured":"D. Bienstock and P. Seymour, Monotonicity in graph searching. J. Algorithms, 12:239\u2013245, 1991.","journal-title":"J. Algorithms"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"B. Chazelle. A theorem on polygon cutting with applications. In Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci., pages 339\u2013349, 1982.","DOI":"10.1109\/SFCS.1982.58"},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(88)90141-X","volume":"28","author":"W.-P. Chin","year":"1988","unstructured":"W.-P. Chin and S. Ntafos. Optimum watchman routes. Information Processing Letters, 28:39\u201344, 1988.","journal-title":"Information Processing Letters"},{"issue":"4","key":"3_CR5","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1142\/S0218195995000246","volume":"5","author":"D. Crass","year":"1995","unstructured":"D. Crass, I. Suzuki, and M. Yamashita. Searching for a mobile intruder in a corridor \u2014 the open edge variant of the polygon search problem. Int. J. Comput. Geom. & Appl., 5(4):397\u2013412, 1995.","journal-title":"Int. J. Comput. Geom. & Appl."},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/BF01891842","volume":"10","author":"M. Erdmann","year":"1993","unstructured":"M. Erdmann. Randomization for robot tasks: Using dynamic programming in the space of knowledge states. Algorithmica, 10:248\u2013291, 1993.","journal-title":"Algorithmica"},{"issue":"2","key":"3_CR7","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","volume":"4","author":"L. Guibas","year":"1985","unstructured":"L. Guibas and J. Stolfe. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. AMC Trans. Graphics, 4(2):74\u2013123, 1985.","journal-title":"AMC Trans. Graphics"},{"key":"3_CR8","first-page":"269","volume-title":"Proc. 1st Workshop on Algorithmic Foundations of Robotics","author":"L. J. Guibas","year":"1995","unstructured":"L. J. Guibas, R. Motwani, and P. Raghavan. The robot localization problem. In K. Goldberg, D. Halperin, J.-C. Latombe, and R. Wilson, editors, Proc. 1st Workshop on Algorithmic Foundations of Robotics, pages 269\u2013282. A.K. Peters, Wellesley, MA, 1995."},{"key":"3_CR9","volume-title":"Pursuit Games","author":"O. H\u00e1jek","year":"1975","unstructured":"O. H\u00e1jek. Pursuit Games. Academic Press, New York, 1975."},{"key":"3_CR10","volume-title":"Differential Games","author":"R. Isaacs","year":"1965","unstructured":"R. Isaacs. Differential Games. Wiley, New York, NY, 1965."},{"issue":"2","key":"3_CR11","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A. S. Lapaugh","year":"1993","unstructured":"A. S. Lapaugh. Recontamination does not help to search a graph. J. ACM, 40(2):224\u2013245, April 1993.","journal-title":"J. ACM"},{"key":"3_CR12","volume-title":"A Game-Theoretic Framework for Robot Motion Planning","author":"S. M. LaValle","year":"1995","unstructured":"S. M. LaValle. A Game-Theoretic Framework for Robot Motion Planning. PhD thesis, University of Illinois, Urbana, IL, July 1995."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"S. M. LaValle, D. Lin, L. J. Guibas, J.-C. Latombe, and R. Motwani. Finding an unpredictable target in a workspace with obstacles. In Prof. IEEE Int'l Conf, on Robotics and Automation, 1997.","DOI":"10.1109\/ROBOT.1997.620123"},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM Journal of Applied Mathematics, 36:177\u2013189, 1979.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"F. Makedon and I. H. Sudborough. Minimizing width in linear layouts. In Proc. 10th ICALP, Lecture Notes in Computer Science 154, pages 478\u2013490. Springer-Verlag, 1983.","DOI":"10.1007\/BFb0036931"},{"issue":"1","key":"3_CR16","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou. The complexity of searching a graph. J. ACM, 35(1):18\u201344, January 1988.","journal-title":"J. ACM"},{"key":"3_CR17","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0304-3975(88)90028-X","volume":"58","author":"B. Monien","year":"1988","unstructured":"B. Monien and I. H. Sudborough. Min cut is NP-complete for edge weighted graphs. Theoretical Computer Science, 58:209\u2013229, 1988.","journal-title":"Theoretical Computer Science"},{"key":"3_CR18","volume-title":"Art Gallery Theorems and Algorithms","author":"J. O'Rourke","year":"1987","unstructured":"J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, New York, NY, 1987."},{"key":"3_CR19","first-page":"426","volume-title":"Theory and Application of Graphs","author":"T. D. Parsons","year":"1976","unstructured":"T. D. Parsons. Pursuit-evasion in a graph. In Y. Alani and D. R. Lick, editors, Theory and Application of Graphs, pages 426\u2013441. Springer-Verlag, Berlin, 1976."},{"issue":"3","key":"3_CR20","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1177\/027836498300200304","volume":"2","author":"J. T. Schwartz","year":"1983","unstructured":"J. T. Schwartz and M. Sharir. On the piano movers' problem: III. Coordinating the motion of several independent bodies. Int. J. Robot. Res., 2(3):97\u2013140, 1983.","journal-title":"Int. J. Robot. Res."},{"issue":"9","key":"3_CR21","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/5.163407","volume":"80","author":"T. Shermer","year":"1992","unstructured":"T. Shermer. Recent results in art galleries. Proc. IEEE, 80(9):1384\u20131399, September 1992.","journal-title":"Proc. IEEE"},{"issue":"5","key":"3_CR22","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1137\/0221051","volume":"21","author":"I. Suzuki","year":"1992","unstructured":"I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. Comput., 21(5):863\u2013888, October 1992.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR23","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/70.481751","volume":"12","author":"R. Talluri","year":"1996","unstructured":"R. Talluri and J. K. Aggarwal. Mobile robot self-location using model-image feature correspondence. IEEE Trans. Robot. & Autom., 12(1):63\u201377, February 1996.","journal-title":"IEEE Trans. Robot. & Autom."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63307-3_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T16:15:34Z","timestamp":1549210534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63307-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633075","9783540694229"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-63307-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}