Sensor and Robotic Networks
Geometric and algorithmic foundations for reasoning about distributed sensor data, fundamental limits of minimal sensor networks, pursuit-evasion and shortest path algorithms.
Projects
- Dynamic Routing and Robotic Coordination
- Minimalist Mapping and Monitoring
Recent Publications
-
Tight Bounds for Conflict-free Chromatic Guarding of Orthogonal Art Galleries
Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek and Max Wilbert.
31st Annual Symposium on Computational Geometry (SoCG '15) , Eindhoven, The Netherlands, June 22-25, 2015. -
Space Exploration via Proximity Search
Sariel Har-Peled, Nirman Kumar, David Mount and Benjamin Raichel.
31st Annual Symposium on Computational Geometry (SoCG '15) , Eindhoven, The Netherlands, June 22-25, 2015. -
Geometric K Shortest Paths.
Sylvester Eriksson-Bique, John Hershberger, Valentin Polishchuk, Bettina Speckmann, Subhash Suri, Topi Talvitie, Kevin Verbeek and Hakan Yıldız.
26nd ACM SODA '15, San Diego, CA, Jan 4-6, 2015. -
Capture bounds for Visibility-Based Pursuit Evasion.
Kyle Klein and Subhash Suri.
Computational Geometry: Theory and Applications, accepted for publication, 2015. -
Trackability with Imprecise Localization.
Kyle Klein and Subhash Suri.
11th International Workshop on the Algorithmic Foundations of Robotics (WAFR '14), Istanbul, Turkey, August 3 - 5, 2014. -
K-Capture in Multiagent Pursuit Evasion, or the Lion and the Hyenas.
Shaunak Bopardikar and Subhash Suri.
Theoretical Computer Science (TCS), 2014.