Lossless Convexification of Nonconvex Control Bound and Pointing Constraints of the Soft Landing Optimal Control Problem

@article{Aikmese2013LosslessCO,
  title={Lossless Convexification of Nonconvex Control Bound and Pointing Constraints of the Soft Landing Optimal Control Problem},
  author={Behçet Açikmese and J. Carson and L. Blackmore},
  journal={IEEE Transactions on Control Systems Technology},
  year={2013},
  volume={21},
  pages={2104-2113}
}
Planetary soft landing is one of the benchmark problems of optimal control theory and is gaining renewed interest due to the increased focus on the exploration of planets in the solar system, such as Mars. The soft landing problem with all relevant constraints can be posed as a finite-horizon optimal control problem with state and control constraints. The real-time generation of fuel-optimal paths to a prescribed location on a planet's surface is a challenging problem due to the constraints on… Expand
Lossless Convexification of Optimal Control Problems with Semi-continuous Inputs
TLDR
This paper is the first to allow individual input sets to overlap and to have different norm bounds, integral input and state costs, and convex state constraints that can be activated at discrete time instances. Expand
Autonomous Trajectory Planning by Convex Optimization
The objective of this dissertation is to use second-order cone programming (SOCP) for autonomous trajectory planning of optimal control problems arisen from aerospace applications. Rendezvous andExpand
Lossless convexification of non-convex optimal control problems with disjoint semi-continuous inputs
TLDR
This paper presents a convex optimization-based method for finding the globally optimal solutions of a class of mixed-integer non-convex optimal control problems, and achieves the first lossless convexification result for mixed- integer optimization problems. Expand
Maximum Divert for Planetary Landing Using Convex Optimization
TLDR
A transformation of variables is introduced in the nonlinear dynamics and an approximation is made so that the problem becomes a second-order cone problem, which can be solved to global optimality in polynomial time whenever a feasible solution exists. Expand
Constrained Reachability and Controllability Sets for Planetary Precision Landing via Convex Optimization
This paper presents a convex optimizations-based method to compute the set of initial conditions from which a given landing accuracy to a target can be achieved (constrained controllability set) andExpand
Successive Convexification of Non-Convex Optimal Control Problems with State Constraints
TLDR
A Successive Convexification algorithm to solve a class of non-convex optimal control problems with certain types of state constraints that is particularly suitable for solving trajectory planning problems with collision avoidance constraints. Expand
Minimum-Fuel Low-Thrust Transfers for Spacecraft: A Convex Approach
TLDR
This paper presents a convex approach to the numerical solution of the minimum-fuel low-thrust orbit transfer problem by introducing a lossless convexification technique, and the original problem is relaxed into a sequence of second-order cone programming problems. Expand
Convexification and Real-Time Optimization for MPC with Aerospace Applications
This chapter gives an overview of recent developments of convexification and real-time convex optimization based control methods, in the context of Model Predictive Control (MPC). LosslessExpand
Robust Trajectory Optimization for Highly Constrained Rendezvous and Proximity Operations
TLDR
A state-of-the-art primal-dual interior-point algorithm is employed to ensure the solutions to the SOCP problems. Expand
Successive convexification of non-convex optimal control problems and its convergence properties
TLDR
Several safe-guarding techniques are incorporated into the algorithm, namely virtual control and trust regions, which add another layer of algorithmic robustness and convergence results will be independent from any numerical schemes used for discretization. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 38 REFERENCES
Lossless convexification of a class of optimal control problems with non-convex control constraints
TLDR
The lossless convexification enables the use of interior point methods of convex optimization to obtain globally optimal solutions of the original non-convex optimal control problem. Expand
Minimum-Landing-Error Powered-Descent Guidance for Mars Landing Using Convex Optimization
TLDR
It is shown that the minimum-landing-error trajectory generation problem can be posed as a convex optimization problem and solved to global optimality with known bounds on convergence time, which makes the approach amenable to onboard implementation for real-time applications. Expand
Lossless convexification of Powered-Descent Guidance with non-convex thrust bound and pointing constraints
A numerically-efficient, convex formulation of PDG (Powered-Descent Guidance) for Mars pinpoint and precision landing has been enhanced to include thrust pointing constraints. The original algorithmExpand
A Comparison of Powered Descent Guidance Laws for Mars Pinpoint Landing.
I. Abstract In this paper, we formulate and compare a number of powered terminal descent guidance algorithms for Mars pinpoint landing (PPL). The PPL guidance problem involves finding a trajectoryExpand
Convex programming approach to powered descent guidance for mars landing
We present a convex programming algorithm for the numerical solution of the minimum fuel powered descent guidance problem associated with Mars pinpoint landing. Our main contribution is theExpand
On the problem of optimal thrust programming for a lunar soft landing
The problem of minimal fuel thrust programming for the terminal phase of a lunar soft landing mission is shown to be equivalent to the minimal time problem for the mission. The existence of anExpand
Quadratically constrained attitude control via semidefinite programming
  • Yongsung Kim, M. Mesbahi
  • Mathematics
  • 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)
  • 2003
We consider the attitude control problem as augmented with an arbitrary number of nonconvex quadratic constraints. By utilizing the implicit magnitude constraint of the state vector (i.e.,Expand
Computationally inexpensive guidance algorithm for fuel-efficient terminal descent
This communication reports on the design of a computationally inexpensive algorithm for the synthesis of control functions for fuel-efficient powered terminal descent of a vehicle. Instead of solvingExpand
Minimum-Fuel Powered Descent for Mars Pinpoint Landing
Motivated by the requirement for pinpoint landing in futureMarsmissions, we consider the problemofminimumfuel powered terminal descent to a prescribed landing site. The first-order necessaryExpand
AN OPTIMAL GUIDANCE LAW FOR PLANETARY LANDING
A guidance law which minimizes the commanded acceleration along with the (weighted) final time is developed. This guidance law is a linear function of the states (relative to the landing point) and aExpand
...
1
2
3
4
...