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.
|Name||Lecture Notes in Computer Science|
|Name||Lecture Notes in Artificial Intelligence|
|Workshop||7th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2004|
|Period||7/06/04 → 11/06/04|
- Multi-agent systems
- Multi-agent planning
- Model checking