• 제목/요약/키워드: task allocation

검색결과 209건 처리시간 0.029초

Task Allocation of Intelligent Warehouse Picking System based on Multi-robot Coalition

  • Xue, Fei;Tang, Hengliang;Su, Qinghua;Li, Tao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권7호
    • /
    • pp.3566-3582
    • /
    • 2019
  • In intelligent warehouse picking system, the allocation of tasks has an important influence on the efficiency of the whole system because of the large number of robots and orders. The paper proposes a method to solve the task allocation problem that multi-robot task allocation problem is transformed into transportation problem to find a collision-free task allocation scheme and then improve the capability of task processing. The task time window and the power consumption of multi-robot (driving distance) are regarded as the utility function and the maximized utility function is the objective function. Then an integer programming formulation is constructed considering the number of task assignment on an agent according to their battery consumption restriction. The problem of task allocation is solved by table working method. Finally, simulation modeling of the methods based on table working method is carried out. Results show that the method has good performance and can improve the efficiency of the task execution.

A Joint Allocation Algorithm of Computing and Communication Resources Based on Reinforcement Learning in MEC System

  • Liu, Qinghua;Li, Qingping
    • Journal of Information Processing Systems
    • /
    • 제17권4호
    • /
    • pp.721-736
    • /
    • 2021
  • For the mobile edge computing (MEC) system supporting dense network, a joint allocation algorithm of computing and communication resources based on reinforcement learning is proposed. The energy consumption of task execution is defined as the maximum energy consumption of each user's task execution in the system. Considering the constraints of task unloading, power allocation, transmission rate and calculation resource allocation, the problem of joint task unloading and resource allocation is modeled as a problem of maximum task execution energy consumption minimization. As a mixed integer nonlinear programming problem, it is difficult to be directly solve by traditional optimization methods. This paper uses reinforcement learning algorithm to solve this problem. Then, the Markov decision-making process and the theoretical basis of reinforcement learning are introduced to provide a theoretical basis for the algorithm simulation experiment. Based on the algorithm of reinforcement learning and joint allocation of communication resources, the joint optimization of data task unloading and power control strategy is carried out for each terminal device, and the local computing model and task unloading model are built. The simulation results show that the total task computation cost of the proposed algorithm is 5%-10% less than that of the two comparison algorithms under the same task input. At the same time, the total task computation cost of the proposed algorithm is more than 5% less than that of the two new comparison algorithms.

Long-Term Container Allocation via Optimized Task Scheduling Through Deep Learning (OTS-DL) And High-Level Security

  • Muthakshi S;Mahesh K
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권4호
    • /
    • pp.1258-1275
    • /
    • 2023
  • Cloud computing is a new technology that has adapted to the traditional way of service providing. Service providers are responsible for managing the allocation of resources. Selecting suitable containers and bandwidth for job scheduling has been a challenging task for the service providers. There are several existing systems that have introduced many algorithms for resource allocation. To overcome these challenges, the proposed system introduces an Optimized Task Scheduling Algorithm with Deep Learning (OTS-DL). When a job is assigned to a Cloud Service Provider (CSP), the containers are allocated automatically. The article segregates the containers as' Long-Term Container (LTC)' and 'Short-Term Container (STC)' for resource allocation. The system leverages an 'Optimized Task Scheduling Algorithm' to maximize the resource utilisation that initially inquires for micro-task and macro-task dependencies. The bottleneck task is chosen and acted upon accordingly. Further, the system initializes a 'Deep Learning' (DL) for implementing all the progressive steps of job scheduling in the cloud. Further, to overcome container attacks and errors, the system formulates a Container Convergence (Fault Tolerance) theory with high-level security. The results demonstrate that the used optimization algorithm is more effective for implementing a complete resource allocation and solving the large-scale optimization problem of resource allocation and security issues.

A Cloud-Edge Collaborative Computing Task Scheduling and Resource Allocation Algorithm for Energy Internet Environment

  • Song, Xin;Wang, Yue;Xie, Zhigang;Xia, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권6호
    • /
    • pp.2282-2303
    • /
    • 2021
  • To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

A Survey on the Mobile Crowdsensing System life cycle: Task Allocation, Data Collection, and Data Aggregation

  • Xia Zhuoyue;Azween Abdullah;S.H. Kok
    • International Journal of Computer Science & Network Security
    • /
    • 제23권3호
    • /
    • pp.31-48
    • /
    • 2023
  • The popularization of smart devices and subsequent optimization of their sensing capacity has resulted in a novel mobile crowdsensing (MCS) pattern, which employs smart devices as sensing nodes by recruiting users to develop a sensing network for multiple-task performance. This technique has garnered much scholarly interest in terms of sensing range, cost, and integration. The MCS is prevalent in various fields, including environmental monitoring, noise monitoring, and road monitoring. A complete MCS life cycle entails task allocation, data collection, and data aggregation. Regardless, specific drawbacks remain unresolved in this study despite extensive research on this life cycle. This article mainly summarizes single-task, multi-task allocation, and space-time multi-task allocation at the task allocation stage. Meanwhile, the quality, safety, and efficiency of data collection are discussed at the data collection stage. Edge computing, which provides a novel development idea to derive data from the MCS system, is also highlighted. Furthermore, data aggregation security and quality are summarized at the data aggregation stage. The novel development of multi-modal data aggregation is also outlined following the diversity of data obtained from MCS. Overall, this article summarizes the three aspects of the MCS life cycle, analyzes the issues underlying this study, and offers developmental directions for future scholars' reference.

Auction based Task Reallocation in Multiagent Systems

  • Lee, Sang G.;Kim, In C.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2001년도 ICCAS
    • /
    • pp.149.3-149
    • /
    • 2001
  • Task allocation is a key problem in multiagent systems. The importance of automated negotiation protocols for solving the task allocation problem is increasing as a consequence of increased multi-agent applications. In this paper, we introduce the multiagent Traveling Salesman Problem(TSP) as an example of task reallocation problem, and suggest Vickery auction as an inter-agent coordination mechanism for solving this problem. In order to apply this market-based coordination mechanism into multiagent TSPs, we define the profit of each agent, the ultimate goal of negotiation, cities to be traded out through auctions, the bidding strategy, and the order of auctions. The primary advantage of such approach is that it can find an optimal task allocation ...

  • PDF

A hybrid tabu search algorithm for Task Allocation in Mobile Crowd-sensing

  • Akter, Shathee;Yoon, Seokhoon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제12권4호
    • /
    • pp.102-108
    • /
    • 2020
  • One of the key features of a mobile crowd-sensing (MCS) system is task allocation, which aims to recruit workers efficiently to carry out the tasks. Due to various constraints of the tasks (such as specific sensor requirement and a probabilistic guarantee of task completion) and workers heterogeneity, the task allocation become challenging. This assignment problem becomes more intractable because of the deadline of the tasks and a lot of possible task completion order or moving path of workers since a worker may perform multiple tasks and need to physically visit the tasks venues to complete the tasks. Therefore, in this paper, a hybrid search algorithm for task allocation called HST is proposed to address the problem, which employ a traveling salesman problem heuristic to find the task completion order. HST is developed based on the tabu search algorithm and exploits the premature convergence avoiding concepts from the genetic algorithm and simulated annealing. The experimental results verify that our proposed scheme outperforms the existing methods while satisfying given constraints.

클러스터링을 이용한 경험적 태스크 할당 기법 (A Heuristic Task Allocation Scheme Based on Clustering)

  • 김석일;전중남;김관유
    • 한국정보처리학회논문지
    • /
    • 제6권10호
    • /
    • pp.2659-2669
    • /
    • 1999
  • This paper a heuristic, clustering based task allocation scheme applicable to non-directed task graph on a distributed system. This scheme firstly builds a task-machine graph, and then applies a clustering process where in a pair of tasks that are connected to the highest cost edge is merged into a big one or a task is allocated to a machine. During the process, the proposed scheme figure out a machine onto which the task allocation may cause deduction of large communication overhead that has incurred between the task and tasks that are already allocated to the machine while the computation costs is slightly increased in the machine. Simulation for the various task graphs shows that the scheduling using the proposed scheme result far better than ones by using the traditional schemes. A comparison with optimal task scheduling also promises that our scheme derives optimal results more occasionally than the traditional schemes do.

  • PDF

태스크 복제 기반 프로세서 할당 방법에 최적화된 태스크 우선순위 결정 알고리즘 (A Task Prioritizing Algorithm Optimized for Task Duplication Based Processor Allocation Method)

  • 송인성;윤완오;이창호;최상방
    • 인터넷정보학회논문지
    • /
    • 제12권6호
    • /
    • pp.1-17
    • /
    • 2011
  • 분산 이기종 컴퓨팅 시스템의 성능은 입력 그래프인 방향성 비순환 그래프DAG)를 스케줄링 하는 알고리즘의 성능에 따라 좌우된다. 그러나 분산 이기종 컴퓨팅 시스템에서의 태스크 스케줄링은 NP-complete 문제로 휴리스틱 방법으로 접근해야한다. 태스크 스케줄링 알고리즘은 우선순위 결정 단계와 프로세서 할당 단계로 구성되며, 많은 연구들이 두 단계를 함께 고려하고 있다. 본 논문에서는 태스크 우선순위 결정 단계에 초점을 맞추어 태스크 복제 기반 프로세서 할당 방법에 최적화된 태스크 우선순위 결정 알고리즘인 WPD 알고리즘을 제안한다. 제안하는 WPD 알고리즘의 성능 분석을 위해 태스크 복제 기반 프로세서 할당 방법을 사용하는 기존의 태스크 스케줄링 알고리즘인 HMPID, HCPFD, HCT 알고리즘의 프로세서 할당 단계에 본 논문에서 제안하는 WPD 알고리즘을 결합하여 성능을 비교하였다. 그 결과 본 논문에서 제안하는 WPD 알고리즘이 기존 태스크 우선순위 결정 방법에 비해 태스크 복제를 더욱 효율적으로 사용하여 HCPFD 알고리즘보다 9.58%, HCT 알고리즘보다 1.31% 성능 향상이 있는 것을 확인하였다.

이질형 다중 프로세서 시스템에서 휴리스틱 기법을 이용한 타스크 할당 알고리즘 (Task Allocation Algorithm for Heterogeneous Multiprocessor Systems Using Heuristic Technique)

  • 임선호;이종성;채수환
    • 한국정보처리학회논문지
    • /
    • 제6권4호
    • /
    • pp.890-900
    • /
    • 1999
  • 동질형 다중프로세서 시스템에서는 시스템의 성능을 향상시키기 위하여 타스크 수를 가능한 한 균등하게 배분하는 타스크 할당 알고리즘이 일반적으로 사용되고 있다. 그러나, 이질형 다중 프로세서 시스템에서는 이런 알고리즘에 의해 효과적인 타스크 할당이 이루어질 수 없다. 따라서, 이질형 다중 프로세서 시스템에서는 JSQ(Join the Shortest Queue) 알고리즘이 일반적으로 사용되고 있다. 그러나 JSQ 알고리즘은 프로세서 간에 타스크의 처리 능력의 차이가 클 경우에는 효율적이지 못하다. 본 논문에서는 타스크의 도착 시간, 타스크의 서비스 시간, 수행되어진 타스크의 수 등의 동적 데이터에 의해 습득된 프로세서의 처리 능력과 포컬 큐(local queue)의 길이를 동시에 고려한 휴리스틱(heuristic) 타스크 할당 알고리즘을 제시한다. 시뮬레시이션 결과, 제안한 휴리스틱 할당 알고리즘에 의해 시스템 성능을 크게 향상 시킬 수 있음을 보여 주었다.

  • PDF