Joshua Bialkowski

American Institute of Aeronautics and Astronautics, Massachusetts Institute of Technology

Papers

Total Citations

111

H-Index

About

Joshua Bialkowski’s research lies at the intersection of motion planning, robotics, and high-performance computing, with a focus on enabling faster, more scalable collision checking for single and multi-robot systems. His most influential work, “Massively parallelizing the RRT and the RRT” (2011, 104 citations), addresses the computational bottleneck of sampling-based planners by leveraging Graphics Processing Units (GPUs) to parallelize the Rapidly-exploring Random Tree (RRT) algorithm. This contribution is particularly significant in an era where CPU performance growth has plateaued, while GPU capabilities continue to surge. Bialkowski further advanced the field with his work on “any-com” collision checking, introducing a decentralized approach where teams of robots share “safety-certificates” to distribute collision-checking workloads. He also developed fast collision-checking methods for centralized multi-robot teams, exploiting configuration space symmetries to reduce computational overhead. These innovations directly tackle the scalability challenges of multi-robot coordination, making his research foundational for autonomous systems operating in complex, shared environments. His work is essential reading for roboticists and researchers seeking to push the boundaries of real-time motion planning.