A stochastic reach-avoid problem with random obstacles
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.
The consistency of certain identification methods for Linear Parameter Varying systems is considered. More precisely, methods for the identification of SISO input-output models are analysed. In order to perform a consistency analysis the application of erg ...
In the context of dynamic optimization, plant variations necessitate adaptation of the input profiles in order to guarantee both feasible and optimal operation. For those problems having path constraints, two sets of directions can be distinguished in the ...
Given three or four synchronized videos taken at eye level and from different angles, we show that we can effectively use dynamic programming to accurately follow up to six individuals across thousands of frames in spite of significant occlusions. In addit ...
The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch-and-price algorithms for vehicle-routing problems with additional constraints. We address the optimization of the RCESPP and we present and compare ...
State-feedback model predictive control (MPC) of discrete-time linear periodic systems with possibly time-dependent state and control input dimension is considered. States and inputs are subject to hard, mixed, polytopic constraints. It is described how di ...
This paper investigates the limit behavior of Markov decision processes made of independent particles evolving in a common environment, when the number of particles goes to infinity. In the finite horizon case or with a discounted cost and an infinite hori ...
The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. We address the optimization of the RCESPP and we present and compare ...
Given two to four synchronized video streams taken at eye level and from different angles, we show that we can effectively combine a generative model with dynamic programming to accurately follow up to six individuals across thousands of frames in spite of ...
Institute of Electrical and Electronics Engineers2008
This thesis deals with dynamic optimization of batch processes, i.e. processes that are characterized by a finite time of operation and the frequent repetition of batches. The objective is to maximize the quantity of the desired product at final time while ...
Reordering the eigenvalues of a periodic matrix pair is a computational task that arises from various applications related to discrete-time periodic descriptor systems, such as pole placement or linear-quadratic optimal control. However, it is also implici ...
