...
首页> 外文期刊>Journal of guidance, control, and dynamics >Sampling-Based Path Planning for a Visual Reconnaissance Unmanned Air Vehicle
【24h】

Sampling-Based Path Planning for a Visual Reconnaissance Unmanned Air Vehicle

机译:视觉侦察无人机的基于采样的路径规划

获取原文
获取原文并翻译 | 示例
           

摘要

This paper considers a path planning problem for a single fixed-wing aircraft performing a reconnaissance mission using one or more electro-optical cameras. The aircraft visual reconnaissance problem for static ground targets in terrain is formulated as a polygon-visiting Dubins traveling salesman problem, a variation of the famous traveling salesman problem. Two algorithms for solving the polygon-visiting Dubins traveling salesman problem are developed. They fall into the class of algorithms known as sampling-based roadmap methods because they operate by sampling a finite set of points from a continuous state space in order to reduce a continuous motion planning problem to planning on a finite discrete graph called a roadmap. Under certain technical assumptions, the algorithms are resolution complete, which means the solution returned provably converges to a global optimum as the number of samples grows. The first algorithm is resolution complete under slightly milder assumptions, but the second algorithm achieves faster computation times by a novel roadmap construction. Numerical experiments indicate that, for up to about 20 targets, both algorithms deh'ver very good solutions suitably quickly for online purposes. Additionally, the algorithms allow tradeoff of computation time for solution quality and are shown to be highly extensible.
机译:本文考虑了使用一台或多台电光相机执行侦察任务的一架固定翼飞机的路径规划问题。用于地形中静态地面目标的飞机视觉侦察问题被公式化为访问杜宾斯的旅行商问题,这是著名的旅行商问题的一种变体。开发了两种求解多边形访问杜宾斯旅行商问题的算法。它们属于称为基于采样的路线图方法的算法类别,因为它们通过从连续状态空间中采样一组有限的点进行操作,从而将连续运动规划问题减少到在称为路线图的有限离散图上进行规划。在某些技术假设下,算法是完整的解析度,这意味着随着样本数量的增长,返回的解决方案可证明收敛到全局最优。第一种算法在稍微温和的假设下即可完成分辨率,但是第二种算法通过新颖的路线图构造实现了更快的计算速度。数值实验表明,对于多达约20个目标,这两种算法都非常适合快速地将其用于在线目的。另外,这些算法允许权衡计算时间以获得解决方案质量,并且显示出高度可扩展性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号