Dinh, Tien Ba (2005) Solution extraction with the “critical path” in graphplan-based optimal temporal planning. Principles and Practice of Constraint Programming – CP 2004, 3258. p. 793. ISSN 0302-9743

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

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email