PORTO @ 
Archivio Istituzionale della Ricerca
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishWe consider convex optimization problems with N randomly drawn convex constraints. Previous work has shown that the tails of the distribution of the probability that the optimal solution subject to these constraints will violate the next random constraint, can be bounded by a binomial distribution. In this paper we extend these results to the violation probability of convex combinations of optimal solutions of optimization problems with random constraints and different cost objectives. This extension has interesting applications to distributed multi-agent consensus algorithms in which the decision vectors of the agents are subject to random constraints and the agents' goal is to achieve consensus on a common value of the decision vector that satisfies the constraints. We give explicit bounds on the tails of the probability that the agents' decision vectors at an arbitrary iteration of the consensus protocol violate further constraint realizations. In a numerical experiment we apply these results to a model predictive control problem in which the agents aim to achieve consensus on a control sequence subject to random terminal constraints.
Random convex programs for distributed multi-agent consensus / Calafiore, G. C.; Lyons, D.. - ELETTRONICO. - (2013), pp. 250-255. ((Intervento presentato al convegno 2013 12th European Control Conference, ECC 2013 tenutosi a Zurich nel 17-19 July, 2013.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
| Titolo: | Random convex programs for distributed multi-agent consensus |
| Autori: | |
| Data di pubblicazione: | 2013 |
| Abstract: | We consider convex optimization problems with N randomly drawn convex constraints. Previous work ...has shown that the tails of the distribution of the probability that the optimal solution subject to these constraints will violate the next random constraint, can be bounded by a binomial distribution. In this paper we extend these results to the violation probability of convex combinations of optimal solutions of optimization problems with random constraints and different cost objectives. This extension has interesting applications to distributed multi-agent consensus algorithms in which the decision vectors of the agents are subject to random constraints and the agents' goal is to achieve consensus on a common value of the decision vector that satisfies the constraints. We give explicit bounds on the tails of the probability that the agents' decision vectors at an arbitrary iteration of the consensus protocol violate further constraint realizations. In a numerical experiment we apply these results to a model predictive control problem in which the agents aim to achieve consensus on a control sequence subject to random terminal constraints. |
| Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
| File | Descrizione | Tipologia | Licenza | |
|---|---|---|---|---|
| ecc_final.pdf | 2. Post-print / Author's Accepted Manuscript | PUBBLICO - Tutti i diritti riservati | Visibile a tuttiVisualizza/Apri | |
| Calafiore-Random1.pdf | 2a Post-print versione editoriale / Version of Record | Non Pubblico - Accesso privato/ristretto | Administrator Richiedi una copia |
http://hdl.handle.net/11583/2837801
Copyright © 2020