17,646 research outputs found
Low-Complexity Distributed Predictive Automatic Generation Control with Guaranteed Properties
An automatic generation control scheme for multiarea
power systems is presented, based on the technique of
distributed model predictive control. Local area controllers solve
nested MPC problems in order to regulate states to steady values,
and reject the disturbances induced by tie-line interactions. The
approach achieves guaranteed constraint satisfaction, recursive
feasibility of the MPC problems and stability, while maintaining
on-line complexity similar to conventional MPC. A rigorous
off-line design methodology is given for selecting controller
parameters, and is demonstrated on an example 4-area system
Stochastic Constraint Programming
To model combinatorial decision problems involving uncertainty and
probability, we introduce stochastic constraint programming. Stochastic
constraint programs contain both decision variables (which we can set) and
stochastic variables (which follow a probability distribution). They combine
together the best features of traditional constraint satisfaction, stochastic
integer programming, and stochastic satisfiability. We give a semantics for
stochastic constraint programs, and propose a number of complete algorithms and
approximation procedures. Finally, we discuss a number of extensions of
stochastic constraint programming to relax various assumptions like the
independence between stochastic variables, and compare with other approaches
for decision making under uncertainty.Comment: Proceedings of the 15th Eureopean Conference on Artificial
Intelligenc
The complexity of the list homomorphism problem for graphs
We completely classify the computational complexity of the list H-colouring
problem for graphs (with possible loops) in combinatorial and algebraic terms:
for every graph H the problem is either NP-complete, NL-complete, L-complete or
is first-order definable; descriptive complexity equivalents are given as well
via Datalog and its fragments. Our algebraic characterisations match important
conjectures in the study of constraint satisfaction problems.Comment: 12 pages, STACS 201
An Improved Constraint-Tightening Approach for Stochastic MPC
The problem of achieving a good trade-off in Stochastic Model Predictive
Control between the competing goals of improving the average performance and
reducing conservativeness, while still guaranteeing recursive feasibility and
low computational complexity, is addressed. We propose a novel, less
restrictive scheme which is based on considering stability and recursive
feasibility separately. Through an explicit first step constraint we guarantee
recursive feasibility. In particular we guarantee the existence of a feasible
input trajectory at each time instant, but we only require that the input
sequence computed at time remains feasible at time for most
disturbances but not necessarily for all, which suffices for stability. To
overcome the computational complexity of probabilistic constraints, we propose
an offline constraint-tightening procedure, which can be efficiently solved via
a sampling approach to the desired accuracy. The online computational
complexity of the resulting Model Predictive Control (MPC) algorithm is similar
to that of a nominal MPC with terminal region. A numerical example, which
provides a comparison with classical, recursively feasible Stochastic MPC and
Robust MPC, shows the efficacy of the proposed approach.Comment: Paper has been submitted to ACC 201
On generalized terminal state constraints for model predictive control
This manuscript contains technical results related to a particular approach
for the design of Model Predictive Control (MPC) laws. The approach, named
"generalized" terminal state constraint, induces the recursive feasibility of
the underlying optimization problem and recursive satisfaction of state and
input constraints, and it can be used for both tracking MPC (i.e. when the
objective is to track a given steady state) and economic MPC (i.e. when the
objective is to minimize a cost function which does not necessarily attains its
minimum at a steady state). It is shown that the proposed technique provides,
in general, a larger feasibility set with respect to existing approaches, given
the same computational complexity. Moreover, a new receding horizon strategy is
introduced, exploiting the generalized terminal state constraint. Under mild
assumptions, the new strategy is guaranteed to converge in finite time, with
arbitrarily good accuracy, to an MPC law with an optimally-chosen terminal
state constraint, while still enjoying a larger feasibility set. The features
of the new technique are illustrated by three examples.Comment: Part of the material in this manuscript is contained in a paper
accepted for publication on Automatica and it is subject to Elsevier
copyright. The copy of record is available on http://www.sciencedirect.com
Logic Programming Applications: What Are the Abstractions and Implementations?
This article presents an overview of applications of logic programming,
classifying them based on the abstractions and implementations of logic
languages that support the applications. The three key abstractions are join,
recursion, and constraint. Their essential implementations are for-loops, fixed
points, and backtracking, respectively. The corresponding kinds of applications
are database queries, inductive analysis, and combinatorial search,
respectively. We also discuss language extensions and programming paradigms,
summarize example application problems by application areas, and touch on
example systems that support variants of the abstractions with different
implementations
- …