Publication

The Strong Integral Input-to-State Stability Property in Dynamical Flow Networks

Publications associées (34)

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

Imitation learning of Globally Stable Non-Linear Point-to-Point Robot Motions using Nonlinear Programming

Aude Billard, Seyed Mohammad Khansari Zadeh

This paper presents a method to learn arbitrary discrete motions from a set of demonstrations. We model a motion as a nonlinear autonomous (i.e. time-invariant) dynamical system, and define the sufficient conditions to make such a system globally asymptoti ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Agent-Based Routing in Queueing Systems

Olivier Gallay

Waiting time in any network is often a costly and hence a bad experience. Therefore, to avoid jamming regions becomes essential in the optimization of traffic flows. In this regard, the conception and the control of complex networks supporting flows of uni ...

EPFL2010

Event-based reduced-attention predictive control for nonlinear uncertain systems

Timm Faulwasser, Benjamin Kern

Event-based control is an alternative to traditional control where new measurements are sampled only if critical events occur. This not only allows to reduce the control effort but it satisfies nowadays application requirements, such for example reduction ...

IEEE2010

Movement Curvature Planning through Force Field Internal Models

Aude Billard, Biljana Petreska von Ritter-Zahony

Human motion studies have focused primarily on modeling straight point-to-point reaching movements. However, many goal-directed reaching movements, such as movements directed towards oneself, are not straight but rather follow highly curved trajectories. T ...

2009

Jet-scheduling control for flat systems

Davide Buccieri

The control of cranes and nonholonomic robots has gained increased interest mainly because of the civilian and military industrial need to achieve fast and accurate transport of goods and equipment. Old and new harbors are now venturing into fully automate ...

EPFL2008

A distributed minimum-distortion routing algorithm with in-network data processing

Ramin Khalili

In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g., a capacity constraint) and to increase the utility of data in the output flows given these constraints. In this paper we focus on the special case in wh ...

2008

State Space Properties of Transitional Pipe Flow

Tobias Schneider

Transition to turbulence in pipe flow has puzzled scientists since the studies of Hagen, Poiseuille and, most prominently, Osborne Reynolds in the nineteenth century. Much of the difficulty in understanding the transition is connected with the linear stabi ...

2007

Movement generation using dynamical systems: a humanoid robot performing a drumming task

Auke Ijspeert, Ludovic Righetti, Sarah Dégallier Rochat

The online generation of trajectories in humanoid robots remains a difficult problem. In this contribution, we present a system that allows the superposition, and the switch between, discrete and rhythmic movements. Our approach uses nonlinear dynamical sy ...

2006

The purpose of this thesis is to show on explicit examples how various theoretical concepts, ranging from statistical mechanics to stochastic control and from traffic theory to queuing systems, can be transferred to transport processes, encountered in part ...

EPFL2005

A Connection between Network Coding and Convolutional Codes

Christina Fragouli, Emina Soljanin

The min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by liner re-encoding at node ...

2004