Bibliography

1

S. Alexander, R. Bishop, and R. Ghrist.
Pursuit and evasion in nonconvex domains of arbitrary dimension.
In G. S. Sukhatme, S. Schaal, W. Burgard, and D. Fox, editors, Robotics: Science and Systems II. MIT Press, Cambridge, MA, 2007.

2

L. Alonso, A. S. Goldstein, and E. M. Reingold.
Lion and man: Upper and lower bounds.
ORSA Journal of Computing, 4(4):447-452, 1992.

3

Y. Baryshnikov and R. Ghrist.
Target enumeration via euler characteristic integrals.
SIAM Journal of Applied Mathematics, 70(4):825, August 2009.

4

S. D. Bopardikar, F. Bullo, and J. P. Hespanha.
On discrete-time pursuit-evasion games with sensing limitations.
IEEE Transactions on Robotics, 24(6):1429-1439, 2008.

5

P. Bose, A. Lubiv, and J. I. Munro.
Efficient visibility queries in simple polygons.
In Proceedings Canadian Conference on Computational Geometry, pages 23-28, 1992.

6

W.-P. Chin and S. Ntafos.
Optimum watchman routes.
Information Processing Letters, 28:39-44, 1988.

7

W.-P. Chin and S. Ntafos.
Optimum watchman routes in simple polygons.
Discrete and Computational Geometry, 6:9-31, 1991.

8

J. Edmonds and R. M. Karp.
Theoretical improvements in algorithmic efficiency for network flow problems.
J. ACM, 19(2):248-264, 1972.

9

B. P. Gerkey, S. Thrun, and G. Gordon.
Visibility-based pursuit-evasion with limited field of view.
International Journal of Robotics Research, 25(4):299-322, 2006.

10

B. Gfeller, M. Mihalak, S. Suri, E. Vicari, and P. Widmayer.
Counting targets with mobile sensors in an unknown environment.
In ALGOSENSORS, July 2007.

11

A. V. Goldberg and R. E. Tarjan.
A new approach to the maximum flow problem.
In STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computing, pages 136-146, New York, NY, USA, 1986. ACM.

12

L. J. Guibas, J.-C. Latombe, S. M. LaValle, D. Lin, and R. Motwani.
Visibility-based pursuit-evasion in a polygonal environment.
International Journal of Computational Geometry and Applications, 9(5):471-494, 1999.

13

O. Hájek.
Pursuit Games.
Academic, New York, 1975.

14

Y. Ho, A. E. Bryson, and S. Baron.
Differential games and optimal pursuit-evasion strategies.
IEEE Transactions on Automatic Control, 10(4):385-389, 1965.

15

R. Isaacs.
Differential Games.
Wiley, New York, 1965.

16

V. Isler, S. Kannan, , and S. Khanna.
Randomized pursuit-evasion in a polygonal environment.
IEEE Transactions on Robotics, 5(21):864-875, 2005.

17

R. E. Kalman.
A new approach to linear filtering and prediction problems.
Transactions of the ASME, Journal of Basic Engineering, 82:35-45, 1960.

18

T. Kameda, M. Yamashita, and I. Suzuki.
On-line polygon search by a seven-state boundary 1-searcher.
IEEE Transactions on Robotics, 22:446-460, Jun 2006.

19

S. Kopparty and C. V. Ravishankar.
A framework for pursuit evasion games in ${R}^n$ .
Information Processing Letters, 96(3):114-122, 2005.

20

S. M. LaValle.
Planning Algorithms.
Cambridge University Press, Cambridge, U.K., 2006.
Also available at http://planning.cs.uiuc.edu/.

21

S. M. LaValle and J. Hinrichsen.
Visibility-based pursuit-evasion: The case of curved environments.
IEEE Transactions on Robotics and Automation, 17(2):196-201, April 2001.

22

S. M. LaValle, D. Lin, L. J. Guibas, J.-C. Latombe, and R. Motwani.
Finding an unpredictable target in a workspace with obstacles.
In Proceedings IEEE International Conference on Robotics and Automation, pages 737-742, 1997.

23

S.-H. Lim, T. Furukawa, G. Dissanayake, and H. F. Durrant-Whyte.
A time-optimal control strategy for pursuit-evasion games problems.
In Proceedings IEEE International Conference on Robotics & Automation, 2004.

24

J. O'Rourke.
Art Gallery Theorems and Algorithms.
Oxford University Press, New York, 1987.

25

J. O'Rourke.
Visibility.
In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, 2nd Ed., pages 643-663. Chapman and Hall/CRC Press, New York, 2004.

26

M. Pachter.
Simple motion pursuit-evasion differential games.
In Mediterranean Conference on Control and Automation, Lisbon, Portugal, July 2002.

27

S.-M. Park, J.-H. Lee, and K.-Y. Chwa.
Visibility-based pursuit-evasion in a polygonal region by a searcher.
Technical Report CS/TR-2001-161, Dept. of Computer Science, KAIST, Seoul, South Korea, January 2001.

28

T. D. Parsons.
Pursuit-evasion in a graph.
In Y. Alavi and D. R. Lick, editors, Theory and Application of Graphs, pages 426-441. Springer-Verlag, Berlin, 1976.

29

S. Petitjean, D. Kriegman, and J. Ponce.
Computing exact aspect graphs of curved objects: algebraic surfaces.
International Journal of Computer Vision, 9:231-255, Dec 1992.

30

M. Pocchiola and G. Vegter.
The visibility complex.
International Journal Computational Geometry & Applications, 6(3):279-308, 1996.

31

S. Sachs, S. Rajko, and S. M. LaValle.
Visibility-based pursuit-evasion in an unknown planar environment.
International Journal of Robotics Research, 23(1):3-26, January 2004.

32

A. Schrijver.
Combinatorial Optimization.
Springer-Verlag, 2003.

33

J. Sgall.
A solution of david gale’s lion and man problem.
Theoretical Computational Science, 259(1-2):663-670, 2001.

34

T. Shermer.
Recent results in art galleries.
Proceedings of the IEEE, 80(9):1384-1399, September 1992.

35

B. Simov, G. Slutzki, and S. M. LaValle.
Pursuit-evasion using beam detection.
In Proceedings IEEE International Conference on Robotics and Automation, 2000.

36

J. Singh, R. Kumar, U. Madhow, S. Suri, and R. Cagley.
Tracking multiple targets using binary proximity sensors.
In Proc. Information Processing in Sensor Networks, 2007.

37

I. Suzuki and M. Yamashita.
Searching for a mobile intruder in a polygonal region.
SIAM Journal on Computing, 21(5):863-888, October 1992.

38

B. Tovar, F. Cohen, and S. M. LaValle.
Sensor beams, obstacles, and possible paths.
In Proceedings Workshop on Algorithmic Foundations of Robotics, 2008.

39

B. Tovar and S. M. LaValle.
Visibility-based pursuit-evasion with bounded speed.
International Journal of Robotics Research, 2007.
Under review (invited submission from WAFR 2006).

40

B. Tovar, R Murrieta, and S. M. LaValle.
Distance-optimal navigation in an unknown environment without sensing distances.
IEEE Transactions on Robotics, 23(3):506-518, June 2007.

41

V. Turetsky.
Upper bounds of the pursuer control based on a linear-quadratic differential game.
Journal of Optimization Theory and Applications, 121(1):163-191, April 2004.

42

R. Vidal, O. Shakernia, H. J. Kim, D. H. Shim, and S. Sastry.
Probabalistic pursuit-evasion games: Theory, implementation, and experimental evaluation.
IEEE Transactions on Robotics and Automation, 18(5):662–669, 2002.

43

C.-C. Wang, C. Thorpe, S. Thrun, M. Hebert, and H. Durrant-Whyte.
Simultaneous localization, mapping and moving object tracking.
International Journal of Robotics Research, 26(9):889-916, 2007.

44

D. B. Yang, H. H. Gonzalez-Banos, and L. J. Guibas.
Counting people in crowds with a real-time network of simple image sensors.
In Proc. IEEE International Conference on Computer Vision, volume 1, pages 122- 129, 2003.

45

J. Yu and S. M. LaValle.
Tracking hidden agents through shadow information spaces.
In Proceedings IEEE International Conference on Robotics and Automation, 2008.

46

J. Yu and S. M. LaValle.
Probabilistic shadow information spaces.
In Proceedings IEEE International Conference on Robotics and Automation, 2010.