Kurt Hungerford
Papers
2
Total Citations
18
H-Index
2
About
Kurt Hungerford is a researcher in multi-robot systems and autonomous coverage path planning, with a focus on enabling teams of robots to efficiently explore and cover unknown environments. His major contributions include the development of a repartitioning algorithm that guarantees complete, non-overlapping planar coverage using multiple robots—a key challenge in applications like search-and-rescue, environmental monitoring, and precision agriculture. His most cited work (2016, 13 citations) introduces a method that ensures full coverage without redundancy, even as robots encounter obstacles in real time. Hungerford’s earlier paper (2014, 5 citations) addresses the problem of distributed coverage in initially unknown environments, proposing a Voronoi-based partitioning approach that allows robots to dynamically adapt their territories as they explore. This work is notable for its theoretical guarantees of completeness and its practical relevance to real-world, decentralized systems. Hungerford’s research bridges the gap between theoretical robotics and field-ready algorithms, offering scalable solutions for multi-robot coordination under uncertainty.
Research Focus
Key Achievements
Top Papers
- 1
- 2