bds : 0101 MPC for discrete-event systems with soft and hard synchronisation constraints ∗

Discrete-event systems with only synchronisation and no concurrency, also known as timed event graphs or (max,+)-linear systems, have been studied by several authors. The synchronisation constraints that arise in these discrete-event systems are hard, i.e., they cannot be broken under any circumstance. In this paper we consider a more extended class of discrete-event systems with both hard and soft synchronisation constraints, i.e., if necessary, some synchronisation conditions may be broken, but then a penalty is incurred. We show how the model predictive control (MPC) framework, which is a very popular controller design method in the process industry, can be extended to this class of discrete-event systems. In general, the MPC control design problem for discrete-event systems with soft and hard synchronisation constraints leads to a nonlinear non-convex optimisation problem. We show that the optimal MPC strategy can also be computed using an extended linear complementarity problem.

[1]  B. D. Schuttera,et al.  On the equivalence of linear complementarity problems , 2002 .

[2]  Yu-Chi Ho,et al.  Discrete event dynamic systems : analyzing complexity and performance in the modern world , 1992 .

[3]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[4]  Bernd Heidergott,et al.  Towards a (Max,+) Control Theory for Public Transportation Networks , 2001, Discret. Event Dyn. Syst..

[5]  Jan M. Maciejowski,et al.  Predictive control : with constraints , 2002 .

[6]  Joos Vandewalle,et al.  The generalized linear complementarity problem and an algorithm to find all its solutions , 1992, Math. Program..

[7]  Stephen J. Wright,et al.  Nonlinear Predictive Control and Moving Horizon Estimation — An Introductory Overview , 1999 .

[8]  Willi Hock,et al.  Lecture Notes in Economics and Mathematical Systems , 1981 .

[9]  Laurence A. Wolsey,et al.  bc–opt: a branch-and-cut code for mixed integer programs , 1999, Math. Program..

[10]  M. Seetharama Gowda,et al.  The extended linear complementarity problem , 1995, Math. Program..

[11]  Sven Leyffer,et al.  Numerical Experience with Lower Bounds for MIQP Branch-And-Bound , 1998, SIAM J. Optim..

[12]  Christos G. Cassandras,et al.  Hybrid Controllers for Hierarchically Decomposed Systems , 2000, HSCC.

[13]  Bart De Schutter,et al.  Model predictive control for max-plus-linear discrete event systems , 2001, Autom..

[14]  Johannes Schumacher,et al.  An Introduction to Hybrid Dynamical Systems, Springer Lecture Notes in Control and Information Sciences 251 , 1999 .

[15]  Bart De Schutter,et al.  Optimal Control of a Class of Linear Hybrid Systems with Saturation , 1999, SIAM J. Control. Optim..

[16]  B. Schutter,et al.  MAX-PLUS-ALGEBRAIC PROBLEMS AND THE EXTENDED LINEAR COMPLEMENTARITY PROBLEM — ALGORITHMIC ASPECTS , 2002 .