5,129 research outputs found
Plug-and-Play Model Predictive Control based on robust control invariant sets
In this paper we consider a linear system represented by a coupling graph
between subsystems and propose a distributed control scheme capable to
guarantee asymptotic stability and satisfaction of constraints on system inputs
and states. Most importantly, as in Riverso et al., 2012 our design procedure
enables plug-and-play (PnP) operations, meaning that (i) the addition or
removal of subsystems triggers the design of local controllers associated to
successors to the subsystem only and (ii) the synthesis of a local controller
for a subsystem requires information only from predecessors of the subsystem
and it can be performed using only local computational resources. Our method
hinges on local tube MPC controllers based on robust control invariant sets and
it advances the PnP design procedure proposed in Riverso et al., 2012 in
several directions. Quite notably, using recent results in the computation of
robust control invariant sets, we show how critical steps in the design of a
local controller can be solved through linear programming. Finally, an
application of the proposed control design procedure to frequency control in
power networks is presented
Certainty Closure: Reliable Constraint Reasoning with Incomplete or Erroneous Data
Constraint Programming (CP) has proved an effective paradigm to model and
solve difficult combinatorial satisfaction and optimisation problems from
disparate domains. Many such problems arising from the commercial world are
permeated by data uncertainty. Existing CP approaches that accommodate
uncertainty are less suited to uncertainty arising due to incomplete and
erroneous data, because they do not build reliable models and solutions
guaranteed to address the user's genuine problem as she perceives it. Other
fields such as reliable computation offer combinations of models and associated
methods to handle these types of uncertain data, but lack an expressive
framework characterising the resolution methodology independently of the model.
We present a unifying framework that extends the CP formalism in both model
and solutions, to tackle ill-defined combinatorial problems with incomplete or
erroneous data. The certainty closure framework brings together modelling and
solving methodologies from different fields into the CP paradigm to provide
reliable and efficient approches for uncertain constraint problems. We
demonstrate the applicability of the framework on a case study in network
diagnosis. We define resolution forms that give generic templates, and their
associated operational semantics, to derive practical solution methods for
reliable solutions.Comment: Revised versio
- …