(Georgia Institute of Technology, 2011-12)
Kim, Jonghoek; Maxon, Sean; Egerstedt, Magnus B.; Zhang, Fumin
Intruder capturing games on a topological map of a workspace with obstacles are investigated. Assuming that a searcher can access the position of any intruder utilizing information networks, we provide theoretical upper bounds for the minimum number of searchers required to capture all intruders on a Voronoi graph. Intruder capturing algorithms are proposed and demonstrated through an online computer game.