Name
Abstract | ||
|---|---|---|
In this article, a minimum-fuel powered-descent optimal guidance algorithm that incorporates obstacle avoidance is presented. The approach is based on convex optimization that includes the obstacles using nonconvex functions. To convert these nonconvex obstacle constraints to convex ones, a simple linearization procedure is employed. It is proved that the optimal solution of the convex relaxation problem is also optimal for the original nonconvex one. The sensitivity of the multiobstacle avoidance method to the relaxation factor and its effectiveness under different conditions are also investigated through simulations. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/TAES.2019.2955785 | IEEE Transactions on Aerospace and Electronic Systems |
Keywords | DocType | Volume |
Convex optimization,optimal guidance,multiobstacle avoidance,planetary landing | Journal | 56 |
Issue | ISSN | Citations |
4 | 0018-9251 | 1 |
PageRank | References | Authors |
0.37 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chengchao Bai | 1 | 1 | 0.37 |
| Jifeng Guo | 2 | 2 | 2.75 |
| Hongxing Zheng | 3 | 1 | 0.37 |