Maximum divert for planetary landing using convex optimization
From MaRDI portal
Recommendations
- A convex approach to trajectory optimization for boost back of vertical take-off/vertical landing reusable launch vehicles
- Lossless convexification of a class of optimal control problems with non-convex control constraints
- Structure of optimal control for planetary landing with control and state constraints
- Lossless convexification of control constraints for a class of nonlinear optimal control problems
- Autonomous trajectory planning for space vehicles with a Newton-Kantorovich/convex programming approach
Cites work
- scientific article; zbMATH DE number 1001723 (Why is no real title available?)
- scientific article; zbMATH DE number 3168463 (Why is no real title available?)
- scientific article; zbMATH DE number 1218596 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3249166 (Why is no real title available?)
- scientific article; zbMATH DE number 3191476 (Why is no real title available?)
- A Survey of the Maximum Principles for Optimal Control Problems with State Constraints
- A transformation of partially singular trajectories to state constrained arcs
- CVXGEN: a code generator for embedded convex optimization
- Conversion of Optimal Control Problems into Parameter Optimization Problems
- Graph implementations for nonsmooth convex programs
- Lossless convexification of a class of optimal control problems with non-convex control constraints
- New necessary conditions of optimality for control problems with state- variable inequality constraints
- OPTIMAL PROGRAMMING PROBLEMS WITH INEQUALITY CONSTRAINTS
- On control problems with bounded state variables
- Optimal guidance for quasi-planar lunar ascent
- Optimal programming problems with a bounded state space.
- Semidefinite Programming
- Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
- The equivalence of some necessary conditions for optimal control in problems with bounded state variables
Cited in
(9)- A convex approach to trajectory optimization for boost back of vertical take-off/vertical landing reusable launch vehicles
- Abnormal and singular solutions in the target guarding problem with dynamics
- Rapid smooth entry trajectory planning for high lift/drag hypersonic glide vehicles
- Active fault diagnosis for stochastic systems subject to non-convex input constraints
- Autonomous trajectory planning for space vehicles with a Newton-Kantorovich/convex programming approach
- Lossless convexification of optimal control problems with annular control constraints
- Reachable set computation of linear systems with nonconvex constraints via convex optimization
- Strong observability as a sufficient condition for non-singularity and lossless convexification in optimal control with mixed constraints
- Glider routing and trajectory optimisation in disaster assessment
This page was built for publication: Maximum divert for planetary landing using convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463013)
