scholarly journals Improving Computational Efficiency in Crowded Task Allocation Games with Coupled Constraints

2019 ◽  
Vol 9 (10) ◽  
pp. 2117
Author(s):  
Ming Chong Lim ◽  
Han-Lim Choi

Multi-agent task allocation is a well-studied field with many proven algorithms. In real-world applications, many tasks have complicated coupled relationships that affect the feasibility of some algorithms. In this paper, we leverage on the properties of potential games and introduce a scheduling algorithm to provide feasible solutions in allocation scenarios with complicated spatial and temporal dependence. Additionally, we propose the use of random sampling in a Distributed Stochastic Algorithm to enhance speed of convergence. We demonstrate the feasibility of such an approach in a simulated disaster relief operation and show that feasibly good results can be obtained when the confirmation and sample size requirements are properly selected.

2013 ◽  
Vol 10 (3) ◽  
pp. 125-132 ◽  
Author(s):  
Lu Wang ◽  
Zhiliang Wang ◽  
Siquan Hu ◽  
Lei Liu

2021 ◽  
Vol 26 (6) ◽  
pp. 1-22
Author(s):  
Chen Jiang ◽  
Bo Yuan ◽  
Tsung-Yi Ho ◽  
Xin Yao

Digital microfluidic biochips (DMFBs) have been a revolutionary platform for automating and miniaturizing laboratory procedures with the advantages of flexibility and reconfigurability. The placement problem is one of the most challenging issues in the design automation of DMFBs. It contains three interacting NP-hard sub-problems: resource binding, operation scheduling, and module placement. Besides, during the optimization of placement, complex constraints must be satisfied to guarantee feasible solutions, such as precedence constraints, storage constraints, and resource constraints. In this article, a new placement method for DMFB is proposed based on an evolutionary algorithm with novel heuristic-based decoding strategies for both operation scheduling and module placement. Specifically, instead of using the previous list scheduler and path scheduler for decoding operation scheduling chromosomes, we introduce a new heuristic scheduling algorithm (called order scheduler) with fewer limitations on the search space for operation scheduling solutions. Besides, a new 3D placer that combines both scheduling and placement is proposed where the usage of the microfluidic array over time in the chip is recorded flexibly, which is able to represent more feasible solutions for module placement. Compared with the state-of-the-art placement methods (T-tree and 3D-DDM), the experimental results demonstrate the superiority of the proposed method based on several real-world bioassay benchmarks. The proposed method can find the optimal results with the minimum assay completion time for all test cases.


2020 ◽  
Vol 11 (1) ◽  
pp. 1-25
Author(s):  
Sofia Amador Nelke ◽  
Steven Okamoto ◽  
Roie Zivan

2018 ◽  
Vol 15 (6) ◽  
pp. 172988141881303 ◽  
Author(s):  
Bing Xie ◽  
Xueqiang Gu ◽  
Jing Chen ◽  
LinCheng Shen

In this article, we study a problem of dynamic task allocation with multiple agent responsibilities in distributed multi-agent systems. Agents in the research have two responsibilities, communication and task execution. Movements in agent task execution bring changes to the system network structure, which will affect the communication. Thus, agents need to be autonomous on communication network reconstruction for good performance on task execution. First, we analyze the relationships between the two responsibilities of agents. Then, we design a multi-responsibility–oriented coalition formation framework for dynamic task allocation with two parts, namely, task execution and self-adaptation communication. For the former part, we integrate our formerly proposed algorithm in the framework for task execution coalition formation. For the latter part, we develop a constrained Bayesian overlapping coalition game model to formulate the communication network. A task-allocation efficiency–oriented communication coalition utility function is defined to optimize a coalition structure for the constrained Bayesian overlapping coalition game model. Considering the geographical location dependence between the two responsibilities, we define constrained agent strategies to map agent strategies to potential location choices. Based on the abovementioned design, we propose a distributed location pruning self-adaptive algorithm for the constrained Bayesian overlapping coalition formation. Finally, we test the performance of our framework, multi-responsibility–oriented coalition formation framework, with simulation experiments. Experimental results demonstrate that the multi-responsibility oriented coalition formation framework performs better than the other two distributed algorithms on task completion rate (by over 9.4% and over 65% on average, respectively).


2013 ◽  
Vol 55 (2) ◽  
pp. 109-128 ◽  
Author(s):  
B. L. ROBERTSON ◽  
C. J. PRICE ◽  
M. REALE

AbstractA stochastic algorithm for bound-constrained global optimization is described. The method can be applied to objective functions that are nonsmooth or even discontinuous. The algorithm forms a partition on the search region using classification and regression trees (CART), which defines a region where the objective function is relatively low. Further points are drawn directly from the low region before a new partition is formed. Alternating between partition and sampling phases provides an effective method for nonsmooth global optimization. The sequence of iterates generated by the algorithm is shown to converge to an essential global minimizer with probability one under mild conditions. Nonprobabilistic results are also given when random sampling is replaced with points taken from the Halton sequence. Numerical results are presented for both smooth and nonsmooth problems and show that the method is effective and competitive in practice.


Sign in / Sign up

Export Citation Format

Share Document