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 language | English |
---|---|
Pages | 879-884 |
Number of pages | 6 |
DOIs | |
Publication status | Published - 2004 |
Event | 7th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2004 - Zakopane, Poland Duration: 7 Jun 2004 → 11 Jun 2004 Conference number: 7 |
Workshop
Workshop | 7th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2004 |
---|---|
Abbreviated title | ICAISC |
Country/Territory | Poland |
City | Zakopane |
Period | 7/06/04 → 11/06/04 |
Keywords
- HMI-IA: Intelligent Agents
- Multi-agent systems
- Multi-agent planning
- Model checking