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.
Modern AI planners use different strategies to simplify the complexity of current planning problems and turn them more affordable. In this paper, we present a new approach that divides the planning search into two consecutive stages. First, a sequential plan is generated by relaxing the numeric features of actions, thus ignoring the scheduling part of the problem. Second, this plan is parallelised while the satisfaction of numeric constraints is guaranteed, thus including the scheduling part of the problem. In our experiments, we have studied/identified classes of problems where this division is more appropriate and effective w.r.t. the plan quality.
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.