论文标题

对轨迹路径计划的深度强化学习和资源受限无人机群的分布推断

Deep Reinforcement Learning for Trajectory Path Planning and Distributed Inference in Resource-Constrained UAV Swarms

论文作者

Dhuheir, Marwan, Baccour, Emna, Erbad, Aiman, Al-Obaidi, Sinan Sabeeh, Hamdi, Mounir

论文摘要

无人驾驶汽车(UAV)的部署灵活性和可操作性增加了其在各种应用中的采用,例如野火跟踪,边界监控等。在许多关键应用中,无人机捕获图像和其他感觉数据,然后将捕获的数据发送到远程服务器,以进行推理和数据处理任务。但是,由于连接不稳定性,有限的带宽和端到端延迟,这种方法在实时应用中并不总是实用的。一个有希望的解决方案是将推理请求分为多个部分(层或段),每个部分根据可用资源在不同的无人机中执行。 此外,某些应用要求无人机穿越某些区域并捕获事件。因此,规划他们的道路尤其变得至关重要,以减少制定协作推理过程的延迟。具体而言,规划无人机轨迹可以通过与相同接近的设备进行通信,同时缓解传输干扰,从而减少数据传输潜伏期。 这项工作旨在设计一个模型,用于分布式协作推理请求和无人机群中的路径计划,同时由于推理请求的计算负载和内存使用量,尊重资源约束。该模型被称为优化问题,旨在最大程度地减少延迟。配方的问题是NP-固定的,因此找到最佳解决方案非常复杂。因此,本文使用深入的强化学习介绍了用于在线应用程序的实时和动态解决方案。我们进行了广泛的模拟,并将结果与​​状态研究进行比较,表明我们的模型表现优于竞争模型。

The deployment flexibility and maneuverability of Unmanned Aerial Vehicles (UAVs) increased their adoption in various applications, such as wildfire tracking, border monitoring, etc. In many critical applications, UAVs capture images and other sensory data and then send the captured data to remote servers for inference and data processing tasks. However, this approach is not always practical in real-time applications due to the connection instability, limited bandwidth, and end-to-end latency. One promising solution is to divide the inference requests into multiple parts (layers or segments), with each part being executed in a different UAV based on the available resources. Furthermore, some applications require the UAVs to traverse certain areas and capture incidents; thus, planning their paths becomes critical particularly, to reduce the latency of making the collaborative inference process. Specifically, planning the UAVs trajectory can reduce the data transmission latency by communicating with devices in the same proximity while mitigating the transmission interference. This work aims to design a model for distributed collaborative inference requests and path planning in a UAV swarm while respecting the resource constraints due to the computational load and memory usage of the inference requests. The model is formulated as an optimization problem and aims to minimize latency. The formulated problem is NP-hard so finding the optimal solution is quite complex; thus, this paper introduces a real-time and dynamic solution for online applications using deep reinforcement learning. We conduct extensive simulations and compare our results to the-state-of-the-art studies demonstrating that our model outperforms the competing models.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源