Multi-agent network flows that solve linear complementarity problems

Title:

Multi-agent network flows that solve linear complementarity problems

Creator:

Liang, Shu and Zeng, Xianlin

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:2ccdca66-45ac-420f-ab5b-59d4e52852da
uuid:2ccdca66-45ac-420f-ab5b-59d4e52852da
doi:10.14736/kyb-2018-3-0542

Subject:

distributed algorithm, linear complementarity problem, multi-agent network, nonsmooth algorithm, and continuous-time algorithm

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

In this paper, we consider linear complementarity problems with positive definite matrices through a multi-agent network. We propose a distributed continuous-time algorithm and show its correctness and convergence. Moreover, with the help of Kalman-Yakubovich-Popov lemma and Lyapunov function, we prove its asymptotic convergence. We also present an alternative distributed algorithm in terms of an ordinary differential equation. Finally, we illustrate the effectiveness of our method by simulations.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Source:

Kybernetika | 2018 Volume:54 | Number:3

Harvested from:

CDK

Metadata only:

false