18 search results - page 2 / 4 » Strategy Improvement for Concurrent Reachability Games |
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to ...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
FOSSACS
2012
Springer
12 years 25 days ago
2012
Springer
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...
ICALP
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players...
IROS
2009
IEEE
13 years 11 months ago
2009
IEEE
— In previous work we presented a multi-robot strategy for routing missions in large scenarios where network connectivity must be explicitly preserved. This strategy is founded o...