Optimal Guidance for Planetary Landing in Hazardous Terrains

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 l...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on aerospace and electronic systems 2020-08, Vol.56 (4), p.2896-2909
Main Authors: Bai, Chengchao, Guo, Jifeng, Zheng, Hongxing
Format: Article
Language:English
Subjects:
Algorithms
Collision avoidance
Computational geometry
Computer simulation
Convex functions
Convex optimization
Convexity
Fuels
Mars
Mathematical model
multiobstacle avoidance
Obstacle avoidance
optimal guidance
Optimization
Planetary landing
Trajectory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9251
1557-9603
DOI:10.1109/TAES.2019.2955785