Capturing an Evader in a Polygonal Environment with Obstacles
暂无分享,去创建一个
[1] Edward M. Reingold,et al. "Lion and Man": Upper and Lower Bounds , 1992, INFORMS J. Comput..
[2] Leonidas J. Guibas,et al. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons , 1987, Algorithmica.
[3] Jirí Sgall. Solution of David Gale's lion and man problem , 2001, Theor. Comput. Sci..
[4] Leonidas J. Guibas,et al. A Visibility-Based Pursuit-Evasion Problem , 1999, Int. J. Comput. Geom. Appl..
[5] Masafumi Yamashita,et al. Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..
[6] Peter Winkler,et al. Vertex-to-vertex pursuit in a graph , 1983, Discret. Math..
[7] Gaurav S. Sukhatme,et al. Scalable and practical pursuit-evasion with networked robots , 2009, Intell. Serv. Robotics.
[8] T. D. Parsons,et al. Pursuit-evasion in a graph , 1978 .
[9] Martin Aigner,et al. A game of cops and robbers , 1984, Discret. Appl. Math..
[10] Sampath Kannan,et al. Randomized pursuit-evasion in a polygonal environment , 2005, IEEE Transactions on Robotics.