检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:雷刚 罗炜 李云舒 赖灿辉 LEI Gang;LUO Wei;LI Yunshu;LAI Canhui(Operational Support College,Rocket Force University of Engineering,Xi’an 710025,China)
机构地区:[1]火箭军工程大学作战保障学院,西安710025
出 处:《航空学报》2023年第15期371-386,共16页Acta Aeronautica et Astronautica Sinica
摘 要:针对高超声速滑翔飞行器航迹规划中面临的复杂环境约束问题,提出了一种结合几何-动力学的航路点跟踪方法并设计了一种禁飞区约束简化策略。首先,在通过飞行走廊确定飞行过程中航向角变化范围的基础上,以角度为指标设计代价函数,并基于此对飞行状态进行预测寻优,得到了倾侧角自适应搜索的横向机动模型;其次,将几何平面上的虚拟航路点生成策略拓展到地球曲面,并基于图论思想和动力学评估模型,获得了全局最佳虚拟航路点生成策略;最后,将2种方法结合得到解决多禁飞区约束的航迹规划方法。仿真结果表明,所提方法能够快速有效获得最佳虚拟航路点,并且降低航迹规划中的倾侧角优化难度;蒙特卡洛仿真实验表明,本方法具有较好的鲁棒性。A waypoint tracking approach combined with geometric dynamics and a simplified strategy for no-fly zone constraints are proposed to address the complex environmental constraints in the trajectory planning of hypersonic glide vehicles.Firstly,based on the variation range of heading angle during flight determined through a flight corridor,a cost function is designed using angles as the index,and the flight state is predicted through optimization to obtain the lateral maneuver model of bank angle adaptive search.Secondly,the strategy of generating virtual waypoints on the geometric plane is extended to the Earth’s surface,and a generation strategy of global optimal virtual waypoint is de⁃rived based on graph theory and dynamic evaluation models.Finally,the two methods are combined to obtain a tra⁃jectory planning method that can handle multiple no-fly zone constraints.Simulation results show that the proposed method can quickly and effectively acquire the optimal virtual waypoint and reduce the difficulty in optimizing the bank angle during trajectory planning.Monte Carlo simulation experiments show that this method has good robustness.
关 键 词:高超声速滑翔飞行器 航迹规划 虚拟航路点 约束转化 图论思想
分 类 号:V11[航空宇航科学与技术—人机与环境工程] V448.2
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49