Sciweavers

Share
CORR
2012
Springer

A Faster Algorithm for Solving One-Clock Priced Timed Games

7 years 7 months ago
A Faster Algorithm for Solving One-Clock Priced Timed Games
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced timed games can be solved in time m12n nO(1) , where n is the number of states and m is the number of actions. The best previously known time bound for solving one-clock priced timed games was 2O(n2 +m) , due to Rutkowski. For our improvement, we introduce and study a new algorithm for solving One-clock Priced Timed Games, based on the sweep-line technique from computational geometry. The analysis is based on the strategy iteration paradigm from the algorithmic theory of Markov decision processes. As a corollary, we also improve the analysis of previous algorithms due to Bouyer, Cassez, Fleury, and Larsen; and Alur, Bernadsky, and Madhusudan.
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter
Added 20 Apr 2012
Updated 20 Apr 2012
Type Journal
Year 2012
Where CORR
Authors Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
Comments (0)
books