Henk Meijer
Papers
1
Total Citations
10
H-Index
1
About
Henk Meijer is a leading figure in computational geometry and swarm robotics, best known for his pioneering work on coordinated motion planning for multi-robot systems. His research focuses on developing efficient algorithms for reconfiguring dense swarms of labeled robots, where each robot must navigate from a start to a destination while minimizing execution time and maintaining bounded stretch—a measure of path deviation. In his highly cited 2019 paper, Meijer introduced constant-factor approximation algorithms that enable parallel motion planning on square grids without obstacles, achieving near-optimal coordination even in congested environments. This work has garnered over 10 citations and is foundational for applications in warehouse automation, drone swarms, and modular robotics. Beyond motion planning, Meijer has contributed to geometric optimization and graph algorithms, with his research consistently bridging theory and practice. His achievements include publishing in top-tier venues like *Algorithmica* and *Journal of Discrete Algorithms*, and his algorithms are celebrated for their elegance and provable guarantees. For students and researchers, Meijer’s work exemplifies how theoretical computer science can solve real-world coordination challenges, making him a key reference in the growing field of swarm intelligence.
Research Focus
Key Achievements
Top Papers
- 1