COINTOT, M Jean-Hugues (2023) Résolution de problème de commande optimale par optimisation convexe Application aérospatiale et robotique Thesis, ENSTA.
![]()
| PDF 1100Kb |
Abstract
Today, autonomous systems are being called upon to carry out increasingly complex missions. Orbital rendezvous, Martian landers, and trajectory generation under constraints are just a few examples, and their objectives are equally diverse. Convex optimization is one of the methods that can be used to solve these problems, using minimal computational power while ensuring algorithm convergence. In this study, we will focus on the various steps of this method and its application to real-world problems such as the Martian lander.
Item Type: | Thesis (Thesis) |
---|---|
Additional Information: | Rapport d'alternance - Année scolaire : 2022/2023 |
Uncontrolled Keywords: | Convex optimization, Aerospace, Lander, Robotics |
Subjects: | Mathematics and Applications |
ID Code: | 9948 |
Deposited By: | Jean-hugues Cointot |
Deposited On: | 30 juill. 2024 14:00 |
Dernière modification: | 30 juill. 2024 14:00 |
Repository Staff Only: item control page