Unmanned Aerial Vehicles (UAVs) have attracted great interest in the last few years owing to their ability to cover large areas and access difficult and hazardous target zones, which is not the case of traditional systems relying on direct observations obtained from fixed cameras and sensors. Furthermore, thanks to the advancements in computer vision and machine learning, UAVs are being adopted for a broad range of solutions and applications. However, Deep Neural Networks (DNNs) are progressing toward deeper and complex models that prevent them from being executed on-board. In this paper, we propose a DNN distribution methodology within UAVs to enable data classification in resource-constrained devices and avoid extra delays introduced by the server-based solutions due to data communication over air-to-ground links. The proposed method is formulated as an optimization problem that aims to minimize the latency between data collection and decision-making while considering the mobility model and the resource constraints of the UAVs as part of the air-to-air communication. We also introduce the mobility prediction to adapt our system to the dynamics of UAVs and the network variation. The simulation conducted to evaluate the performance and benchmark the proposed methods, namely Optimal UAV-based Layer Distribution (OULD) and OULD with Mobility Prediction (OULD-MP), were run in an HPC cluster. The obtained results show that our optimization solution outperforms the existing and heuristic-based approaches.
翻译:过去几年来,无人驾驶航空飞行器(无人驾驶飞行器)由于能够覆盖大片地区并进入困难和危险的目标区,引起了极大的兴趣,这与传统系统依赖固定相机和传感器直接观测的情况不同,此外,由于计算机视觉和机器学习的进步,正在采用无人驾驶航空飞行器(无人驾驶飞行器),以寻求广泛的解决办法和应用;然而,深神经网络(深神经网络)正在逐步走向更深和复杂的模型,以防止这些飞行器在船上执行。在本文件中,我们提议在无人驾驶飞行器内采用DNN分发方法,以便能够对资源紧张的装置进行数据分类,并避免服务器解决方案由于空对地连接的数据通信而造成额外延误。拟议方法的拟订是一个优化问题,目的是尽量减少数据收集和决策之间的距离,同时考虑到移动模型和无人驾驶航空飞行器的资源限制,作为空对空通信的一部分。我们还提出流动性预测,以调整我们的系统,使之适应资源紧张装置和网络变异。对基于服务器的解决方案进行了模拟,以便评估基于空对空连接的数据通信的数据通信的升级和标准,即以当前水平显示AVLD模式的模型,即以运行的AUVA-LDM-LD结果为模拟,用以显示SMA-MA-LDM-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-L-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-MA-