A linear programming approach to routing control in networks of constrained linear positive systems

Heather Arneson, Cédric Langbort

Research output: Contribution to journalArticlepeer-review

Abstract

We study routing control in dynamic continuous-time networks in which each node is described by a linear internally positive system. We derive a linear programming (LP) characterization of optimal constant routing policies for the infinite-horizon routing problem under weighted l 1 constraints and objective. For finite horizon problems with piecewise constant state constraints, we provide sufficient feasibility conditions, which also take the form of an LP problem. We illustrate the solution for the finite horizon problem in an application example.

Original languageEnglish (US)
Pages (from-to)800-807
Number of pages8
JournalAutomatica
Volume48
Issue number5
DOIs
StatePublished - May 2012

Keywords

  • Control of networks
  • Controller constraints and structure
  • Linear programming
  • Positive systems

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A linear programming approach to routing control in networks of constrained linear positive systems'. Together they form a unique fingerprint.

Cite this