Constrained Reachability and Trajectory Generation for Flat Systems
Publications associées (39)
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.
We consider the problem of distributed estimation, where a set of nodes are required to collectively estimate some parameter of interest. We motivate and propose new versions of the diffusion LMS algorithm, including a version that outperforms previous sol ...
New entrants in postal markets usually set up delivery networks by concentrating on urban areas and large business customers. This implies that they operate their network highly centralized - at least in early phases of entrance. ...
We present a method for retrieving illuminant spectra from a set of images taken with a fixed location camera, such as a surveillance or panoramic one. In these images, there will be significant changes in lighting conditions and scene content, but there w ...
Limits on the storage space or the computation time restrict the applicability of model predictive controllers (MPC) in many real problems. Currently available methods either compute the optimal controller online or derive an explicit control law. In this ...
Institute of Electrical and Electronics Engineers2011
This paper defines the problem of Scalable Secure Computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a function f : V -> U of their inputs in a set of constant size, in a sca ...
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010
Limits on the storage space or the computation time restrict the applicability of model predictive controllers (MPC) in many real problems. Currently available methods either compute the optimal controller online or derive an explicit control law. In this ...
This paper aims to maximize the profitability of a set of brand SKUs stocked at a particular retailer by optimizing the number of facings for each product. Based on the past data, a set of variables such as retail price of different SKUs, linear footage th ...
The k-set-agreement problem consists for a set of n processes to agree on less than k among n possibly different Values, each initially known to only one process. The problem is at the heart of distributed computing and generalizes the celebrated consensus ...
In the origin detection problem an algorithm is given a set S of documents, ordered by creation time, and a query document D. It needs to output for every consecutive sequence of k alphanumeric terms in D the earliest document in S in which the sequence ap ...
Former PhD students, post-docs and junior researchers of the Section de chimie et biochimie now holding positions at different universities and private companies remember the time they spent in Geneva and give an account of how this has set off and influen ...