The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes
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.
Background: The gene family-free framework for comparative genomics aims at providing methods for gene order analysis that do not require prior gene family assignment, but work directly on a sequence similarity graph. We study two problems related to the b ...
We propose a computational approach to approximate the value function and control poli- cies for a finite horizon stochastic reach-avoid problem as follows. First, we formulate an infinite dimensional linear program whose solution characterizes the optimal ...
This work presents a novel methodology for speeding up the assembly of stiffness matrices for laminate composite 3D structures in the context of isogeometric and finite element discretizations. By splitting the involved terms into their in-plane and out-of ...
We consider linear programming (LP) problems in infinite dimensional spaces that are in general computationally intractable. Under suitable assumptions, we develop an approximation bridge from the infinite-dimensional LP to tractable finite convex programs ...
Deriving the time-dependent expected reward function associated with a continuous-time Markov chain involves the computation of its transient deviation matrix. In this paper we focus on the special case of a finite quasi-birth-and-death (QBD) process, moti ...
Solving hyperbolic conservation laws on general grids can be important to reduce the computational complexity and increase accuracy in many applications. However, the use of non-uniform grids can introduce challenges when using high-order methods. We propo ...
Approximate computing exploits the fact that many applications do not require the results to be exact but not to exceed a threshold in a given error metric. Algorithms in approximate computing require to compute the error of the approximation in order to m ...
Unexpected disruptions occur for many reasons in railway networks and cause delays, cancelations, and, eventually, passenger inconvenience. This research focuses on the railway timetable rescheduling problem from a macroscopic point of view in case of larg ...
This paper presents a coordinated primal-dual interior point (PDIP) method for solving structured convex linear and quadratic programs (LP-QP) in a distributed man- ner. The considered class of problems represents a multi-agent setting, where the aggregate ...
Interactive multiview video streaming (IMVS) services permit to remotely navigate within a 3D scene with an immersive experience. This is possible by transmitting a set of reference camera views (anchor views), which are used by the clients to freely navig ...