Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 9 of 9 for “"lossless convexification"”.

  1. Lossless convexification of optimal control problems

    … and optimal control theory. It then proves lossless convexification for three problems: 1) a minimum time rendezvous using differential drag, 2) a maximum divert and landing, and 3) a general optimal control problem with linear state constraints and mixed convex and non-convex control …

    texas Repository record for Lossless convexification of optimal control problems (opens in a new tab)

  2. Lossless convexification of quadrotor motion planning with experiments

    … The proposed method is based on a novel lossless convexication, which was first introduced in (12), that allows convex representations of many non-convex control constraints, such as that of the quadrotors. The second contribution of this thesis is to include two separate methods to …

    texas Repository record for Lossless convexification of quadrotor motion planning with experiments (opens in a new tab)

  3. Real-time Optimization in Aerospace Systems

    … recent result from optimal control theory called lossless convexification, whereby problems with non-convex control constraints are cast into equivalent convex ones. Convex optimization is then applied to all stages of a mission: from top level vehicle design, to high-level autonomy onboard the …

    washington Repository record for Real-time Optimization in Aerospace Systems (opens in a new tab)

  4. Verification of successive convexification algorithm

    … drag, and free final time. Through the use of lossless convexification and successive convexification, this problem can be formulated as a series of iteratively solved convex problems that requires only a guess of a final time of flight. The solution’s physical feasibility is verified through a …

    texas Repository record for Verification of successive convexification algorithm (opens in a new tab)

  5. Fast and Resilient Optimization-based Control with Spacecraft Applications

    … (3-DoF) rocket landing with lossless convexification. Furthermore, we develop optimization-based closed-loop control strategies specialized to spacecraft applications in the cislunar space, such as station keeping, autonomous optical navigation, and passively-safe rendezvous …

    washington Repository record for Fast and Resilient Optimization-based Control with Spacecraft Applications (opens in a new tab)

  6. Convex Optimization in a Nonconvex World: Applications for Aerospace Systems

    … feedforward trajectories of hybrid systems using lossless convexification. Applications are shown for spacecraft rendezvous and for rocket landing. Finally, Chapter 7 considers an iterative method to solve even more difficult hybrid system problems. This method is based on the methodologies of …

    washington Repository record for Convex Optimization in a Nonconvex World: Applications for Aerospace Systems (opens in a new tab)

  7. Autonomous optimal trajectory design employing convex optimization for powered descent on an asteroid

    … solution of the original problem, referred to as lossless convexification. A key finding is that this holds for all levels of gravity model fidelity. The designed thrust magnitude profiles were the bang-bang predicted by Optimal Control Theory.</p> <p>The first high fidelity gravity model employed …

    iastate Repository record for Autonomous optimal trajectory design employing convex optimization for powered descent on an asteroid (opens in a new tab)

  8. Modeling and Algorithms for Nonconvex TrajectoryGeneration Problems: From Constraint Reformulations and First-Order Proximal Methods to Structure-Exploiting Convex Solvers

    … lower bounds, a setting where a method known as Lossless Convexification (LCvx) has been widely adopted in applications due to its empirical effectiveness. LCvx addresses this challenge by relaxing the original nonconvex problem as a convex optimization problem whose solution, under certain …

    washington Repository record for Modeling and Algorithms for Nonconvex TrajectoryGeneration Problems: From Constraint Reformulations and First-Order Proximal Methods to Structure-Exploiting Convex Solvers (opens in a new tab)

  9. Exact and Approximate Relaxation Techniques for Computational Guidance

    The focus of this dissertation is in the development and application of relaxation techniques that enable efficient and real-time solution of complex computational guidance problems. Relaxations transform a non-convex constraint into a convex constraint and provides proof that the optimal solutions …

    utahstate Repository record for Exact and Approximate Relaxation Techniques for Computational Guidance (opens in a new tab)