...
首页> 外文期刊>Journal of guidance, control, and dynamics >Stochastic and Dynamic Routing Problems for Multiple Uninhabited Aerial Vehicles
【24h】

Stochastic and Dynamic Routing Problems for Multiple Uninhabited Aerial Vehicles

机译:多种无人飞行器的随机和动态路径问题

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

摘要

Consider a routing problem for a team of vehicles in the plane: target points appear randomly over time in a bounded environment and must be visited by one of the vehicles. It is desired to minimize the expected system time for the targets, that is, the expected time elapsed between the appearance of a target point and the instant it is visited. In this paper, such a routing problem is considered for a team of uninha bited aerial vehicles, modeled as vehicles moving with constant forward speed along paths of bounded curvature. Three algorithms are presented, each designed for a distinct set of operating conditions. Each is proven to provide a system time within a constant factor of the optimal when operating under the appropriate conditions. It is shown that the optimal routing policy depends on problem parameters such as the workload per vehicle and the vehicle density in the environment. Finally, there is discussion of a phase transition between two of the policies as the problem parameters are varied. In particular, for the case in which targets appear sporadically, a dimensionless parameter is identified which completely captures this phase transition and an estimate of the critical value of the parameter is provided.
机译:考虑飞机上的一组车辆的路线问题:目标点在有限的环境中随时间随机出现,并且其中一辆必须访问。期望最小化目标的预期系统时间,即,在目标点的出现与到达目标点之间经过的预期时间。在本文中,对于一组无约束咬合的飞行器考虑了这种选路问题,该模型被建模为以有限的曲率路径以恒定的前进速度行驶的飞行器。提出了三种算法,每种算法针对一组不同的运行条件而设计。在适当的条件下运行时,每一个都被证明可以在最佳的恒定因子内提供系统时间。结果表明,最佳路由策略取决于问题参数,例如每辆车的工作量和环境中的车辆密度。最后,讨论了随着问题参数的变化,两个策略之间的相变。特别地,对于目标偶发出现的情况,确定了一个无量纲参数,该参数完全捕获了该相变,并提供了该参数的临界值的估计值。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号