On the encoding and solving partial information games - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2018

On the encoding and solving partial information games

Abstract

In this paper we address partial information games restricted to memoryless strategies. Our contribution is threefold. First, we prove that for partial information games, deciding the existence of memoryless strategies is NP-complete, even for games with only reachability objectives. The second contribution of this paper is a SAT/SMT-based encoding of a partial information game altogether with the correctness proof of this encoding. Finally, we apply our methodology to automatically synthesize strategies for oblivious mobile robots. We first prove that synthesizing memoryless strategies is equivalent to providing a distributed protocol for the robots. Then, we use an SMT-solver to synthesize strategies for the gathering problem in a particular configuration ($SP_4$), open case in distributed computing theory for more than a decade. Interestingly, our work is the first that combines two-player games theory and SMT-solvers in the context of mobile robots with promising results and therefore it is highly valuable for distributed computing theory where a broad class of open problems are still to be investigated.
Fichier principal
Vignette du fichier
main.pdf (250.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01790508 , version 1 (20-05-2018)

Identifiers

  • HAL Id : hal-01790508 , version 1

Cite

Yackolley Amoussou-Guenou, Souheib Baarir, Maria Potop-Butucaru, Nathalie Sznajder, Leo Tible, et al.. On the encoding and solving partial information games. [Research Report] LIP6, Sorbonne Université, CNRS, UMR 7606; LINCS; CEA Paris Saclay; Sorbonne Université. 2018. ⟨hal-01790508⟩
383 View
164 Download

Share

Gmail Facebook X LinkedIn More