Time-optimal velocity planning by a bound-tightening technique
From MaRDI portal
Publication:1753068
DOI10.1007/s10589-017-9978-6zbMath1401.90166OpenAlexW2783211897MaRDI QIDQ1753068
Luca Consolini, Marco Locatelli, Federico Cabassi
Publication date: 25 May 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-017-9978-6
Related Items (3)
Minimum-time velocity profile planning for planar motion considering velocity, acceleration and jerk constraints ⋮ Graph-based algorithms for the efficient solution of optimization problems involving monotone functions ⋮ Convergence analysis of spatial-sampling-based algorithms for time-optimal smooth velocity planning
Cites Work
- Unnamed Item
- Unnamed Item
- Theoretical and computational results about optimality-based domain reductions
- Global optimization for the generalized polynomial sum of ratios problem
- Minimum-time travel for a vehicle with acceleration limits: Theoretical analysis and receding-horizon implementation
- Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint
- Bidimensional packing by bilinear programming
- An analytical approach to global optimization
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- New interval analysis support functions using gradient information in a global minimization algorithm
- Packing equal circles in a square: A deterministic global optimization approach
- Semi-analytical minimum time solutions with velocity constraints for trajectory following of vehicles
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch-and-reduce approach to global optimization
- Global optimization problems and domain reduction strategies
- Convergence analysis of spatial-sampling-based algorithms for time-optimal smooth velocity planning
- An optimal complexity algorithm for minimum-time velocity planning
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
- Branching and bounds tighteningtechniques for non-convex MINLP
- LP-based velocity profile generation for robotic manipulators
- Time-Optimal Path Tracking for Robots: A Convex Optimization Approach
- Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
This page was built for publication: Time-optimal velocity planning by a bound-tightening technique
