A finite-time dual method for negotiation between dynamical systems

DOI10.1137/100819175MaRDI QIDQ4920255zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Daniel Zelazo, Mathias Bürger, Frank Allgöwer

Publication date 16 May 2013

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/2d9fa7e3d0fac9e7f961cf10735d1513932bb092

zbMATH Keywords

algorithm trajectoriescentralized optimal control trajectoriescommunication graphcorresponding dual problemdistributed optimizationfinite-time consensushorizon timeLaplacian eigenvaluesmultiagent systemsnegotiation between dynamical systemsnetwork of self-interested agentsonline negotiationsoptimal control policysimple linear matrix inequality conditionstep-size rulesubgradient methodsuniform convergence

Mathematics Subject Classification ID

Agent technology and artificial intelligence (68T42) Quadratic programming (90C20) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Decentralized systems (93A14)

Recommendations

• On decentralized negotiation of optimal consensus
• Optimal finite-time consensus on fixed and periodic graphs
• A distributed economic MPC framework for cooperative control under conflicting objectives
• Distributed optimal control of multiple systems
• Distributed resource allocation via multi-agent systems under time-varying networks

Cited in

(2)

• Dynamic negotiation with time-varying Pareto frontier
• On decentralized negotiation of optimal consensus

This page was built for publication: A finite-time dual method for negotiation between dynamical systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4920255)