On the probabilistic feasibility of solutions in multi-agent optimization problems under uncertainty
We investigate the probabilistic feasibility of randomized solutions to two distinct classes of uncertain multi-agent optimization programs. We first assume that only the constraints of the program are affected by uncertainty, while the cost function is arbitrary. Leveraging recent developments on a...
| Hoofdauteurs: | , , |
|---|---|
| Formaat: | Journal article |
| Taal: | English |
| Gepubliceerd in: |
Elsevier
2021
|
| _version_ | 1826308665344262144 |
|---|---|
| author | Pantazis, G Fele, F Margellos, K |
| author_facet | Pantazis, G Fele, F Margellos, K |
| author_sort | Pantazis, G |
| collection | OXFORD |
| description | We investigate the probabilistic feasibility of randomized solutions to two distinct classes of uncertain multi-agent optimization programs. We first assume that only the constraints of the program are affected by uncertainty, while the cost function is arbitrary. Leveraging recent developments on a posteriori analysis within the scenario approach, we provide probabilistic guarantees for all feasible solutions of the program under study. This is particularly useful in cases where the numerical implementation of the solution-seeking algorithm prevents the exact quantification of the optimal solution. Furthermore, this result provides guarantees for the entire solution set of optimization programs with uncertain convex constraints and (possibly) non-convex cost function. We then focus on optimization programs with deterministic constraints, where the cost function depends on uncertainty and admits an aggregate representation of the agents’ decisions. By exploiting the structure of the program under study and leveraging the so called support rank notion, we provide agent-independent robustness certificates for the optimal solution, i.e., the constructed bound on the probability of constraint violation does not depend on the number of agents, but only on the dimension of each agent’s decision space. This substantially reduces the amount of samples required to achieve a certain level of probabilistic robustness for a larger number of agents. All robustness certificates provided in this paper are distribution-free and can be used alongside any optimization algorithm. Our theoretical results are accompanied by a numerical case study of a charging control problem for a fleet of electric vehicles. |
| first_indexed | 2024-03-07T07:22:43Z |
| format | Journal article |
| id | oxford-uuid:55ce3e8c-2f42-42a5-a655-b712a73bd002 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T07:22:43Z |
| publishDate | 2021 |
| publisher | Elsevier |
| record_format | dspace |
| spelling | oxford-uuid:55ce3e8c-2f42-42a5-a655-b712a73bd0022022-10-28T08:44:43ZOn the probabilistic feasibility of solutions in multi-agent optimization problems under uncertaintyJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:55ce3e8c-2f42-42a5-a655-b712a73bd002EnglishSymplectic ElementsElsevier2021Pantazis, GFele, FMargellos, KWe investigate the probabilistic feasibility of randomized solutions to two distinct classes of uncertain multi-agent optimization programs. We first assume that only the constraints of the program are affected by uncertainty, while the cost function is arbitrary. Leveraging recent developments on a posteriori analysis within the scenario approach, we provide probabilistic guarantees for all feasible solutions of the program under study. This is particularly useful in cases where the numerical implementation of the solution-seeking algorithm prevents the exact quantification of the optimal solution. Furthermore, this result provides guarantees for the entire solution set of optimization programs with uncertain convex constraints and (possibly) non-convex cost function. We then focus on optimization programs with deterministic constraints, where the cost function depends on uncertainty and admits an aggregate representation of the agents’ decisions. By exploiting the structure of the program under study and leveraging the so called support rank notion, we provide agent-independent robustness certificates for the optimal solution, i.e., the constructed bound on the probability of constraint violation does not depend on the number of agents, but only on the dimension of each agent’s decision space. This substantially reduces the amount of samples required to achieve a certain level of probabilistic robustness for a larger number of agents. All robustness certificates provided in this paper are distribution-free and can be used alongside any optimization algorithm. Our theoretical results are accompanied by a numerical case study of a charging control problem for a fleet of electric vehicles. |
| spellingShingle | Pantazis, G Fele, F Margellos, K On the probabilistic feasibility of solutions in multi-agent optimization problems under uncertainty |
| title | On the probabilistic feasibility of solutions in multi-agent optimization problems under uncertainty |
| title_full | On the probabilistic feasibility of solutions in multi-agent optimization problems under uncertainty |
| title_fullStr | On the probabilistic feasibility of solutions in multi-agent optimization problems under uncertainty |
| title_full_unstemmed | On the probabilistic feasibility of solutions in multi-agent optimization problems under uncertainty |
| title_short | On the probabilistic feasibility of solutions in multi-agent optimization problems under uncertainty |
| title_sort | on the probabilistic feasibility of solutions in multi agent optimization problems under uncertainty |
| work_keys_str_mv | AT pantazisg ontheprobabilisticfeasibilityofsolutionsinmultiagentoptimizationproblemsunderuncertainty AT felef ontheprobabilisticfeasibilityofsolutionsinmultiagentoptimizationproblemsunderuncertainty AT margellosk ontheprobabilisticfeasibilityofsolutionsinmultiagentoptimizationproblemsunderuncertainty |