Maximum divert for planetary landing using convex optimization
DOI10.1007/S10957-013-0501-7zbMATH Open1301.49109OpenAlexW2054414215MaRDI QIDQ463013FDOQ463013
Authors: Matthew W. Harris, Behçet Açıkmeşe 
Publication date: 23 October 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0501-7
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
Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Optimality conditions for problems involving ordinary differential equations (49K15) Applications of optimal control and differential games (49N90)
Cites Work
- CVXGEN: a code generator for embedded convex optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semidefinite Programming
- Graph implementations for nonsmooth convex programs
- Title not available (Why is that?)
- A Survey of the Maximum Principles for Optimal Control Problems with State Constraints
- Title not available (Why is that?)
- Lossless convexification of a class of optimal control problems with non-convex control constraints
- Conversion of Optimal Control Problems into Parameter Optimization Problems
- New necessary conditions of optimality for control problems with state- variable inequality constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- The equivalence of some necessary conditions for optimal control in problems with bounded state variables
- On control problems with bounded state variables
- A transformation of partially singular trajectories to state constrained arcs
- OPTIMAL PROGRAMMING PROBLEMS WITH INEQUALITY CONSTRAINTS
- Title not available (Why is that?)
- Optimal programming problems with a bounded state space.
- Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
- Optimal guidance for quasi-planar lunar ascent
Cited In (9)
- Reachable set computation of linear systems with nonconvex constraints via convex optimization
- Rapid smooth entry trajectory planning for high lift/drag hypersonic glide vehicles
- Glider routing and trajectory optimisation in disaster assessment
- A convex approach to trajectory optimization for boost back of vertical take-off/vertical landing reusable launch vehicles
- Autonomous trajectory planning for space vehicles with a Newton-Kantorovich/convex programming approach
- Lossless convexification of optimal control problems with annular control constraints
- Strong observability as a sufficient condition for non-singularity and lossless convexification in optimal control with mixed constraints
- Abnormal and singular solutions in the target guarding problem with dynamics
- Active fault diagnosis for stochastic systems subject to non-convex input constraints
Uses Software
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)
