Publication

Stochastic Model Predictive Control: Controlling the Average Number of Constraint Violations

Publications associées (67)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Ordered Sets in the Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Large occlusion completion using normal maps

Pascal Fua, Christoph Strecha, Engin Tola, Andrea Fossati

Dense disparity maps can be computed from wide-baseline stereo pairs but will inevitably contain large areas where the depth cannot be estimated accurately because the pixels are seen in one view only. A traditional approach to this problem is to introduce ...

2010

Blocking parameterizations for improving the computational tractability of affine disturbance feedback MPC problems

Colin Neil Jones

Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can result in computationally intractable problems. So-called move-blocking is a ...

IEEE2009

Modifier-adaptation methodology for real-time optimization

Alejandro Gabriel Marchetti

The process industries are characterized by a large number of continuously operating plants, for which optimal operation is of economic importance. However, optimal operation is particularly difficult to achieve when the process model used in the optimizat ...

EPFL2009

Programming with Undo

Ersoy Bayramoglu

This thesis is about objects that can undo their state changes. Based on an earlier work on data structure persistence, we propose generating undo methods for classes from annotated classes automatically. As opposed to ephemeral data structures, persistent ...

2009

Model predictive path-following for constrained nonlinear systems

Timm Faulwasser, Benjamin Kern

We propose a model predictive control approach to path-following problems of constrained nonlinear systems. We directly consider input and state constraints. Furthermore, we introduce an extended corridor path-following problem, which allows to add spatial ...

IEEE2009

Integration of TDOA Features in Information Bottleneck Framework for Fast Speaker Diarization

Hervé Bourlard, Fabio Valente, Deepu Vijayasenan

In this paper we address the combination of multiple feature streams in a fast speaker diarization system for meeting recordings. Whenever Multiple Distant Microphones (MDM) are used, it is possible to estimate the Time Delay of Arrival (TDOA) for differen ...

IDIAP2008

Decision Procedures for Multisets with Cardinality Constraints

Viktor Kuncak, Ruzica Piskac

Applications in software verification and interactive theorem proving often involve reasoning about sets of objects. Cardinality constraints on such collections also arise in these scenarios. Multisets arise for analogous reasons as sets: abstracting the c ...

Springer2008

Constraint-Level Advice for Shaving

Radoslaw Szymanek

This work concentrates on improving the robustness of constraint solvers by increasing the propagation strength of constraint models in a declarative and automatic manner. Our objective is to efficiently identify and remove shavable values during search. A ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

General Constraints for Batch Multiple-Target Tracking Applied to Large-Scale Videomicroscopy

Vincent Lepetit, Kevin Smith

While there is a large class of Multiple-Target Tracking (MTT) problems for which batch processing is possible and desirable, batch MTT remains relatively unexplored in comparison to sequential approaches. In this paper, we give a principled probabilistic ...

IEEE2008