Show simple item record

dc.contributor.authorDimopoulos, Yannisen
dc.contributor.authorGerevini, A.en
dc.contributor.editorVan Hentenryck P.en
dc.creatorDimopoulos, Yannisen
dc.creatorGerevini, A.en
dc.date.accessioned2019-11-13T10:39:54Z
dc.date.available2019-11-13T10:39:54Z
dc.date.issued2002
dc.identifier.issn0302-9743
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/53858
dc.description.abstractTemporal planning is an important problem, as in many real world planning domains actions have different durations and the goals should be achieved by a specified deadline, or as soon as possible. This paper presents a novel approach to temporal planning that is based on Mixed Integer Programming. In the new framework, a temporal planning domain is modeled by two sets of linear inequalities. The first set involves integer variables and is a Graphplan-like encoding of a simplification of the original problem where the duration of the actions is ignored. The second set involves both integer and real valued variables, and models the temporal aspects of the problem. The two sets interact through the common integer variables, and their combination can be solved by using available Mixed Integer Programming software. The new method aims at generating good solutions quickly, under different minimization objectives.Preliminary experimental results illustrate the effectiveness of our approach. © Springer-Verlag Berlin Heidelberg 2002.en
dc.source8th International Conference on Principles and Practice of Constraint Programming, CP 2002en
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84957022221&partnerID=40&md5=0dfb11e61e2c103e008bc502ea586302
dc.subjectComputer programmingen
dc.subjectInteger programmingen
dc.subjectConstraint theoryen
dc.subjectMixed integer programmingen
dc.subjectLinear inequalitiesen
dc.subjectInteger variablesen
dc.subjectMixed integer programming softwaresen
dc.subjectReal-valued variablesen
dc.subjectReal-world planningen
dc.subjectTemporal aspectsen
dc.subjectTemporal planningen
dc.titleTemporal planning through mixed integer programming: A preliminary reporten
dc.typeinfo:eu-repo/semantics/article
dc.description.volume2470
dc.description.startingpage47
dc.description.endingpage62
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeArticleen
dc.description.notes<p>Sponsors: AAAIen
dc.description.notesAssociation for Logic Programming (ALP)en
dc.description.notesCoLogNeten
dc.description.notesCosytecen
dc.description.noteset alen
dc.description.notesILOGen
dc.description.notesConference code: 134519en
dc.description.notesCited By :2</p>en
dc.source.abbreviationLect. Notes Comput. Sci.en
dc.contributor.orcidDimopoulos, Yannis [0000-0001-9583-9754]
dc.gnosis.orcid0000-0001-9583-9754


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record