Maximum divert for planetary landing using convex optimization

DOI10.1007/s10957-013-0501-7zbMath1301.49109OpenAlexW2054414215MaRDI QIDQ463013

Behçet Açıkmeşe, Matthew W. Harris

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

zbMATH Keywords

convex optimizationmaximum divertplanetary landing

Mathematics Subject Classification ID

Convex programming (90C25) Applications of optimal control and differential games (49N90) Numerical methods based on nonlinear programming (49M37) Optimality conditions for problems involving ordinary differential equations (49K15)

Related Items (6)

Rapid smooth entry trajectory planning for high lift/drag hypersonic glide vehicles ⋮ 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 ⋮ Abnormal and singular solutions in the target guarding problem with dynamics ⋮ Lossless convexification of optimal control problems with annular control constraints ⋮ Reachable set computation of linear systems with nonconvex constraints via convex optimization

Uses Software

• CVXGEN
• ECOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• CVXGEN: a code generator for embedded convex optimization
• Lossless convexification of a class of optimal control problems with non-convex control constraints
• Optimal guidance for quasi-planar lunar ascent
• The equivalence of some necessary conditions for optimal control in problems with bounded state variables
• New necessary conditions of optimality for control problems with state- variable inequality constraints
• On control problems with bounded state variables
• Graph Implementations for Nonsmooth Convex Programs
• Conversion of Optimal Control Problems into Parameter Optimization Problems
• A transformation of partially singular trajectories to state constrained arcs
• A Survey of the Maximum Principles for Optimal Control Problems with State Constraints
• Semidefinite Programming
• OPTIMAL PROGRAMMING PROBLEMS WITH INEQUALITY CONSTRAINTS
• Optimal programming problems with a bounded state space.
• Sensitivity analysis in linear programming and semidefinite programming using interior-point methods

This page was built for publication: Maximum divert for planetary landing using convex optimization