• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Robotics and Autonomous Systems >A game-theoretic approach to non-cooperative target assignment
【24h】

A game-theoretic approach to non-cooperative target assignment

机译：非合作目标分配的博弈论方法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, we have adopted a game-theoretic approach to consider the optimal assignment of targets to vehicles. We have taken optimality to mean the minimum sum of costs which are proportional to the Euclidean distance between a vehicle and its assigned target; this occurs when the set of targets is assigned to their nearest vehicles. In other words, each vehicle should assign itself to a target located within the Voronoi region associated with the vehicle. Standard schemes require communication between vehicles at least to rank the targets according to the nearest-neighbour rule. In our proposed model, there is no need for communication among the vehicles, and only limited communication between the targets and the vehicles is required. Specifically, we have introduced an appropriate utility function which depends on the distance between the vehicles and targets and the number of vehicles engaging a particular target. The vehicles negotiate their choice of targets via regret matching. We present simulations which demonstrate that vehicles select targets that fall within their Voronoi region. Vehicles that do not have any targets within their Voronoi region select their nearest unassigned target. We also present a communication model illustrating how the model can be implemented in a practical scenario.
机译：在本文中，我们采用了博弈论的方法来考虑目标对车辆的最佳分配。我们采用最优来表示与车辆与其指定目标之间的欧几里得距离成比例的最小成本总和;当将目标集分配给最近的车辆时，会发生这种情况。换句话说，每辆车应将自己分配给与该车关联的Voronoi区域内的目标。标准方案要求车辆之间的通信至少要根据最近邻居规则对目标进行排名。在我们提出的模型中，不需要在车辆之间进行通信，而仅需要在目标和车辆之间进行有限的通信。具体来说，我们引入了一种适当的效用函数，该函数取决于车辆与目标之间的距离以及与特定目标接合的车辆数量。车辆通过遗憾匹配来协商目标的选择。我们提供的模拟结果表明，车辆选择的目标属于其Voronoi地区。在Voronoi区域内没有任何目标的车辆会选择其最近的未分配目标。我们还提供了一个通信模型，该模型说明了如何在实际情况下实现该模型。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号