Indirect Optimization of Multi-Phase Trajectories Involving Arbitrary Discrete Logic
Harish Saranathan

TL;DR
This paper introduces the GRASHS method, extending previous hybrid system optimization techniques to handle arbitrary discrete logic in multi-phase aerospace trajectories, simplifying the necessary conditions for optimality.
Contribution
The paper develops the GRASHS approach, enabling indirect optimization of multi-phase trajectories with complex boolean logic, including AND and OR conditions, transforming boundary value problems into simpler forms.
Findings
Successfully optimized a Mars entry, descent, and landing trajectory with complex logic.
Demonstrated the transformation of necessary conditions into a two-point boundary value problem.
Extended the applicability of hybrid system optimization to arbitrary discrete logic.
Abstract
Multi-phase trajectories of aerospace vehicle systems involve multiple flight segments whose transitions may be triggered by boolean logic in continuous state variables, control and time. When the boolean logic is represented using only states and/or time, such systems are termed autonomously switched hybrid systems. The relaxed autonomously switched hybrid system approach (RASHS) was previously introduced to simplify the trajectory optimization process of such systems in the indirect framework when the boolean logic is solely represented using AND operations. This investigation enables cases involving arbitrary discrete logic. The new approach is termed the Generalized Relaxed Autonomously Switched Hybrid System (GRASHS) approach. Similar to the RASHS approach, the outcome of the GRASHS approach is the transformation of the necessary conditions of optimality from a multi-point boundary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms
