Two dimensional rendezvous search

Operations Research

Volumn 49, Issue 1, 2001, Pages 107-118

  Anderson, Edward J ^a   Fekete, Sándor P ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; DIFFERENTIAL EQUATIONS; PROBABILISTIC LOGICS; PROBLEM SOLVING; SET THEORY;

TWO DIMENSIONAL RENDEZVOUS PROBLEMS;

GAME THEORY;

EID: 0034996639     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.49.1.107.11191     Document Type: Article

References (33)

1. Alpern, S. 1995. The rendezvous search problem. SIAM J. Control and Optimiz. 33 673-68.5.
2. _, V. Baston, S. Essegaier. 1999. Rendezvous search on a graph. J. Appl. Probab. 36 948-959.
3. _, A. Beck. 1997. Rendezvous search on the line with bounded resources: minimizing expected meeting time. Euro. J. Oper. Res. 101 588-597.
4. _, A. Beck. 1999a. Asymmetric rendezvous search on the line is a double linear search problem. Math. Oper. Res. 24 604-618.
5. _, _. 1999b. Rendezvous search on the line with limited resources: maximizing the probability of meeting. Oper. Res. 47 849-861.
6. _, S. Gal. 1995. Rendezvous search on the line with distinguishable players. SIAM J. Control Optimiz. 33 1270-1276.
7. _, J. V. Howard. 2001. Alternating search at two locations. Dynamics and Control forthcoming.
8. _, W. S. Lim. 1998. The symmetric rendezvous-evasion game. SIAM J. Control Optimiz. 36 948-959.
9. Anderson, E. J., S. Essegaier. 1995. Rendezvous search on the line with indistinguishable players. SIAM J. Control Optimiz. 33 1637-1642.
10. _, R. R. Weber. 1990. The rendezvous problem on discrete locations. J. Appl. Probab. 28 839-851.
11. Arkin, E. M., S. P. Fekete, J. S. B. Mitchell. 1993. The lawnmower problem. In Proc. Fifth Canadian Conference on Computational Geometry. Waterloo 461-466.
12. _, _, _. 2000. Approximation algorithms for lawn mowing and milling. Computational Geometry 17 25-50.
13. Arora, S. 1996. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In Proc. 37th Annual IEEE Symposium on the Foundations of Computer Science. 2-12.
14. Baeza-Yates, R. A., J. C. Culberson, G. J. E. Rawlins. 1993. Searching in the plane. Information Comput. 106 234-252.
15. Baston, V. J. 1997. Two rendezvous search problems on the line. Naval Res. Logist. 46 335-340.
16. _, S. Gal. 1998. Rendezvous on the line when the players' initial distance is given by an unknown probability distribution. SIAM J. Control Optimiz. 36 1880-1889.
17. Beck, A., D. J. Newman. 1970. Yet more on the linear search problem. Israel J. Math. 8 419-429.
18. Blum, A., P. Chalasani, D. Coppersmith, W. R. Pulleyblank, P. Raghavan, M. Sudan. 1994. The minimum latency problem. In Proc. Ann. Symp. Theo. Comp. (STOC) 163-171.
19. Gal, S. 1980. Search Games. Academic Press, New York.
20. _. 1989. Continuous search games. In Search Theory. Volume 112 of Lecture Notes in Pure and Applied Mathematics. D. V. Chudnovsky and G. V. Chudnovsky (Eds.), Marcel Dekker, New York.
21. _. 1999. Rendezvous search on the line. Oper. Res. 47 974-976.
22. Gluss, B. 1961. The minmax path in the search for a circle in the plane. Naval Res. Logist. Quart. 8 357-360.
23. Goemans, M. X., J. Kleinberg. 1996. An improved approximation ratio for the minimum latency problem. In Proc. 7th ACM-SIAM Symposium on Discrete Algorithms 152-158.
24. Healey, T. 1997. Journeys (sometimes) end in lovers meeting. Ann. Improbable Res. 3 26-27.
25. Howard, J. V. 1999. Rendezvous search on the interval and the circle. Oper. Res. 47 550-558.
26. Lim, W. S., S. Alpern. 1996. Minimax rendezvous search on the line. SIAM J. Control Optimiz. 34 1650-1665.
27. _, _. 1997. Minimax triple rendezvous on the line: corrections and extensions. Technical Report. London School of Economics.
28. _, _, A. Beck. 1997. Rendezvous search on the line with more than two players. Oper. Res. 45 357-364.
29. Mitchell, J. S. B. 1999. Guillotine subdivisions approximate polygonal subdivisions: II-A simple polynomial-time approximation scheme for geometric k-MST, TSP, and related problems. SIAM J. Comput. 24 1298-1309.
30. Mosteller, F. 1963. Fifty Challenging Problems in Probability with Solutions. Addison-Wesley, New York.
31. Schelling, T. C. 1960. The Strategy of Conflict. Oxford University Press, Oxford.
32. Thomas, L. C., P. B. Hulme. 1997. Searching for targets who want to be found. J. Oper. Res. Soc. 48 44-50.
33. Troutman, J. L. 1983. Variational Calculus with Elementary Convexity. Springer-Verlag, New York.