University of Cambridge > Talks.cam > CUED Control Group Seminars > Constant-Factor Approximation Algorithms for Stochastic Control

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Constant-Factor Approximation Algorithms for Stochastic Control

Download to your calendar using vCal

If you have a question about this talk, please contact Dr Guy-Bart Stan .

For many control problems, computation of the optimal controller is intractable. Our objective in this research is to develop simple algorithms for computing approximately optimal polices, and show that the resulting cost achieved is close to the optimal achievable cost.

We present a a simple way to compute upper and lower bounds on the performance of stochastic control systems. We consider Markov decision processes over general state spaces, and our approach allows any function to be used as an approximate Hamilton-Jacobi solution.

We give a number of examples including event-based sampling, dynamic planning for multiple vehicles, decentralized decision problems and queuing. For each of these we construct a decentralized policy and give a bound on the ratio of the cost achieved to the optimal achievable cost.

This talk is part of the CUED Control Group Seminars series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on Saturdays: 7632.3362069 kWh Average on Sundays: 7259.40082645 kWh Whipple Museum of the History of Science

Other talks

Feedback and the circumgalactic medium CSAR lecture: 46&: Development of a probiotic that supports the natural removal of forever chemicals from the body Title to be confirmed Pancreatic cancer - the clinical challenge;  Why the microenvironment matters during pancreatic cancer progression and treatment Title to be confirmed Welfare Reform and the Imperative of Cooperation
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity