首页> 外文期刊>International Journal of Innovative Computing Information and Control >LOCATION SENSITIVE MULTI-TASK ORIENTED SERVICE COMPOSITION FOR CYBER PHYSICAL SYSTEMS
【24h】

LOCATION SENSITIVE MULTI-TASK ORIENTED SERVICE COMPOSITION FOR CYBER PHYSICAL SYSTEMS

机译:网络物理系统的位置敏感型多任务面向服务组合

获取原文
获取原文并翻译 | 示例
           

摘要

As a core technology to enable service-based cyber physical systems (CPSs), CPS service composition has received a lot of attention from researchers. However, existing studies on it mostly aim to solve single task oriented CPS service composition problem, and the multi-tasking requirements of CPSs are not considered. In fact, there are quite a few situations where multiple tasks need to be completed as soon as possible, such as smart emergency response, and smart manufacturing. In addition, locations have much influence on the execution time of CPS services because before CPS services begin to work for tasks, the required physical entities must move or be transported to the predefined locations. In this paper we investigate the CPS service composition problem in which these two characteristics are both considered. To address it, we not only need to select appropriate CPS services for each task, but also need to arrange the invocation sequence for each selected CPS service. The final goal is to find a service selection and invocation scheme that can optimize the makespan as much as possible. A heuristic approach based on an improved quantum genetic algorithm is designed to handle it. Experimental results show that the proposed method can find the superior schemes. Compared with the schemes given by other methods, our schemes can achieve lower makespan under various situations, such as different number of CPS services and tasks, and different types of spatial distribution.
机译:作为支持基于服务的网络物理系统(CPS)的核心技术,CPS服务组合受到了研究人员的广泛关注。然而,关于它的现有研究大多旨在解决面向单一任务的CPS服务组合问题,并且没有考虑CPS的多任务需求。实际上,在很多情况下,需要尽快完成多项任务,例如智能应急响应和智能制造。此外,位置对CPS服务的执行时间有很大影响,因为在CPS服务开始执行任务之前,必须将所需的物理实体移动或运输到预定义的位置。在本文中,我们研究了同时考虑这两个特征的CPS服务组合问题。为了解决这个问题,我们不仅需要为每个任务选择适当的CPS服务,而且还需要为每个选定的CPS服务安排调用顺序。最终目标是找到一种服务选择和调用方案,以最大程度地优化工期。设计了一种基于改进的量子遗传算法的启发式方法来处理它。实验结果表明,该方法可以找到较好的方案。与其他方法给出的方案相比,我们的方案在各种情况下(例如CPS服务和任务的数量不同以及空间分布的类型不同)可以实现较低的制造期。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号