Abstract
We consider control design for positive compartmental systems in which each compartment's outflow rate is described by a concave function of the amount of material in the compartment. We address the problem of determining the routing of material between compartments to satisfy time-varying state constraints while ensuring that material reaches its intended destination over a finite time horizon. We give sufficient conditions for the existence of a time-varying state-dependent routing strategy which ensures that the closed-loop system satisfies basic network properties of positivity, conservation and interconnection while ensuring that capacity constraints are satisfied, when possible, or adjusted if a solution cannot be found. These conditions are formulated as a linear programming problem. Instances of this linear programming problem can be solved iteratively to generate a solution to the finite horizon routing problem. Results are given for the application of this control design method to an example problem. Published by Elsevier Ltd.
Original language | English (US) |
---|---|
Pages (from-to) | 357-368 |
Number of pages | 12 |
Journal | Automatica |
Volume | 68 |
DOIs | |
State | Published - Jun 1 2016 |
Keywords
- Control of networks
- Controller constraints and structure
- Linear programming
- Positive systems
ASJC Scopus subject areas
- Control and Systems Engineering
- Electrical and Electronic Engineering