Searching for a mobile intruder in a polygonal region
SIAM Journal on Computing
Asymmetric rendezvous on the plane
Proceedings of the fourteenth annual symposium on Computational geometry
Solution of David Gale's lion and man problem
Theoretical Computer Science
Competitive on-line switching policies
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized Pursuit-Evasion in Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Tracking under the nonholonomic constraint using cubic navigation laws
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Bounds for cops and robber pursuit
Computational Geometry: Theory and Applications
Sweeping a terrain by collaborative aerial vehicles
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
We consider a game between two persons where one person tries to chase the other, but the pursuer only knows an approximation of the true position of the fleeing person. The two players have identical constraints on their speed. It turns out that the fugitive can increase his distance from the pursuer beyond any limit. However, when the speed constraints are given by a polyhedral metric, the pursuer can always remain within a constant distance of the other person.We apply this problem to buffer minimization in an online scheduling problem with conflicts.