Concept

Automate fini déterministe

Publications associées (148)

Novel Design and Implementation of a Neuromuscular Controller on a Hip Exoskeleton for Partial Gait Assistance

Auke Ijspeert, Mohamed Bouri, Ali Reza Manzoori, Andrea Di Russo, Sara Messara

Exoskeletons intended for partial assistance of walking should be able to follow the gait pattern of their users, via online adaptive control strategies rather than imposing predefined kinetic or kinematic profiles. NeuroMuscular Controllers (NMCs) are ada ...

2023

Lower Bounds for Unambiguous Automata via Communication Complexity

Mika Tapani Göös, Weiqiang Yuan

We use results from communication complexity, both new and old ones, to prove lower bounds for unambiguous finite automata (UFAs). We show three results. 1) Complement: There is a language L recognised by an n-state UFA such that the complement language ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022

Nonlinear reconstruction of bioclimatic outdoor-environment dynamics for the Lower Silesia region (SW Poland)

Paolo Perona

Measured meteorological time series are frequently used to obtain information 8 about climate dynamics. We use time series analysis and nonlinear system identification 9 methods in order to assess outdoor-environment bioclimatic conditions starting from th ...

2021

KPC: Learning-Based Model Predictive Control with Deterministic Guarantees

Colin Neil Jones, Yuning Jiang, Paul Scharnhorst, Emilio Maddalena

We propose Kernel Predictive Control (KPC), a learning-based predictive control strategy that enjoys deterministic guarantees of safety. Noise-corrupted samples of the unknown system dynamics are used to learn several models through the formalism of non-pa ...

2021

A Space-Time Adaptive Algorithm to Illustrate the Lack of Collision of a Rigid Disk Falling in an Incompressible Fluid

Marco Picasso, Samuel Dubuis

A space-time adaptive algorithm to solve the motion of a rigid disk in an incompressible Newtonian fluid is presented, which allows collision or quasi-collision processes to be computed with high accuracy. In particular, we recover the theoretical result p ...

WALTER DE GRUYTER GMBH2021

Sample Complexity of Linear Quadratic Gaussian (LQG) Control for Output Feedback Systems

Maryam Kamgarpour, Luca Furieri, Na Li

This paper studies a class of partially observed Linear Quadratic Gaussian (LQG) problems with unknown dynamics. We establish an end-to-end sample complexity bound on learning a robust LQG controller for open-loop stable plants. This is achieved using a ro ...

PMLR2021

Asymptotic decoupling and weak Gibbs measures for finite alphabet shift spaces

For the spaceXin a large class of finite alphabet shift spaces (lattice models) and the class of functionsfwith bounded total oscillations, we prove that each equilibrium measure nu atf=phi is a weak Gibbs measures for phi-P(phi). In addition, the empirica ...

2020

Digital Design with Implicit State Machines

Martin Odersky, Aleksandar Prokopec, Fengyun Liu

Claude Shannon, in his famous thesis (1938), revolutionized circuit design by showing that Boolean algebra subsumes all ad-hoc methods that are used in designing switching circuits, or combinational circuits as they are commonly known today. But what is ...

2020

On the relaxed maximum-likelihood blind MIMO channel estimation for orthogonal space-time block codes

Kamran Kalbasi

This paper concerns the maximum-likelihood channel estimation for MIMO systems with orthogonal space-time block codes when the finite alphabet constraint of the signal constellation is relaxed. We study the channel coefficients estimation subspace generate ...

ELSEVIER2020

Finite element modeling of dynamic frictional rupture with rate and state friction

Jean-François Molinari, Fabian Barras, Roozbeh Rezakhani, Michael Ludovic Brun

Numerous laboratory experiments have demonstrated the dependence of the friction coefficient on the interfacial slip rate and the contact history, a behavior generically called rate and state friction. Although numerical models have been widely used for an ...

PERGAMON-ELSEVIER SCIENCE LTD2020

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