This paper improves a previous result on the multi-agent assignment problem, in which a group of agents has to reach a consensus on an optimal distribution of tasks, under communication and assignment constraints. Indeed, the drawbacks of the previously proposed algorithm are that it must start from an initial feasible assignment state and that an analysis on the goodness of the reached consensus is not given. In this paper, starting from any unfeasible solution, we develop an extended version of the previous gossip algorithm able to iteratively find an initial feasible assignment state in order to reach the consensus state among the agents. Moreover, a study is performed in order to evaluate how the solution obtained by the discrete consensus algorithm is close to the optimal distribution of tasks. Finally, an example shows the application of the distributed discrete consensus algorithm

Discrete consensus in networks with constrained capacity / Fanti, Maria Pia; Franceschelli, M.; Mangini, Agostino Marcello; Pedroncelli, G.; Ukovich, W.. - (2013), pp. 2012-2017. (Intervento presentato al convegno IEEE 52nd Annual Conference on Decision and Control, CDC 2013 tenutosi a Firenze, Italy nel December 10-13, 2013) [10.1109/CDC.2013.6760177].

Discrete consensus in networks with constrained capacity

FANTI, Maria Pia;MANGINI, Agostino Marcello;
2013-01-01

Abstract

This paper improves a previous result on the multi-agent assignment problem, in which a group of agents has to reach a consensus on an optimal distribution of tasks, under communication and assignment constraints. Indeed, the drawbacks of the previously proposed algorithm are that it must start from an initial feasible assignment state and that an analysis on the goodness of the reached consensus is not given. In this paper, starting from any unfeasible solution, we develop an extended version of the previous gossip algorithm able to iteratively find an initial feasible assignment state in order to reach the consensus state among the agents. Moreover, a study is performed in order to evaluate how the solution obtained by the discrete consensus algorithm is close to the optimal distribution of tasks. Finally, an example shows the application of the distributed discrete consensus algorithm
2013
IEEE 52nd Annual Conference on Decision and Control, CDC 2013
978-1-4673-5717-3
Discrete consensus in networks with constrained capacity / Fanti, Maria Pia; Franceschelli, M.; Mangini, Agostino Marcello; Pedroncelli, G.; Ukovich, W.. - (2013), pp. 2012-2017. (Intervento presentato al convegno IEEE 52nd Annual Conference on Decision and Control, CDC 2013 tenutosi a Firenze, Italy nel December 10-13, 2013) [10.1109/CDC.2013.6760177].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11589/22209
Citazioni
  • Scopus 17
  • ???jsp.display-item.citation.isi??? 11
social impact