(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.
(Georgia Institute of Technology, 2010)
Kim, Jonghoek; Zhang, Fumin; Egerstedt, Magnus B.
We present novel exploration algorithms and
a control law that enables the construction of Voronoi
diagrams over unknown areas using a single vehicle
equipped with range sensors. The control law uses range
measurements to make the vehicle track Voronoi edges
between obstacles. The exploration algorithms make
decisions at vertices in the Voronoi diagram to expand
the explored area until a complete Voronoi diagram is
constructed in finite time. Our exploration algorithms
are provably complete, and the convergence of the control
law is guaranteed. Simulations and experimental
results are provided to demonstrate the effectiveness of
both the control law and the exploration algorithms.