Search:
Computing and Library Services - delivering an inspiring information environment

Solution extraction with the “critical path” in graphplan-based optimal temporal planning

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

Metadata only available from this repository.

Abstract

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

Item Type: Article
Additional Information: Published as part of series Lecture Notes in Computer Science
Subjects: T Technology > T Technology (General)
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Schools: School of Computing and Engineering
Related URLs:
Depositing User: Briony Heyhoe
Date Deposited: 21 Jul 2008 16:44
Last Modified: 21 Jul 2008 16:44
URI: http://eprints.hud.ac.uk/id/eprint/1152

Item control for Repository Staff only:

View Item

University of Huddersfield, Queensgate, Huddersfield, HD1 3DH Copyright and Disclaimer All rights reserved ©