Concept

Programmation dynamique

Publications associées (204)

Primal-Dual Contextual Bayesian Optimization for Control System Online Optimization with Time-Average Constraints

Colin Neil Jones, Yuning Jiang, Bratislav Svetozarevic, Wenjie Xu

This paper studies the problem of online performance optimization of constrained closed-loop control systems, where both the objective and the constraints are unknown black-box functions affected by exogenous time-varying contextual disturbances. A primal- ...

New York2023

Electrofacies using well logs play a vital role in reservoir characterization. Often, they are sorted into clusters according to the self-similarity of input logs and do not capture the known underlying physical process. In this paper, we propose an unsupe ...

SOC PETROPHYSICISTS & WELL LOG ANALYSTS-SPWLA2023

A wind tunnel study on cyclic yaw control in a wind farm model

Fernando Porté Agel, Guiyue Duan

Dynamic control strategies, such as dynamic induction control [1], were reported as efficient and beneficial in improving wind farm power production. A recent work based on computational fluid dynamics simulation [2] shows that by controlling wake meanderi ...

2023

Policy Gradient Algorithms for Robust MDPs with Non-Rectangular Uncertainty Sets

Daniel Kuhn, Mengmeng Li, Tobias Sutter

We propose a policy gradient algorithm for robust infinite-horizon Markov Decision Processes (MDPs) with non-rectangular uncertainty sets, thereby addressing an open challenge in the robust MDP literature. Indeed, uncertainty sets that display statistical ...

2023

, , , ,

The ability to control high-voltage actuator arrays relies, to date, on expensive microelectronic processes or on individual wiring of each actuator to a single off-chip high-voltage switch. Here we present an alternative approach that uses on-chip photoco ...

SPRINGERNATURE2023

Outlier-free spline spaces for isogeometric discretizations of biharmonic and polyharmonic eigenvalue problems

Espen Sande

We present outlier-free isogeometric Galerkin discretizations of eigenvalue problems related to the biharmonic and the polyharmonic operator in the univariate setting. These are Galerkin discretizations in certain spline subspaces that provide accurate app ...

Lausanne2023

Social Engagement is a novel business model transforming final users of a service from passive into active components. In this framework, people are contacted by a company and they are asked to perform tasks in exchange for a reward. This arises the compli ...

IEEE2022

One Fuzz Doesn’t Fit All: Optimizing Directed Fuzzing via Target-tailored Program State Restriction

Mathias Josef Payer

Fuzzing is the de-facto default technique to discover software flaws, randomly testing programs to discover crashing test cases. Yet, a particular scenario may only care about specific code regions (for, e.g., bug reproduction, patch or regression testing) ...

ASSOC COMPUTING MACHINERY2022

Optimal Policies for Age and Distortion in a Discrete-Time Model

Emre Telatar, Yunus Inan, Reka Inovan

We propose a simple model to study the tradeoff between timeliness and distortion, where different pieces of data have a different cost of not being sent. We pose the question of finding the optimal tradeoff as a policy design problem amenable to dynamic p ...

2021

Optimal Policies for Age and Distortion in a Discrete-Time Model

Emre Telatar, Yunus Inan, Reka Inovan

IEEE2021

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