; >?Oh+'0HP|
$TU Delft Repository search results0TU Delft Repository search results (max. 1000)TU Delft LibraryTU Delft Library@#6@#6՜.+,0HPX`hp
x
WorksheetFeuilles de calcul
B=%r8X"1Calibri1Calibri1Calibri1
Calibri 83ffff̙̙3f3fff3f3f33333f33333.VTU Delft Repositoryg\*uuidrepository linktitleauthorcontributorpublication yearabstract
subject topiclanguagepublication type publisherisbnissnpatent
patent statusbibliographic noteaccess restrictionembargo datefaculty
departmentresearch group programmeprojectcoordinates)uuid:bb91b0cf-9ce5-4470-a326-b61885d34988Dhttp://resolver.tudelft.nl/uuid:bb91b0cf-9ce5-4470-a326-b61885d34988;Towards a Dynamic Algorithm for the Simple Temporal ProblemTen Thije, J.O.A.0De Weerdt, M.M. (mentor); Planken, L.R. (mentor)Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, many solvers employ a heuristic-driven backtracking approach, over the course of which they maintain a so-called Simple Temporal Network (STN) of events and constraints. Recent research has shown that partial path consistency (PPC) can be used to efficiently propagate temporal information in such networks. This insight was applied in the IPPC algorithm, which enforces PPC in an incremental fashion when new constraints are introduced. We present two new algorithms that efficiently enforce PPC in modified STNs. Vertex-IPPC allows the incremental introduction of an event and all its associated constraints at once. Conversely, Support-DPPC allows the removal or loosening of existing constraints. To the best of our knowledge, this is the first decremental algorithm for enforcing PPC. Our ultimate goal is a fully dynamic algorithm for PPC, supporting on-line deletions as well as additions. This will allow solvers to efficiently explore the solution space, rather than solving entire networks after each update.<Constraint Satisfaction; Simple Temporal Problem; Schedulingen
master thesis8Electrical Engineering, Mathematics and Computer ScienceSoftware Technology)uuid:1baa5d42-e81d-42f3-89a0-63b73178c77cDhttp://resolver.tudelft.nl/uuid:1baa5d42-e81d-42f3-89a0-63b73178c77c1Resolving Disruptions in Simple Temporal Problems Oei, L.I.2Steenhuisen, J.R. (mentor); Witteveen, C. (mentor)8Simple Temporal Problems (STPs) can be used for representation of and reasoning with temporal constraint satisfaction problems. In dynamic environments, it often happens that - after a problem has been modelled as an STP - a change occurs in one of the constraints. This can lead to an inconsistent situation, in which case there are negative cycles in the distance graph representation of the STP. In this thesis, we discuss heuristic algorithms for solving such disruptions in STPs. More specifically, we try to find a minimum set of constraints that has to be changed to remove all negative cycles from the distance graph. First, we give an overview of known approaches for solving disruptions in STPs. After that, we present some new algorithms. We look at the basic case, in which constraints may entirely be removed from the graph. Then, we discuss the case in which preferences are added to the model. Furthermore, we investigate the situation in which a single constraint is known to be the source of the inconsistency, and we want to repair the STP without changing this specific constraint. Finally, we empirically evaluate the performance of our algorithms for the basic case, and for repairing an STP with a known source of inconsistency. In these experiments, our new algorithms are shown to outperform existing algorithms.lSimple Temporal Problem; Simple Temporal Network; temporal planning; plan repair; negative cycle elimination
*+&ffffff?'ffffff?(?)?"dXX333333?333333?U}}}}}}}}}} }
}}}
}}}}}}}}}}}}
l@
!
"
#
$
%
&
'd@
(
)
!
"
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~>@ddyKyKhttp://resolver.tudelft.nl/uuid:bb91b0cf-9ce5-4470-a326-b61885d34988yKyKhttp://resolver.tudelft.nl/uuid:1baa5d42-e81d-42f3-89a0-63b73178c77cgg
Root Entry F#6#6@SummaryInformation( F<Workbook F^tDocumentSummaryInformation8 F
!"#$%&'()*+,-./0123456789:;<=