Sciweavers

59 search results - page 11 / 12
» Approximate abstractions of discrete-time controlled stochas...
Sort
View
CDC
2009
IEEE
166views Control Systems» more  CDC 2009»
14 years 1 months ago
Idempotent method for dynamic games and complexity reduction in min-max expansions
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...
William M. McEneaney
CDC
2009
IEEE
132views Control Systems» more  CDC 2009»
14 years 1 months ago
Q-learning and Pontryagin's Minimum Principle
Abstract— Q-learning is a technique used to compute an optimal policy for a controlled Markov chain based on observations of the system controlled using a non-optimal policy. It ...
Prashant G. Mehta, Sean P. Meyn
SAGA
2009
Springer
14 years 3 months ago
Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
Boris Defourny, Damien Ernst, Louis Wehenkel
CDC
2008
IEEE
112views Control Systems» more  CDC 2008»
13 years 10 months ago
Information fusion strategies from distributed filters in packet-drop networks
Abstract-- In this paper we study different distributed estimation schemes for stochastic discrete time linear systems where the communication between the sensors and the estimatio...
Alessandro Chiuso, Luca Schenato
CDC
2009
IEEE
118views Control Systems» more  CDC 2009»
14 years 1 months ago
Opportunistic scheduling in cellular systems in the presence of non-cooperative mobiles
Abstract— A central scheduling problem in wireless communications is that of allocating resources to one of many mobile stations that have a common radio channel. Much attention ...
Kavitha Veeraruna, Eitan Altman, Rachid El Azouzi,...