Research
Optimal Kinodynamic Motion Planning Through Anytime Bidirectional Heuristic Search with Tight Termination Condition
arXiv:2604.11587v1 Announce Type: new Abstract: This paper introduces Bidirectional Tight Informed Trees (BTIT*), an asymptotically optimal kinodynamic sampling-based motion planning algorithm that in
arXiv:2604.11587v1 Announce Type: new Abstract: This paper introduces Bidirectional Tight Informed Trees (BTIT*), an asymptotically optimal kinodynamic sampling-based motion planning algorithm that integrates an anytime bidirectional heuristic search (Bi-HS) and ensures the meet-in-the-middle property (MMP) and optimality (MM-optimality). BTIT* is the first anytime MEET-style algorithm to utilize termination conditions that are efficient to evaluate and enable early termination on-the-fly in batch-wise sampling-based motion planning. Experiments show that BTIT* achieves strongly faster time-to-first-solution and improved convergence than representative non-lazy informed batch planners on two kinodynamic benchmarks: a 4D double-integrator model and a 10D linearized Quadrotor. The source code is available here.
Related
- Informed Hybrid Zonotope-based Motion Planning Algorithm
- One Interface, Many Robots: Unified Real-Time Low-Level Motion Planning for Collaborative Arms
- City-Wide Low-Altitude Urban Air Mobility: A Scalable Global Path Planning Approach via Risk-Aware Multi-Scale Cell Decomposition
- Directional Mollification for Knot-Preserving C^{infty} Smoothing of Polygonal Chains with Explicit Curvature Bounds
Source: arXiv cs.RO | 2026-04-14