2 papers
cs.RO2026
Optimal Kinodynamic Motion Planning Through Anytime Bidirectional Heuristic Search with Tight Termination Condition
Yi Wang, Bingxian Mu, Shahab Shokouhi +1
This paper introduces Bidirectional Tight Informed Trees (BTIT*), an asymptotically optimal kinodynamic sampling-based motion planning algorithm that integrates an anytime bidirect…
cs.RO2024
Asymptotically Optimal Sampling-Based Path Planning Using Bidirectional Guidance Heuristic
Yi Wang, Bingxian Mu
This paper introduces Bidirectional Guidance Informed Trees (BIGIT*),~a new asymptotically optimal sampling-based motion planning algorithm. Capitalizing on the strengths of \emph{…