An enlarged polygon method without binary variables for obstacle avoidance trajectory optimization

查看全文 作　　者：Rouhe [1]ZHANG;Zihan [1]XIE;Changzhu [1]WEI;Naigang [1]CUI

机构地区：[1]School of Astronautics,Harbin Institute of Technology,Harbin 150090,China

出　　处：《Chinese Journal of Aeronautics》索引2023年第36卷第8期,共14页

基　　金：supported by the National Natural Science Foundation of China(No.52232014);the National Natural Science Foundation of China Joint Fund(No.U2241215)。 摘　　要：In this article,an Enlarged Polygon/Polyhedron(ELP)method without binary variables is proposed to represent the Convex Polygonal/Polyhedral Obstacle Avoidance(CPOA)constraints in trajectory optimization.First,the equivalent condition of a point outside the convex set is given and proved rigorously.Then,the ELP condition describing the CPOA constraints equivalently is given without introducing binary variables,and its geometric meaning is explained.Finally,the ELP method is used to transform the CPOA trajectory optimization problem into an optimal control problem without binary variables.The effectiveness and validity of ELP method are demonstrated through simulations with both simple linear dynamic model(unmanned aerial vehicle)and complex nonlinear dynamic model(hypersonic glide vehicle).Comparison indicates the computational time of ELP method is only 1%-20%of that of the traditional Mixed-Integer Programming(MIP)method. 关键词：Enlarged polygon method Hypersonicglidevehicles Mixed-integer programming No-fly zone Obstacle avoidance Trajectoryoptimization Unmanned aerial vehicles

相关文献

参考文献（39）
引证文献（2）
耦合文献（0）

参考文献(39)

引证文献(2)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

An enlarged polygon method without binary variables for obstacle avoidance trajectory optimization

参考文献(39)

引证文献(2)

用户提示