Pursuit-evasion using beam detection
暂无分享,去创建一个
[1] T. D. Parsons,et al. Pursuit-evasion in a graph , 1978 .
[2] Christos H. Papadimitriou,et al. The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[3] J. Schwartz,et al. On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .
[4] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .
[5] Fillia Makedon,et al. Minimizing Width in Linear Layouts , 1983, ICALP.
[6] Ivan Hal Sudborough,et al. Min Cut is NP-Complete for Edge Weigthed Trees , 1986, ICALP.
[7] Paul D. Seymour,et al. Monotonicity in Graph Searching , 1991, J. Algorithms.
[8] Rolf Klein,et al. The two guards problem , 1991, SCG '91.
[9] Masafumi Yamashita,et al. Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..
[10] Paul J. Heffernan,et al. An optimal algorithm for the two-guard problem , 1993, SCG '93.
[11] Andrea S. LaPaugh,et al. Recontamination does not help to search a graph , 1993, JACM.
[12] Masafumi Yamashita,et al. Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem , 1995, Int. J. Comput. Geom. Appl..
[13] Leonidas J. Guibas,et al. Finding an unpredictable target in a workspace with obstacles , 1997, Proceedings of International Conference on Robotics and Automation.
[14] Steven M. LaValle,et al. Visibility-based pursuit-evasion: the case of curved environments , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).