论文标题

无人接地车的边缘学习:关节路径,能源和样本量规划

Edge Learning with Unmanned Ground Vehicle: Joint Path, Energy and Sample Size Planning

论文作者

Liu, Dan, Wang, Shuai, Wen, Zhigang, Cheng, Lei, Wen, Miaowen, Wu, Yik-Chung

论文摘要

Edge Learning(EL)将Edge Computing用作执行机器学习算法的平台,能够完全利用物联网(IoT)生成的大量感应数据(IoT)。但是,由于物联网设备的传输功率有限,因此在EL系统中收集传感数据是一项艰巨的任务。为了应对这一挑战,本文提议将无人接地车(UGV)与El集成。通过这样的计划,UGV可以通过接近各种物联网设备来提高沟通质量。但是,不同的设备可能会为不同的机器学习工作传输不同的数据,一个基本问题是如何共同计划UGV路径,设备的能耗以及不同工作的样本数量?本文进一步提出了一个基于图的路径计划模型,网络能量消耗模型和样本量规划模型,该模型表征了F-Measure作为少数族类样本量的函数。对于这些模型,关节路径,能量和样本规划(JPESP)问题被提出为大规模混合整数非线性编程(MINLP)问题,由于与UGV运动相关的高维不连续变量,这是不利的。为此,证明每个物联网设备应仅沿着路径提供一次,因此问题维度大大降低。此外,为了处理不连续的变量,得出了基于禁忌搜索(TS)算法,该算法在期望中收敛到JPESP问题的最佳解决方案。在不同的任务方案下的仿真结果表明,我们的优化方案优于固定EL和完整路径EL方案。

Edge learning (EL), which uses edge computing as a platform to execute machine learning algorithms, is able to fully exploit the massive sensing data generated by Internet of Things (IoT). However, due to the limited transmit power at IoT devices, collecting the sensing data in EL systems is a challenging task. To address this challenge, this paper proposes to integrate unmanned ground vehicle (UGV) with EL. With such a scheme, the UGV could improve the communication quality by approaching various IoT devices. However, different devices may transmit different data for different machine learning jobs and a fundamental question is how to jointly plan the UGV path, the devices' energy consumption, and the number of samples for different jobs? This paper further proposes a graph-based path planning model, a network energy consumption model and a sample size planning model that characterizes F-measure as a function of the minority class sample size. With these models, the joint path, energy and sample size planning (JPESP) problem is formulated as a large-scale mixed integer nonlinear programming (MINLP) problem, which is nontrivial to solve due to the high-dimensional discontinuous variables related to UGV movement. To this end, it is proved that each IoT device should be served only once along the path, thus the problem dimension is significantly reduced. Furthermore, to handle the discontinuous variables, a tabu search (TS) based algorithm is derived, which converges in expectation to the optimal solution to the JPESP problem. Simulation results under different task scenarios show that our optimization schemes outperform the fixed EL and the full path EL schemes.

扫码加入交流群

加入微信交流群

微信交流群二维码

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