首页> 外文OA文献 >Task Allocation and Path Planning for Collaborative Autonomous Underwater Vehicles Operating through an Underwater Acoustic Network
【2h】

Task Allocation and Path Planning for Collaborative Autonomous Underwater Vehicles Operating through an Underwater Acoustic Network

机译:通过水下声学网络运行的协同自主水下车辆的任务分配和路径规划

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Dynamic and unstructured multiple cooperative autonomous underwater vehicle (AUV) missions are highly complex operations, and task allocation and path planning are made significantly more challenging under realistic underwater acoustic communication constraints. This paper presents a solution for the task allocation and path planning for multiple AUVs under marginal acoustic communication conditions: a location-aided task allocation framework (LAAF) algorithm for multitarget task assignment and the grid-based multiobjective optimal programming (GMOOP) mathematical model for finding an optimal vehicle command decision given a set of objectives and constraints. Both the LAAF and GMOOP algorithms are well suited in poor acoustic network condition and dynamic environment. Our research is based on an existing mobile ad hoc network underwater acoustic simulator and blind flooding routing protocol. Simulation results demonstrate that the location-aided auction strategy performs significantly better than the well-accepted auction algorithm developed by Bertsekas in terms of task-allocation time and network bandwidth consumption. We also demonstrate that the GMOOP path-planning technique provides an efficient method for executing multiobjective tasks by cooperative agents with limited communication capabilities. This is in contrast to existing multiobjective action selection methods that are limited to networks where constant, reliable communication is assumed to be available.
机译:动态和非结构化的多个合作自主水下车辆(AUV)任务是高度复杂的操作,在现实的水下声学通信约束下,任务分配和路径规划在逼真的水下通信约束下进行了明显挑战。本文介绍了边际声学通信条件下多个AUV的任务分配和路径规划的解决方案:一个位置辅助任务分配框架(LAAF)用于多目标任务分配的算法和基于网格的多目标最佳编程(Gmoop)数学模型给出了一系列目标和约束的最佳车辆命令决定。 LAAF和GMOOP算法都非常适用于声学网络状况差和动态环境。我们的研究基于现有的移动临时网络水下声学模拟器和盲洪路路由协议。仿真结果表明,位置辅助拍卖策略显着优于由Bertsekas开发的良好接受的拍卖算法在任务分配时间和网络带宽消耗方面。我们还证明GMOOP路径规划技术提供了一种有效的方法,用于通过具有有限通信能力的协作代理执行多目标任务。这与现有的多目标动作选择方法相反,该方法限于假设可用的网络,其中可用可靠的通信的网络。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号