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

详细信息	查看全文 | 推荐本文 |

• 作者：Heather Arneson ^{arneson2@illinois.edu}  ; [Author Vitae] ; Cé ; dric Langbort ^{langbort@illinois.edu}  ; [Author Vitae]
• 关键词：Linear programming ; Control of networks ; Positive systems ; Controller constraints and structure
• 刊名：Automatica
• 出版年：2012
• 期刊代码：13_00051098
• 类别：cp
• 出版时间：May, 2012
• 卷：48
• 期：5
• 页码：800-807
• 文件大小：467 K

摘要

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 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.