Concept
Generic flatness
Related publications (10)
Finite Dimensional Methods for Differential Flatness
In Control System Theory, the study of continuous-time, finite dimensional, underdetermined systems of ordinary differential equations is an important topic. Classification of systems in different categories is a natural initial step to the analysis of a g ...
EPFL2013Feedback Linearizability and Flatness in Restricted Control Systems
Philippe Müllhaupt, Basile Graf
The loss of feedback linearizability of control systems is studied when restricted to a submanifold of the state-space. The slow approximation of singularly perturbed systems also falls into this category. We show that even if the static-feedback lineariza ...
2011Moyennabilité et courbure
As Avez showed (in 1970), the fundamental group of a compact Riemannian manifold of nonpositive sectional curvature has exponential growth if and only if it is not flat. After several generalizations from Gromov, Zimmer, Anderson, Burger and Shroeder, the ...
EPFL2010Jet-Scheduling Control for SpiderCrane: Experimental Results
Dominique Bonvin, Christophe Salzmann, Philippe Müllhaupt, Davide Buccieri
SpiderCrane is a three-dimensional crane, whose main particularity lies in the absence of large inertial moving parts. This paper presents experimental results obtained with the novel jet-scheduling control methodology that is based on differential flatnes ...
2008Groupes de Chow orientés
In this work we study the oriented Chow groups. These groups were defined by J. Barge et F. Morel in order to understand when a projective module P of top rank over a ring A has a free factor of rank one, i.e is isomorphic to Q ⊕ A. We show first that thes ...
EPFL2005Rigorous solution techniques for numerical constraint satisfaction problems
A constraint satisfaction problem (e.g., a system of equations and inequalities) consists of a finite set of constraints specifying which value combinations from given variable domains are admitted. It is called numerical if its variable domains are contin ...
EPFL2005A Generic Scheme for Combining Multiple Inclusion Representations in Numerical Constraint Propagation
This paper proposes a novel generic scheme enabling the combination of multiple inclusion representations to propagate numerical constraints. The scheme allows bringing into the constraint propagation framework the strength of inclusion techniques coming f ...
Swiss Federal Institute of Technology in Lausanne (EPFL)2004Generic homomorphic undeniable signatures
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diffie-Hellman, and RSA. As an application, we propose a generic undeniable sign ...
2004Bayesian Gaussian Process Models: PAC-Bayesian Generalisation Error Bounds and Sparse Approximations
Non-parametric models and techniques enjoy a growing popularity in the field of machine learning, and among these Bayesian inference for Gaussian process (GP) models has recently received significant attention. We feel that GP priors should be part of the ...
University of Edinburgh2003Design Validations for Discrete Logarithm Based Signature Schemes
A number of signature schemes and standards have been recently designed, based on the discrete logarithm problem. Examples of standards are the DSA and the KCDSA. Very few formal design/security validations have already been conducted for both the KCDSA an ...
2000