The role of information in the cop-robber game
Theoretical Computer Science
Adaptive Kanerva-based function approximation for multi-agent systems
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Vision-Based Pursuit-Evasion in a Grid
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Adaptive Fuzzy Function Approximation for Multi-agent Reinforcement Learning
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
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
Agent-based coordination of human-multirobot teams in complex environments
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: Industry track
The complexity of grid coverage by swarm robotics
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Vision-Based Pursuit-Evasion in a Grid
SIAM Journal on Discrete Mathematics
Static and expanding grid coverage with ant robots: Complexity results
Theoretical Computer Science
Multi-agent Cooperative Cleaning of Expanding Domains
International Journal of Robotics Research
Search and pursuit-evasion in mobile robotics
Autonomous Robots
Cop and Robber Games When the Robber Can Hide and Ride
SIAM Journal on Discrete Mathematics
Variations on Cops and Robbers
Journal of Graph Theory
Capturing an evader in polygonal environments with obstacles: The full visibility case
International Journal of Robotics Research
Locating a robber on a graph via distance queries
Theoretical Computer Science
| Hi-index | 0.00 |
We study the following pursuit-evasion game: One or more hunters are seeking to capture an evading rabbit on a graph. At each round, the rabbit tries to gather information about the location of the hunters but it can see them only if they are located on adjacent nodes. We show that two hunters suffice for catching rabbits with such local visibility with high probability. We distinguish between reactive rabbits who move only when a hunter is visible and general rabbits who can employ more sophisticated strategies. We present polynomial time algorithms that decide whether a graph $G$ is hunter-win, that is, if a single hunter can capture a rabbit of either kind on $G$.