Strategic Planning through Model Checking of ATL Formulae

L. Rutkowski (Editor), W.J. Jamroga, J. Siekmann (Editor), R. Tadeusiewicz (Editor), L.A. Zadeh (Editor)

    Research output: Contribution to conferencePaperAcademicpeer-review

    Abstract

    Model checking of temporal logic has already been proposed for automatic planning. In this paper, we introduce a simple adaptation of the ATL model checking algorithm that returns a strategy to achieve given goal. We point out that the algorithm generalizes minimaxing, and that ATL models generalize traditional game trees. The paper ends with suggestions about other game theory concepts that can be transfered to ATL-based planning. Keywords: Multi-agent systems, multi-agent planning, model checking.
    Original languageEnglish
    Pages879-884
    Number of pages6
    DOIs
    Publication statusPublished - 2004
    Event7th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2004 - Zakopane, Poland
    Duration: 7 Jun 200411 Jun 2004
    Conference number: 7

    Workshop

    Workshop7th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2004
    Abbreviated titleICAISC
    CountryPoland
    CityZakopane
    Period7/06/0411/06/04

    Keywords

    • HMI-IA: Intelligent Agents
    • Multi-agent systems
    • Multi-agent planning
    • Model checking

    Fingerprint Dive into the research topics of 'Strategic Planning through Model Checking of ATL Formulae'. Together they form a unique fingerprint.

    Cite this