Pages that link to "Item:Q2407231"
From MaRDI portal
The following pages link to An optimal complexity algorithm for minimum-time velocity planning (Q2407231):
Displaying 13 items.
- Minimum-time travel for a vehicle with acceleration limits: Theoretical analysis and receding-horizon implementation (Q939119) (← links)
- An exact algorithm for kinodynamic planning in the plane (Q1176323) (← links)
- Semi-analytical minimum time solutions with velocity constraints for trajectory following of vehicles (Q1678602) (← links)
- Time-optimal velocity planning by a bound-tightening technique (Q1753068) (← links)
- Shortest path with acceleration constraints: complexity and approximation algorithms (Q2082550) (← links)
- A solution of the minimum-time speed planning problem based on lattice theory (Q2198659) (← links)
- Convergence analysis of spatial-sampling-based algorithms for time-optimal smooth velocity planning (Q2302843) (← links)
- Graph-based algorithms for the efficient solution of optimization problems involving monotone functions (Q2419542) (← links)
- FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION (Q3427990) (← links)
- (Q3489497) (← links)
- Minimum-time velocity profile planning for planar motion considering velocity, acceleration and jerk constraints (Q6040982) (← links)
- A curvature-segmentation-based minimum time algorithm for autonomous vehicle velocity planning (Q6086281) (← links)
- Is time-optimal speed planning under jerk constraints a convex problem? (Q6605997) (← links)
