About

Jonathan D. Gammell is a leading researcher in robotics and autonomous systems, whose work has fundamentally advanced the field of motion planning. His primary research areas include sampling-based optimal path planning, integrated task and motion planning (TMP), and multimodal perception. Gammell is best known for developing the Batch Informed Trees (BIT*) algorithm (2015, 417 citations), a groundbreaking approach that unifies graph-based and sampling-based planning by recognizing that samples describe an implicit random geometric graph. This work, along with its successors Advanced BIT* (ABIT*) and Adaptively Informed Trees (AIT*), has established new standards for efficiency in optimal path planning, enabling robots to navigate complex environments with unprecedented speed. Beyond planning, Gammell has made significant contributions to dynamic scene understanding through Multimotion Visual Odometry (MVO) and the Oxford Multimotion Dataset, which provide tools for estimating multiple independent motions from visual data. His work on the Surface Edge Explorer (SEE) for next-best-view planning has also advanced autonomous 3D scene surveying. With over 800 total citations and a portfolio of highly influential algorithms, Gammell’s research continues to shape how robots reason about and interact with the world.

Research Focus

Key Achievements

9
H-Index
21
Papers
823
Total Citations
39
Avg Citations/Paper
🏆 Most Cited Paper
Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs
417 citations · 2015
📈 Most Prolific Year: 2020 (3 Papers)
🤝 Key Collaborators: 80
🏛 Institutions: University of Toronto, University of Oxford, Oxford Research Group, Science Oxford, Robotics Research (United States), Queen's University

Top Papers

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 13 days ago