Trajectory generation for the unicycle model using semidefinite relaxations
From MaRDI portal
Publication:6652228
Recommendations
- Global optimization of polynomial-expressed nonlinear optimal control problems with semidefinite programming relaxation
- Semi-definite relaxations for optimal control problems with oscillation and concentration effects
- Semidefinite relaxations of dynamical programs under discrete constraints
- Convex relaxations for mixed integer predictive control
- Is time-optimal speed planning under jerk constraints a convex problem?
Cites work
- scientific article; zbMATH DE number 46151 (Why is no real title available?)
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- scientific article; zbMATH DE number 2217787 (Why is no real title available?)
- An approach to obtaining global extremums in polynomial mathematical programming problems
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Exploiting constant trace property in large-scale polynomial optimization
- Global optimization with polynomials and the problem of moments
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
- Partial differential equations. An introduction to analytical and numerical methods. Translated from the German by James B. Kennedy
- Probability theory. Translated from the German by Robert B. Burckel
- Relaxation of optimal control problems to equivalent convex programs
- Semidefinite programming relaxations for semialgebraic problems
- Theoretical Numerical Analysis
This page was built for publication: Trajectory generation for the unicycle model using semidefinite relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652228)