Discrete Interactions in Decentralized Multiagent Coordination: A Probabilistic Perspective

Author(s):  
Ming Liu ◽  
Weiling Chang ◽  
Chao Li ◽  
Yuchun Ji ◽  
Ruiguang Li ◽  
...  
Author(s):  
Nicolás F. Soria ◽  
Mitchell K. Colby ◽  
Irem Y. Tumer ◽  
Christopher Hoyle ◽  
Kagan Tumer

In complex engineering systems, complexity may arise by design, or as a by-product of the system’s operation. In either case, the root cause of complexity is the same: the unpredictable manner in which interactions among components modify system behavior. Traditionally, two different approaches are used to handle such complexity: (i) a centralized design approach where the impacts of all potential system states and behaviors resulting from design decisions must be accurately modeled; and (ii) an approach based on externally legislating design decisions, which avoid such difficulties, but at the cost of expensive external mechanisms to determine trade-offs among competing design decisions. Our approach is a hybrid of the two approaches, providing a method in which decisions can be reconciled without the need for either detailed interaction models or external mechanisms. A key insight of this approach is that complex system design, undertaken with respect to a variety of design objectives, is fundamentally similar to the multiagent coordination problem, where component decisions and their interactions lead to global behavior. The design of a race car is used as the case study. The results of this paper demonstrate that a team of autonomous agents using a cooperative coevolutionary algorithm can effectively design a Formula racing vehicle.


Author(s):  
Haopeng Zhang ◽  
Qing Hui

Model predictive control (MPC) is a heuristic control strategy to find a consequence of best controllers during each finite-horizon regarding to certain performance functions of a dynamic system. MPC involves two main operations: estimation and optimization. Due to high complexity of the performance functions, such as, nonlinear, non-convex, large-scale objective functions, the optimization algorithms for MPC must be capable of handling those problems with both computational efficiency and accuracy. Multiagent coordination optimization (MCO) is a recently developed heuristic algorithm by embedding multiagent coordination into swarm intelligence to accelerate the searching process for the optimal solution in the particle swarm optimization (PSO) algorithm. With only some elementary operations, the MCO algorithm can obtain the best solution extremely fast, which is especially necessary to solve the online optimization problems in MPC. Therefore, in this paper, we propose an MCO based MPC strategy to enhance the performance of the MPC controllers when addressing non-convex large-scale nonlinear problems. Moreover, as an application, the network resource balanced allocation problem is numerically illustrated by the MCO based MPC strategy.


1999 ◽  
Vol 13 (1-2) ◽  
pp. 11-38 ◽  
Author(s):  
Mihai Barbuceanu

2014 ◽  
Vol 50 ◽  
pp. 885-922 ◽  
Author(s):  
A. Veit ◽  
Y. Xu ◽  
R. Zheng ◽  
N. Chakraborty ◽  
K. Sycara

A key challenge in creating a sustainable and energy-efficient society is to make consumer demand adaptive to the supply of energy, especially to the renewable supply. In this article, we propose a partially-centralized organization of consumers (or agents), namely, a consumer cooperative that purchases electricity from the market. In the cooperative, a central coordinator buys the electricity for the whole group. The technical challenge is that consumers make their own demand decisions, based on their private demand constraints and preferences, which they do not share with the coordinator or other agents. We propose a novel multiagent coordination algorithm, to shape the energy demand of the cooperative. To coordinate individual consumers under incomplete information, the coordinator determines virtual price signals that it sends to the consumers to induce them to shift their demands when required. We prove that this algorithm converges to the central optimal solution and minimizes the electric energy cost of the cooperative. Additionally, we present results on the time complexity of the iterative algorithm and its implications for agents' incentive compatibility. Furthermore, we perform simulations based on real world consumption data to (a) characterize the convergence properties of our algorithm and (b) understand the effect of differing demand characteristics of participants as well as of different price functions on the cost reduction. The results show that the convergence time scales linearly with the agent population size and length of the optimization horizon. Finally, we observe that as participants' flexibility of shifting their demands increases, cost reduction increases and that the cost reduction is not sensitive to variation in consumption patterns of the consumers.


Sign in / Sign up

Export Citation Format

Share Document