Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Alessandro Falsone"'
Publikováno v:
IEEE Transactions on Automatic Control. 68:272-284
We consider a multi-agent optimal resource sharing problem that is represented by a linear program. The amount of resource to be shared is fixed, and agents belong to a population that is characterized probabilistically so as to allow heterogeneity a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87065a32606ad4d05d325efbbd9441bf
https://doi.org/10.1109/tac.2022.3146055
https://doi.org/10.1109/tac.2022.3146055
Autor:
Kostas Margellos, Maria Prandini, Fabio Belluschi, Alessandro Falsone, Simone Garatti, Daniele Ioli
Publikováno v:
Journal of Process Control. 89:11-21
This paper deals with structured multi-agent optimization problems that involve coupled local and global decision variables. We propose an iterative distributed algorithm that explicitly accounts for this structure, and requires the agents to communi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a14542885a21fb410f89f574ee322ee8
https://doi.org/10.1016/j.jprocont.2020.03.005
https://doi.org/10.1016/j.jprocont.2020.03.005
Publikováno v:
IFAC-PapersOnLine. 53:15211-15216
This paper addresses the design of coordinated maneuvers in an autonomous driving set-up involving multiple vehicles. In particular, we consider a lane change problem where a vehicle has to merge in a platoon traveling in the adjacent lane of a two-l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c8a878c62a7d813c9075f182619e18d
https://doi.org/10.1016/j.ifacol.2020.12.2302
https://doi.org/10.1016/j.ifacol.2020.12.2302
This letter addresses the challenge of solving large-scale Mixed Integer Linear Programs (MILPs). A resolution scheme is proposed for the class of MILPs with a hidden constraint-coupled multi-agent structure. In particular, we focus on the problem of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::77fde672eb4cf197ce63d0f8a1fe3830
http://hdl.handle.net/11311/1183232
http://hdl.handle.net/11311/1183232
Publikováno v:
Automatica. 146:110589
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b94a624f5c2f79a5388f52f1b6bae51f
https://doi.org/10.1016/j.automatica.2022.110589
https://doi.org/10.1016/j.automatica.2022.110589
We consider linear resource sharing problems with multiple agents. Agents are heterogeneous, with heterogeneity modelled by a tuple of parameters taking value according to an underlying probability distribution, and share a fixed resource amount. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e40154b4d20a5b99b40eeab3be24438b
https://ora.ox.ac.uk/objects/uuid:ca29522d-a45a-4aff-b34c-6b95d210e886
https://ora.ox.ac.uk/objects/uuid:ca29522d-a45a-4aff-b34c-6b95d210e886
Publikováno v:
Sustainable Energy, Grids and Networks. 31:100740
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cabf9e0403bcf69768ef69b18de2bf79
https://doi.org/10.1016/j.segan.2022.100740
https://doi.org/10.1016/j.segan.2022.100740
Autor:
Maria Prandini, Alessandro Falsone
We address constraint-coupled optimization for a system composed of multiple cooperative agents communicating over a time-varying network. We propose a distributed proximal minimization algorithm that is guaranteed to converge to an optimal solution
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f6b4d446ff13e511063b7c59fd8032f
http://hdl.handle.net/11311/1161106
http://hdl.handle.net/11311/1161106
We consider constraint-coupled optimization problems in which agents of a network aim to cooperatively minimize the sum of local objective functions subject to individual constraints and a common linear coupling constraint. We propose a novel optimiz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c9e83da46d3e21f72f86951ac1fb2c22
http://arxiv.org/abs/1907.10860
http://arxiv.org/abs/1907.10860
In this paper, we consider optimization problems involving multiple agents. Each agent introduces its own constraints on the optimization vector, and the constraints of all agents depend on a common source of uncertainty. We suppose that uncertainty
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01a3250b22d3a6a5137c06c264e9ffce
https://ora.ox.ac.uk/objects/uuid:622cd652-474f-4cbd-a42a-c83abcd4ef2c
https://ora.ox.ac.uk/objects/uuid:622cd652-474f-4cbd-a42a-c83abcd4ef2c