Max Robotics — Global Service Robot Directory + US Certification

About

Daniel Harabor is a prominent researcher in pathfinding, motion planning, and multi-agent systems, whose work has fundamentally shaped how autonomous agents navigate complex environments in robotics, video games, and logistics. He is perhaps best known for developing Jump Point Search (JPS), introduced in his landmark 2011 paper "Online Graph Pruning for Pathfinding On Grid Maps" (376 citations), which revolutionized grid-based pathfinding by achieving optimal solutions with dramatically reduced search effort — without the memory trade-offs of hierarchical methods. His contributions span both single-agent and multi-agent domains: his research on any-angle pathfinding produced the first practical optimal algorithms for finding true Euclidean shortest paths on grid maps, while his multi-agent work tackles sophisticated real-world challenges including warehouse logistics, 3D pipe routing, and traffic flow optimization under capacity constraints. His 2021 paper on Multi-Agent Pickup and Delivery (184 citations) exemplifies his ability to bridge theoretical rigor with industrial relevance. With further contributions in branch-and-cut-and-price methods and resource-constrained shortest path algorithms, Harabor consistently advances the computational frontier of navigation and coordination problems that matter deeply to both academic researchers and practitioners building real autonomous systems.