作者: Chengchao Bai , Jifeng Guo , Hongxing Zheng
DOI: 10.1109/TAES.2019.2955785
关键词: Obstacle 、 Linearization 、 Convex relaxation 、 Mathematical optimization 、 Sensitivity (control systems) 、 Trajectory 、 Convex function 、 Convex optimization 、 Obstacle avoidance 、 Regular polygon 、 Computer science
摘要: In this article, a minimum-fuel powered-descent optimal guidance algorithm that incorporates obstacle avoidance is presented. The approach based on convex optimization includes the obstacles using nonconvex functions. To convert these constraints to ones, simple linearization procedure employed. It proved solution of relaxation problem also for original one. sensitivity multiobstacle method factor and its effectiveness under different conditions are investigated through simulations.