A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
HTN Planning as Heuristic Progression Search
2020
The Journal of Artificial Intelligence Research
Preserved Fulltext
In this article, we propose the use of progression search as basis for heuristic HTN planning systems. ...
The majority of search-based HTN planning systems can be divided into those searching a space of partial plans (a plan space) and those performing progression search, i.e., that build the solution in a ...
In this article, we propose the use of progression-based search as basis for heuristic HTN planning systems. ...
doi:10.1613/jair.1.11282
fatcat:5pw3r3ciwjhqtefm6lo4huyrd4
The PANDA Framework for Hierarchical Planning
2021
Künstliche Intelligenz
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Besides solvers for planning problems based on plan space search, progression search, and translation to propositional logic, it also includes techniques for related problems like plan repair, plan and ...
AbstractDuring the last years, much progress has been made in hierarchical planning towards domain-independent systems that come with sophisticated techniques to solve planning problems instead of relying ...
Heuristic Search in Plan Space In HTN planning, there are two standard search techniques, plan space search and progression search, which is similar to state space search in classical planning. ...
doi:10.1007/s13218-020-00699-y
fatcat:c6odx47a7bbz5ow755o6zaate4
Search Complexities for HTN Planning
2015
Künstliche Intelligenz
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
I characterize HTN planning as a search of a problem space in which each node is an HTN planning problem. ...
So searching for a solution to ≤ 1 -stratifiable problems is in NEXPTIME. 2 We can view the NEXPTIME result as the gap between a blind search of the progression space and using a perfect heuristic to guide ...
doi:10.1007/s13218-015-0396-6
fatcat:2c4tclr5hnb43j5rt6xxfathbe
Customizing the Composition of Actions, Programs, and Web Services with User Preferences
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this setting we conceive of WSC as an Artificial Intelligence planning task. ...
In what follows we identify a set of challenges facing our doctoral research and report on our progress to date in addressing these challenges. ...
Note some of the materials presented here has appeared in parts in previous publications as noted in Figure 1 . ...
doi:10.1007/978-3-642-17749-1_23
fatcat:6q5ws7f2xzcyhjwpoko4ay3xqq
An Admissible HTN Planning Heuristic
2017
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Here, we propose an admissible heuristic for standard HTN planning, which allows to find optimal solutions heuristically. ...
Hierarchical task network (HTN) planning is well-known for being an efficient planning approach. This is mainly due to the success of the HTN planning system SHOP2. ...
As a consequence, the proposed heuristic can cope both with hybrid and with HTN models -i.e., it can be regarded both an HTN as well as a hybrid planning heuristic. ...
doi:10.24963/ijcai.2017/68
dblp:conf/ijcai/BercherBHB17
fatcat:hnzgdtwwbnbellzhzmfaj5hzai
Online Revenue Maximization for Server Pricing
2020
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
RC ADD , RC FF , and RC LMC use progression search with heuristics based on a relaxation by Höller et al. [2018; 2020] Heuristic search-based HTN systems have been combined with Greedy Best First search ...
Our intention is not to use this class to model problems, but to use it to create heuristics by relaxing the HTN planning problem induced by a given search node into a DOF HTN planning problem. ...
doi:10.24963/ijcai.2020/564
dblp:conf/ijcai/HollerBB20
fatcat:b67uqdmi4rh3jhmwcunmex4g3e
On Planning with Preferences in HTN
[article]
2009
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
To compute preferred plans, we propose an approach based on forward-chaining heuristic search. ...
The outcome of our work is a language for specifyin user preferences, tailored to HTN planning, together with a provably optimal preference-based planner, HTNPLAN, that is implemented as an extension of ...
) HTN planning based on forward-chaining heuristic search, that exploits progression to evaluate the satisfaction of preferences during planning; a sound and optimal implementation of an ordered-taskdecomposition ...
arXiv:0909.0682v1
fatcat:nkmy5zlu2bespfsronur3h5inq
Encoding HTN Planning as a Dynamic CSP
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
An encoding of HTN planning problems as a dynamic CSP is presented. We suppose that such encoding would provide a way for search space reduction through constraint propagation. ...
HTN planning From the traditional view of planning, a planning problem is posed as finding of a sequence of actions which transforms a specified initial state of the world into a desired goal state provided ...
An encoding of the HTN planning problem as the DCSP is suggested. We also propose the framework of the backtracking based algorithm for solving such DCSP problem. ...
doi:10.1007/11564751_106
fatcat:vgutctdn25htzjvrcrq3jo7uvi
Risk Awareness in HTN Planning
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Taking Hierarchical Task Network (HTN) planning as a widely used planning technique in real-world applications, one can observe that existing approaches do not account for risk. ...
Finally, we argue that it is possible for HTN planning agents to solve specialised risk-aware HTN planning problems by adapting some existing HTN planning approaches. ...
HTN planning is translated into classical planning to compute heuristics that are then used to guide searching for plans [48, 49] . ...
arXiv:2204.10669v1
fatcat:ukgr4dv7dvhslpjiefmlltr4ga
Optimizing Web Service Composition While Enforcing Regulations
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
To maximize efficiency, we have developed novel search heuristics together with a branch and bound search algorithm that enable the generation of high quality compositions with the performance of state-of-the-art ...
In this paper we present an approach to Web service composition that builds on work using AI planning, and more specifically Hierarchical Task Networks (HTNs), for Web service composition. ...
LTL regulations are enforced by progression of the formula as the plan is constructed (e.g., [23] ). ...
doi:10.1007/978-3-642-04930-9_38
fatcat:ga6eapdfgvbfrd5rfi57mlkwni
Cost-Optimal Algorithms for Planning with Procedural Control Knowledge
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
However, very little effort has been directed towards developing analogous techniques to guide search towards high-quality solutions in hierarchical planning formalisms like HTN planning, which allows ...
There is an impressive body of work on developing heuristics and other reasoning algorithms to guide search in optimal and anytime planning algorithms for classical planning. ...
However, there is little research on search heuristics for forward-search HTN planning [2, 1] . ...
arXiv:1607.01729v2
fatcat:yykg2u3ugnd2bgta6nd4r4ochq
Hierarchical Planning in the IPC
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
As a consequence, the available planners support a widely varying set of features and (almost) none of them can solve (or even parse) any problem developed for another planner. ...
Over the last year, the amount of research in hierarchical planning has increased, leading to significant improvements in the performance of planners. ...
PANDApro ), a progression-based planning system using heuristic search • GTOHP (Ramoul et al. 2017 ), a planner based on intelligent grounding and blind search • HTN2ASP (Dix, Kuter, and Nau 2003) , ...
arXiv:1909.04405v1
fatcat:unam6lhggvhijihwwsc5qa7ysq
Interacting with virtual characters in interactive storytelling
2002
Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 1 - AAMAS '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
We describe the planning techniques used to control autonomous characters, which derive from HTN planning. ...
Another essential aspect of HTN planning is that it is based on forward search while being goal-directed at the same time, as the top-level task is the main goal. ...
Interactive Storytelling requires interleaving planning with execution. We have devised a search algorithm that produces a suitable plan form the HTN. ...
doi:10.1145/544818.544819
fatcat:3sgoxzmr4rg7ngkx2mqy3wpcwy
Interacting with virtual characters in interactive storytelling
2002
Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 1 - AAMAS '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
We describe the planning techniques used to control autonomous characters, which derive from HTN planning. ...
Another essential aspect of HTN planning is that it is based on forward search while being goal-directed at the same time, as the top-level task is the main goal. ...
Interactive Storytelling requires interleaving planning with execution. We have devised a search algorithm that produces a suitable plan form the HTN. ...
doi:10.1145/544741.544819
dblp:conf/atal/CavazzaCM02
fatcat:iw6jsro63jdvnevq6vipg23in4
Character-based interactive storytelling
2002
IEEE Intelligent Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
(Other recent forward-search planning systems, such as the Heuristic Search Planner 10 or MinMin, 11 search forward from the initial state to the goal.) ...
HTN planning Interactive storytelling requires interleaving planning and execution. 2 We have thus devised a search algorithm to produce a suitable plan from the HTN. ...
doi:10.1109/mis.2002.1024747
fatcat:n7welmzqpjh3hl3wmsc5g7keyi
« Previous
Showing results 1 — 15 out of 370 results