首页> 外文会议>AIAA guidance, navigation, and control conference;AIAA SciTech forum >Dynamic Re-Plan of the Loyal Wingman Optimal Control Problem
【24h】

Dynamic Re-Plan of the Loyal Wingman Optimal Control Problem

机译:忠诚Wingman最优控制问题的动态重计划

获取原文

摘要

As researchers strive to achieve autonomy in systems, many believe the goal is not that machines should attain full autonomy, but rather to obtain the right level of autonomy for an appropriate man-machine interaction. A common phrase for this interaction is manned-unmanned teaming, a subset of which, for unmanned aerial vehicles, is the concept of the loyal wingman. Previous works established a definition and candidate scenario, demonstrated a methodology, formulated the optimal control problem, and developed dynamic and measurement update models for avoiding moving, stochastic threats. The work herein extends upon previous work by formulating the optimal control problem for a scenario more consistent with manned-unmanned teaming. Additional technical information is provided for appropriately modeling the moving, stochastic threats and a critical distance metric is developed to recommend when the loyal wingman's optimal path should be updated, using speed and stochastics of the moving threat as well as relative distance and angle of approach of the loyal wingman to the threat. These techniques are demonstrated through simulation for computing the global outer-loop optimal path for a minimum time rendezvous with a manned lead while avoiding static as well as moving, non-deterministic threats, then updating the global outer-loop optimal path based on changes in the threat mission environment Results demonstrate a methodology for rapidly computing an optimal solution to the loyal wingman optimal control problem.
机译:随着研究人员努力实现系统中的自主权,许多人认为,目标不是机器应该达到完全自主权,而是为了获得适当的人机交互来获得适当的自主权。这种互动的常见短语是有人携带的互动的合作,这是一个用于无人的空中车辆的子集是忠诚翼曼的概念。以前的作品建立了一个定义和候选方案,证明了一种方法,制定了最佳控制问题,并开发了动态和测量更新模型,以避免移动,随机威胁。这里的工作通过制定与载人无人组合更符合的方案的最佳控制问题,在以前的工作方面延伸。提供了额外的技术信息,用于适当地建模移动,随机威胁和临界距离度量,以推荐在忠诚的Wingman的最佳路径应该更新,使用移动威胁的速度和随机以及相对距离和方法角度忠诚的僚机对威胁。通过模拟来证明这些技术,用于计算全局外环最佳路径,用于使用载有载有载有载物的最小时间集合,同时避免静态以及移动,非确定性威胁,然后根据更改更新全局外环最佳路径威胁使命环境结果表明了一种快速计算忠诚僚机最优控制问题的最佳解决方案的方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号