As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
State trajectory and plan preference constraints are the two language features recently introduced to PDDL in the context of the 5th international planning competition. For planning with soft constraints, an objective function monitors their violation. This paper introduces a symbolic approach for finding cost-optimal plans. The set-based branch-and-bound algorithm exploits an efficient symbolic representation of the objective function. State trajectory constraints are compiled into automata, while ordinary preferences are evaluated on-line for the intersection of the search frontier with the goal.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.