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.

• Type: Journal
• Year: 2012
• Where: CORR
• Authors: Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
• Keywords: Algorithmic Theory, Computational Geometry, CORR 2012, Education, Markov Decision Processes