IEEE Transactions on Automatic Control · 2019 · 24 citations · 24 references
ComputingComputer ScienceMathematicsAlgorithmsDistributed SystemsDynamical SystemsConsensus AlgorithmsDistributed AlgorithmsDistributed ComputingDistributed ConsensusDistributed ControlMulti-agent SystemsConsensus Convergence AnalysisConsensus In Multi-agent SystemsDistributed Linear AlgebraDistributed OptimizationDistributed State EstimationFinite-time ConsensusMulti-agent ConsensusMultiagent Control
This paper proposes a continuous-time distributed algorithm for multiagent networks to achieve a solution with the minimum l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -norm to underdetermined linear equations. The proposed algorithm comes from a combination of the Filippov set-valued map with the projection-consensus flow. Given the underlying network is undirected and fixed, it is shown that the proposed algorithm drives all agents' individual states to converge in finite time to a common value, which is the minimum l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -norm solution.
24
Mathematical Methods for Physicists
George B. Arfken, Jon Mathews · American Journal of Physics · 1972 · 4.1K citations
E. N. Gilbert · The Annals of Mathematical Statistics · 1959 · 1.1K citations · Full text