Pursuit-evasion with imprecise target location
暂无分享,去创建一个
[1] J. R. Weisinger,et al. A survey of the search theory literature , 1991 .
[2] Leonidas J. Guibas,et al. A Visibility-Based Pursuit-Evasion Problem , 1999, Int. J. Comput. Geom. Appl..
[3] Rudolf Fleischer,et al. Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness , 2004, Algorithmica.
[4] Jirí Sgall. Solution of David Gale's lion and man problem , 2001, Theor. Comput. Sci..
[5] Marek Chrobak,et al. The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts , 2001, ICALP.
[6] J. C. Burkill,et al. A mathematician's miscellany , 1954 .
[7] Joseph Naor,et al. Competitive On-Line Switching Policies , 2002, SODA '02.
[8] Kyung-Yong Chwa,et al. Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher , 2001, ICALP.
[9] Masafumi Yamashita,et al. Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..
[10] Micah Adler,et al. Randomized Pursuit-Evasion in Graphs , 2002, Combinatorics, Probability and Computing.
[11] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[12] T. D. Parsons,et al. Pursuit-evasion in a graph , 1978 .
[13] Sándor P. Fekete,et al. Asymmetric rendezvous on the plane , 1998, SCG '98.
[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).