Trajectory generation for the unicycle model using semidefinite relaxations
From MaRDI portal
Publication:6652228
DOI10.1016/j.ejcon.2024.101063MaRDI QIDQ6652228
Dennis Gramlich, Hannah Häring, Christian Ebenbauer, Carsten W. Scherer
Publication date: 12 December 2024
Published in: European Journal of Control (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relaxation of optimal control problems to equivalent convex programs
- Probability theory. Translated from the German by Robert B. Burckel
- Semidefinite programming relaxations for semialgebraic problems
- Global Optimization with Polynomials and the Problem of Moments
- Theoretical Numerical Analysis
- An approach to obtaining global extremums in polynomial mathematical programming problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Partial Differential Equations
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
- Exploiting constant trace property in large-scale polynomial optimization
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
This page was built for publication: Trajectory generation for the unicycle model using semidefinite relaxations