Bauso, D., Blanchini, F., Giarré, L. et al. (1 more author) (2013) The linear saturated decentralized strategy for constrained flow control is asymptotically optimal. Automatica, 49. 2206 - 2212. ISSN 0005-1098
Abstract
We present an algorithm for constrained network flow control in the presence of an unknown demand. Our algorithm is decentralized in the sense that it is implemented by a team of agents, each controlling just the flow on a single arc of the network based only on the buffer levels at the nodes at the extremes of the arc, while ignoring the actions of other agents and the network topology. We prove that our algorithm is also stabilizing and steady-state optimal. Specifically, we show that it asymptotically produces the minimum-norm flow. We finally generalize our algorithm to networks with a linear dynamics and we prove that certain least-square optimality properties still hold.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2013 Elsevier. This is an author produced version of a paper subsequently published in Automatica. Uploaded in accordance with the publisher's self-archiving policy. Article available under the terms of the CC-BY-NC-ND licence (https://creativecommons.org/licenses/by-nc-nd/4.0/) |
Keywords: | Network optimization; Distributed flow control; Production-distribution systems; Uncertain systems; Minimum norm flow |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Automatic Control and Systems Engineering (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 11 Sep 2015 13:07 |
Last Modified: | 28 Mar 2018 03:17 |
Published Version: | http://dx.doi.org/10.1016/j.automatica.2013.03.029 |
Status: | Published |
Publisher: | Elsevier |
Refereed: | Yes |
Identification Number: | 10.1016/j.automatica.2013.03.029 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:89677 |