Peter Pietrzyk
Papers
2
Total Citations
94
H-Index
2
About
Peter Pietrzyk is a theoretical computer scientist whose research centers on distributed algorithms, autonomous robotics, and computational geometry. His most influential work addresses the fundamental problem of gathering multiple autonomous robots at a single point in the Euclidean plane, a classic challenge in swarm robotics. In his highly cited 2011 paper, Pietrzyk established a tight runtime bound for synchronous gathering with limited visibility, providing the first rigorous performance guarantee for local algorithms in this setting. This contribution, with 92 citations, has become a cornerstone for researchers studying minimalistic robot coordination under realistic sensor constraints. He has also explored the complexity and approximation of geometric local robot assignment problems, demonstrating the inherent computational challenges in assigning robots to target locations. Pietrzyk's work is notable for bridging theoretical guarantees with practical constraints, offering both lower bounds and efficient algorithmic solutions. His research continues to influence the design of provably correct and efficient distributed systems for multi-robot coordination.
Research Focus
Key Achievements
Top Papers
- 1
- 2