Performance Analysis of Mars-Powered Descent-Based Landing in a Constrained Optimization Control Framework
Bibliographic record
Abstract
It is imperative to find new places other than Earth for the survival of human beings. Mars could be the alternative to Earth in the future for us to live. In this context, many missions have been performed to examine the planet Mars. For such missions, planetary precision landing is a major challenge for the precise landing on Mars. Mars landing consists of different phases (hypersonic entry, parachute descent, terminal descent comprising gravity turn, and powered descent). However, the focus of this work is the powered descent phase of landing. Firstly, the main objective of this study is to minimize the landing error during the powered descend landing phase. The second objective involves constrained optimization in a predictive control framework for landing at non-cooperative sites. Different control algorithms like PID and LQR have been developed for the stated problem; however, the predictive control algorithm with constraint handling’s ability has not been explored much. This research discusses the Model Predictive Control algorithm for the powered descent phase of landing. Model Predictive Control (MPC) considers input/output constraints in the calculation of the control law and thus it is very useful for the stated problem as shown in the results. The main novelty of this work is the implementation of Explicit MPC, which gives comparatively less computational time than MPC. A comparison is done among MPC variants in terms of feasibility, constraints handling, and computational time. Moreover, other conventional control algorithms like PID and LQR are compared with the proposed predictive algorithm. These control algorithms are implemented on quadrotor UAV (which emulates the dynamics of a planetary lander) to verify the feasibility through simulations in MATLAB.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".