arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.01413cs.ROcs.PF
收藏

工业机器人网络流量调度的极小极大利用算法

A Minmax Utilization Algorithm for Network Traffic Scheduling of Industrial Robots

Shandong Normal University(山东师范大学);HAL Robotics Ltd(HAL机器人有限公司)

Yantong Wang, Vasilis Friderikos, Sebastian Andraos

AI总结:

本文提出一种基于伪确定性过程的ILP模型及二次复杂度随机搜索算法,用于最小化工业机器人网络最大聚合流量,可将峰值数据速率降低53.4%。

摘要:

新兴的5G及更先进的无线工业虚拟化网络预计将支持大量的机器人操纵器。根据所涉及的过程,这些工业机器人可能会产生大量的多模态流量,这些流量需要穿越网络一直到达(公共/私有)边缘云,在那里将进行高级处理、控制和服务编排。在本文中,我们利用工业环境中机器人操纵器重复过程的潜在伪确定性特性来进行流量工程,并提出了一个整数线性规划(ILP)模型,以最小化网络中的最大聚合流量。所提出的模型还考虑了任务序列和时间间隔要求。为了解决ILP中的维度灾难,我们提供了一种具有二次时间复杂度的随机搜索算法。数值研究表明,与机器人操纵器以不协调方式运行的名义情况相比,所提出的方案可以将峰值数据速率降低高达53.4%,从而显著提高底层网络资源的利用率。

英文摘要:

Emerging 5G and beyond wireless industrial virtualized networks are expected to support a significant number of robotic manipulators. Depending on the processes involved, these industrial robots might result in significant volume of multi-modal traffic that will need to traverse the network all the way to the (public/private) edge cloud, where advanced processing, control and service orchestration will be taking place. In this paper, we perform the traffic engineering by capitalizing on the underlying pseudo-deterministic nature of the repetitive processes of robotic manipulators in an industrial environment and propose an integer linear programming (ILP) model to minimize the maximum aggregate traffic in the network. The task sequence and time gap requirements are also considered in the proposed model. To tackle the curse of dimensionality in ILP, we provide a random search algorithm with quadratic time complexity. Numerical investigations reveal that the proposed scheme can reduce the peak data rate up to 53.4% compared with the nominal case where robotic manipulators operate in an uncoordinated fashion, resulting in significant improvement in the utilization of the underlying network resources.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑