Aufsatz
Efficient Solution of Distributed MIP in Control of Networked Systems
Abstract
Certain classes of optimization‐based control problems stated for networked systems involving hybrid dynamics and logical constraints can be cast into Mixed‐Integer Programming (MIP) problems. Since these belong to the complexity class NP‐hard, the motivation arises to find approximations of the optimal solution by distributed solution efficiently. For the cases that the cost functional is linear or quadratic and the constraints are linear, this paper proposes an alternative to the standard centralized schemes, by employing dual decomposition into a set of local problems of moderate size which can be solved in parallel. Numerical examples demonstrate that the scheme can efficiently approximate the global solution.
Sponsorship
Gefördert im Rahmen des Projekts DEALCitation
@article{doi:10.17170/kobra-202101283082,
author={Liu, Zonglin and Stursberg, Olaf},
title={Efficient Solution of Distributed MIP in Control of Networked Systems},
journal={Proceedings in applied mathematics and mechanics (PAMM)},
year={2021}
}
0500 Oax
0501 Text $btxt$2rdacontent
0502 Computermedien $bc$2rdacarrier
1100 2021$n2021
1500 1/eng
2050 ##0##http://hdl.handle.net/123456789/12502
3000 Liu, Zonglin
3010 Stursberg, Olaf
4000 Efficient Solution of Distributed MIP in Control of Networked Systems / Liu, Zonglin
4030
4060 Online-Ressource
4085 ##0##=u http://nbn-resolving.de/http://hdl.handle.net/123456789/12502=x R
4204 \$dAufsatz
4170
5550 {{Gemischt-ganzzahlige Optimierung}}
5550 {{Steuerung}}
5550 {{Problem}}
5550 {{NP-hartes Problem}}
7136 ##0##http://hdl.handle.net/123456789/12502
<resource xsi:schemaLocation="http://datacite.org/schema/kernel-2.2 http://schema.datacite.org/meta/kernel-2.2/metadata.xsd"> 2021-02-15T12:00:05Z 2021-02-15T12:00:05Z 2021-01-25 doi:10.17170/kobra-202101283082 http://hdl.handle.net/123456789/12502 Gefördert im Rahmen des Projekts DEAL eng Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/ 510 600 Efficient Solution of Distributed MIP in Control of Networked Systems Aufsatz Certain classes of optimization‐based control problems stated for networked systems involving hybrid dynamics and logical constraints can be cast into Mixed‐Integer Programming (MIP) problems. Since these belong to the complexity class NP‐hard, the motivation arises to find approximations of the optimal solution by distributed solution efficiently. For the cases that the cost functional is linear or quadratic and the constraints are linear, this paper proposes an alternative to the standard centralized schemes, by employing dual decomposition into a set of local problems of moderate size which can be solved in parallel. Numerical examples demonstrate that the scheme can efficiently approximate the global solution. open access Liu, Zonglin Stursberg, Olaf doi:10.1002/pamm.202000160 Gemischt-ganzzahlige Optimierung Steuerung Problem NP-hartes Problem publishedVersion EISSN 1617-7061 Issue 1 Proceedings in applied mathematics and mechanics (PAMM) Volume 20 false e202000160 </resource>
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International