Concept

Programmation dynamique

Publications associées (204)

Barycentric Bounds in Stochastic Programming: Theory and Application

The design and analysis of efficient approximation schemes are of fundamental importance in stochastic programming research. Bounding approximations are particularly popular for providing strict error bounds that can be made small by using partitioning tec ...

Springer New York2011

Mean field for Markov Decision Processes: from Discrete to Continuous Optimization

Jean-Yves Le Boudec, Nicolas Gabriel Gast

We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal reward of such a Markov Decision Process, satisfying a Bellman equation, con ...

2010

Selective Input Adaptation in Parametric Optimal Control Problems involving Terminal Constraints

Dominique Bonvin, Benoît Chachuat, Saurabh Anand Deshpande

This paper is concerned with input adaptation in dynamic processes in order to guarantee feasible and optimal operation despite the presence of uncertainty. For optimal control problems having terminal constraints, two sets of directions can be distinguish ...

2010

Evaluation and Design Exploration of Solar Harvested-Energy Prediction Algorithm

David Atienza Alonso

To respond to variations in solar energy, harvestedenergy prediction is essential to harvested-energy management approaches. The effectiveness of such approaches is dependent on both the achievable accuracy and computation overhead of prediction algorithm ...

ACM/IEEE Press2010

Selective Input Adaptation in Parametric Optimal Control Problems with Path Constraints

Dominique Bonvin, Benoît Chachuat, Saurabh Anand Deshpande

This paper is concerned with input adaptation in dynamic processes in order to guarantee feasible and optimal operation despite the presence of uncertainty. For optimal control problems having mixed control-state constraints, two sets of directions can be ...

2010

Partially reflective surface antenna with dynamic beamwidth control

Julien Perruisseau-Carrier, Tomislav Debogovic

The dynamic control of the beamwidth of a partially reflective surface (PRS) antenna is reported for the first time. First, a design methodology is proposed by revisiting the PRS antenna theory from the perspective of its reconfigurable beamwidth operation ...

Institute of Electrical and Electronics Engineers2010

Markov decision processes for services opportunity pipeline optimization

Aurélie Glerum

The dynamics of sales opportunities can be modelled by a Markov Decision Process. The latter can be solved by using dynamic programming and assigns to each state an optimal action. In this project, states are modelled by the number of opportunities at five ...

2010

Caching All Plans with Just One Optimizer Call

Anastasia Ailamaki, Ioannis Alagiannis, Debabrata Dash, Cristina Ileana Maier

Modern database management systems (DBMS) answer a multitude of complex queries on increasingly larger datasets. Given the complexities of the queries and the numerous design features, manual design is no longer an option. Instead, automatically designing ...

2010

Diffusion LMS Strategies for Distributed Estimation

Ali H. Sayed

We consider the problem of distributed estimation, where a set of nodes is required to collectively estimate some parameter of interest from noisy measurements. The problem is useful in several contexts including wireless and sensor networks, where scalabi ...

IEEE2010

Feasibility and modeling of dynamic beamwidth control in partially reflective surface antennas

Julien Perruisseau-Carrier

In this paper we propose the dynamic control of the beamwidth of partially reflective surface (PRS) antennas. Theoretical aspects are presented together with modeling issues. The potential and limitation of the concept are then evaluated. Finally, a detail ...

2010

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