Jonathan D. Gammell

収録論文 22本 ・ フィジカルAI/ロボット学習

※arXiv著者名で収集。同姓同名の別人の論文が含まれる場合があります。

論文

• $\rm{A}^{\rm{SAR}}$: $\varepsilon$-Optimal Graph Search for Minimum Expected-Detection-Time Paths with Path Budget Constraints for Search and Rescue (SAR)
  2025/11/1
• Revisiting Replanning from Scratch: Real-Time Incremental Planning with Fast Almost-Surely Asymptotically Optimal Planners
  2025/10/1
• Nearest-Neighbourless Asymptotically Optimal Motion Planning with Fully Connected Informed Trees (FCIT*)
  2024/11/1
• Osprey: Multi-Session Autonomous Aerial Mapping with LiDAR-based SLAM and Next Best View Planning
  2023/11/1
• Event-based Stereo Visual Odometry with Native Temporal Resolution via Continuous-time Gaussian Process Regression
  2023/6/1
• Task and Motion Informed Trees (TMIT*): Almost-Surely Asymptotically Optimal Integrated Task and Motion Planning
  2022/10/1
• The Surface Edge Explorer (SEE): A measurement-direct approach to next best view planning
  2022/7/1
• Effort Informed Roadmaps (EIRM*): Efficient Asymptotically Optimal Multiquery Planning by Actively Reusing Validation Effort
  2022/5/1
• AIT* and EIT*: Asymmetric bidirectional sampling-based path planning
  2021/11/1
• Multimotion Visual Odometry (MVO)
  2021/10/1
• Admissible heuristics for obstacle clearance optimization objectives
  2021/4/1
• Proactive Estimation of Occlusions and Scene Coverage for Planning Next Best Views in an Unstructured Representation
  2020/9/1
• Asymptotically Optimal Sampling-Based Motion Planning Methods
  2020/9/1
• Advanced BIT* (ABIT*): Sampling-Based Planning with Advanced Graph-Search Techniques
  2020/2/1
• Adaptively Informed Trees (AIT*): Fast Asymptotically Optimal Path Planning through Adaptive Heuristics
  2020/2/1
• Occlusion-Robust MVO: Multimotion Estimation Through Occlusion Via Motion Closure
  2019/5/1
• The Oxford Multimotion Dataset: Multiple SE(3) Motions with Ground Truth
  2019/1/1
• Multimotion Visual Odometry (MVO): Simultaneous Estimation of Camera and Third-Party Motions
  2018/8/1
• Surface Edge Explorer (SEE): Planning Next Best Views Directly from 3D Observations
  2018/2/1
• Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search
  2017/7/1
• Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs
  2014/5/1
• Informed RRT*: Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristic
  2014/4/1