IPSS: a hybrid approach to planning and scheduling integration

e-Archivo Repository

Show simple item record

dc.contributor.author Rodríguez-Moreno, María Dolores
dc.contributor.author Oddi, Angelo
dc.contributor.author Borrajo, Daniel
dc.contributor.author Cesta, Amedeo
dc.date.accessioned 2010-02-08T14:36:26Z
dc.date.available 2010-02-08T14:36:26Z
dc.date.issued 2006-12
dc.identifier.bibliographicCitation IEEE Transactions on Knowledge and Data Engineering, December 2006, vol. 18, n. 12, p. 1681-1695
dc.identifier.issn 1041-4347
dc.identifier.uri http://hdl.handle.net/10016/6797
dc.description.abstract Recently, the areas of planning and scheduling in artificial intelligence (AI) have witnessed a big push toward their integration in order to solve complex problems. These problems require both reasoning on which actions are to be performed as well as their precedence constraints (planning) and the reasoning with respect to temporal constraints (e.g., duration, precedence, and deadline); those actions should satisfy the resources they use (scheduling). This paper describes IPSS (integrated planning and scheduling system), a domain independent solver that integrates an AI planner that synthesizes courses of actions with constraint-based techniques that reason based upon time and resources. IPSS is able to manage not only simple precedence constraints, but also more complex temporal requirements (as the Allen primitives) and multicapacity resource usage/consumption. The solver is evaluated against a set of problems characterized by the use of multiple agents (or multiple resources) that have to perform tasks with some temporal restrictions in the order of the tasks or some constraints in the availability of the resources. Experiments show how the integrated reasoning approach improves plan parallelism and gains better makespans than some state-of-the-art planners where multiple agents are represented as additional fluents in the problem operators. It also shows that IPSS is suitable for solving real domains (i.e., workflow problems) because it is able to impose temporal windows on the goals or set a maximum makespan, features that most of the planners do not yet incorporate.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.publisher IEEE
dc.rights © IEEE
dc.subject.other Inference mechanisms
dc.subject.other Planning (artificial intelligence)
dc.subject.other Scheduling
dc.title IPSS: a hybrid approach to planning and scheduling integration
dc.type article
dc.type.review PeerReviewed
dc.description.status Publicado
dc.relation.publisherversion http://dx.doi.org/10.1109/TKDE.2006.191
dc.subject.eciencia Informática
dc.identifier.doi 10.1109/TKDE.2006.191
dc.rights.accessRights openAccess
dc.identifier.publicationfirstpage 1681
dc.identifier.publicationissue 12
dc.identifier.publicationlastpage 1695
dc.identifier.publicationtitle IEEE Transactions on Knowledge and Data Engineering
dc.identifier.publicationvolume 18
 Find Full text

Files in this item

*Click on file's image for preview. (Embargoed files's preview is not supported)


This item appears in the following Collection(s)

Show simple item record