Solution Extraction with the “Critical Path” in Graphplan-Based Optimal Temporal Planning
- Cite this paper as:
- Dinh T.B. (2004) Solution Extraction with the “Critical Path” in Graphplan-Based Optimal Temporal Planning. In: Wallace M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg
In AI planning, given the initial state, the goal state and a set of actions, a solution of the problem is a sequence of actions which takes the initial state to the goal state, i.e. a plan. The field has been studied and significantly improved since the past few years. Many state of the art planning systems, such as Graphplan, FF, GP-CSP, TGP, TPSYS, TP4, TLPlan, STAN, LPGP, have shown their good performance on different planning domains. Scientists continue studying to deal with bigger and more complex planning domains which include the explicit modelling of time, resources.