Consensus for black-box nonlinear agents using optimistic optimization

doi:10.1016/j.automatica.2014.02.021

Return

Consensus for black-box nonlinear agents using optimistic optimization

2014-04-01

Lucian Buşoniu *

Irinel‐Constantin Morărescu

DOI：10.1016/j.automatica.2014.02.021

Original

Save

View PDF

Abstract

En 中文

An important problem in multiagent systems is consensus, which requires the agents to agree on certain controlled variables of interest. We focus on the challenge of dealing in a generic way with nonlinear agent dynamics, represented as a black box with unknown mathematical form. Our approach designs a reference behavior with a classical consensus method. The main novelty is using optimistic optimization (OO) to find controls that closely follow the reference behavior. The first advantage of OO is that it only needs to sample the black-box model of the agent, and so achieves our goal of handling unknown nonlinearities. Secondly, a tight relationship is guaranteed between computation invested and closeness to the reference behavior. Our main results exploit these properties to prove practical consensus. An analysis of representative examples builds additional insight and shows that in some nontrivial problems the optimization is easy to solve by OO. Simulations on these examples accompany the analysis. (C) 2014 Elsevier Ltd. All rights reserved.

Keywords:

Multiagent systems

Consensus

Optimistic optimization

Nonlinear systems

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.