home › event - computing policies and performance bounds for deterministic dynamic programs using mixed integer programming

EVENT:

Computing policies and performance bounds for deterministic dynamic programs using mixed integer programming
Conferences & Talks

ACC 2011

4 February 2011

 

description

We present a method for computing control policies and performance bounds for deterministic finite-state/finite-action dynamic programs, with the infinite horizon discounted cost, using a receding horizon approach. The computations are done by solving mixed integer programs of moderate size. The efficacy of the proposed technique is demonstrated on a job-shop scheduling example.

 

upcoming events   view all 

Aston Martin: The Brand Journey of a 100 Year-old Startup
Mr. Simon Sproule
29 August 2016
PARC Forum  

A Low-cost and Innovative Radar “Digital Eye”
Bernard Casse
20 September 2016 - 22 September 2016 | Brussels, Belgium
Conferences & Talks  

Stanford and PARC host Digital Cities Summit 2016
Victoria Bellotti, Panel Facilitator, Bernard Casse, Panelist, Sean Garner, Panelist, Stephen Hoover, Keynote Speaker, Matthew Klenk, Tolga Kurtoglu, Panel Facilitator, Markus Larsson, Speaker, Ersin Uzun, Panelist
3 October 2016 - 4 October 2016 | Stanford, CA
Conferences & Talks