检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]第二炮兵工程学院基础部,陕西西安710025
出 处:《飞行力学》2005年第3期41-44,共4页Flight Dynamics
摘 要:提出了一种基于威胁网的飞行器航迹快速搜索算法。该方法能够在具有未知威胁的飞行环境中在线进行实时航迹规划。首先根据获得的先验信息建立威胁网,其次在建立的威胁网上确定出一条安全走廊,最后在安全走廊的基础上进一步细化从而得到一条最优航迹。当飞行环境中有预先未知威胁出现时,该方法可根据更新后的信息局部修正受影响的航迹来获得新的全局最优航迹。仿真结果表明,该算法能够有效地进行实时规划,获得较满意的航迹。A fast search algorithm for aircraft based on the threat netting is presented, which can be used for on-line path re-planning in flying environment with an unknown threat. Firstly, a threat netting was built from a priori information. Based on it, the safe corridor was determined, and then to completely optimize the path. This approach can obtain the global path by modifying the influenced path using new information acquired whenever an unforeseen threat is perceived. The simulation results demonstrate that this method can complete planning mission efficiently and get a desirable path.
分 类 号:V249.122[航空宇航科学与技术—飞行器设计]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229