Authors:
Giuseppe Della Penna
1
;
Fabio Mercorio
2
;
Benedetto Intrigila
3
;
Daniele Magazzeni
4
and
Enrico Tronci
5
Affiliations:
1
University of L'Aquila, Italy
;
2
University of L’Aquila, Italy
;
3
University of Rome Tor Vergata, Italy
;
4
University of Chieti-Pescara, Italy
;
5
University of Rome La Sapienza, Italy
Keyword(s):
Non-deterministic systems, Strong planning, Optimal planning.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Formal Methods
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Optimization Algorithms
;
Planning and Scheduling
;
Simulation and Modeling
;
Symbolic Systems
Abstract:
Many real world domains present a non-deterministic behaviour, mostly due to unpredictable environmental conditions. In this context, strong planning, i.e., finding a plan which is guaranteed to achieve the goal regardless of non-determinism, is a significant research challenge for both the planning and the control communities. In particular, the problem of cost-optimal strong planning has not been addressed so far. In this paper we provide a formal description of the cost-optimal strong planning problem in non-deterministic finite state systems, present an algorithm to solve it with good complexity bounds and formally prove the correctness and completeness of the proposed algorithm. Furthermore, we present experimental results showing the effectiveness of the proposed approach on a meaningful case study.