A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Plan aggregation for strong cyclic planning in nondeterministic domains
2014
Artificial Intelligence
Preserved Fulltext
We describe a planning algorithm, NDP2, that finds strong-cyclic solutions to nondeterministic planning problems by using a classical planner to solve a sequence of classical planning problems. ...
In our experimental comparisons of NDP2 (using FF as the classical planner) to MBP in six different planning domains, each planner outperformed the other in some domains but not others. ...
Conclusions NDP2, like the earlier NDP algorithm [30] , solves nondeterministic planning problems by calling a classical planner on a sequence of deterministic planning problems, and using the classical ...
doi:10.1016/j.artint.2014.07.007
fatcat:aazaffa2ivcf5j5insnutnlsuu
An Experimental Comparison of Classical, FOND and Probabilistic Planning
[chapter]
2014
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 2015; you can also visit the original URL.
The file type is application/pdf.
We define abstracting translations into a classical planning formalism and fully observable nondeterministic planning. ...
Domain-independent planning in general is broadly applicable to a wide range of tasks. Many formalisms exist that allow the description of different aspects of realistic problems. ...
Introduction Domain-independent planning is used to solve problems from various domains, including tasks from real-world robotics applications. ...
doi:10.1007/978-3-319-11206-0_29
fatcat:twjmzdpenvbjnkfc5vtcwvxiie
FIP: A Fast Planning-Graph-Based Iterative Planner
2008
2008 20th IEEE International Conference on Tools with 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 2010; you can also visit the original URL.
The file type is application/pdf.
We present a fast iterative planner (FIP) that aims to handle planning problems involving nondeterministic actions. ...
Experimental results on several nondeterministic planning problems show that FIP is more efficient than the well-known planner, MBP, especially as the size of the problems increases. ...
We also use a robot tele-control problem to evaluate FIP's ability in solving practical problems. ...
doi:10.1109/ictai.2008.98
dblp:conf/ictai/FuBNYZ08
fatcat:yaijvaiupja3hiu5bsjmdb34qi
Forthcoming Papers
2003
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 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents a complexity analysis of planning under uncertainty. It begins with the "probabilistic classical planning" problem, showing that problem to be formally undecidable. ...
In this paper, we tackle planning in nondeterministic domains by addressing conceptual and practical problems. ...
More generally, they show how to use tools from graph theory to analyze the plan quality of practical planning methods for nondeterministic domains. 2003 Published by Elsevier Science B.V. ...
doi:10.1016/s0004-3702(03)00084-5
fatcat:ywtleopcbffkdcwj5isyi7b6dq
Learning Hierarchical Task Networks for Nondeterministic Planning Domains
2009
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 2022; you can also visit the original URL.
The file type is application/pdf.
magnitude) the well-known planner MBP using the learned HTNs. ...
This paper describes how to learn Hierarchical Task Networks (HTNs) in nondeterministic planning domains, where actions may have multiple possible outcomes. ...
., 2003; Pistore and Traverso, 2001] , nondeterministic planning problems, are still very hard to solve in practice. ...
dblp:conf/ijcai/HoggKM09
fatcat:7mxyhlssgncxhj2c65l74anuea
Pattern-Database Heuristics for Partially Observable Nondeterministic Planning
[chapter]
2013
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 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we investigate how -and how successfully -a particular classical technique, namely informed search using an abstraction heuristic, can be transferred to nondeterministic planning under partial ...
Heuristic search is the dominant approach to classical planning. However, many realistic problems violate classical assumptions such as determinism of action outcomes or full observability. ...
Moreover, we plan to investigate more realistic benchmark problems arising from robotic applications. observability, determinization (FO-Det): This leads to a classical abstract problem that we can solve ...
doi:10.1007/978-3-642-40942-4_13
fatcat:6pph7prkivhnvcivmp22ujdvl4
Hierarchical generation of dynamic and nondeterministic quests in games
2014
Proceedings of the 11th Conference on Advances in Computer Entertainment Technology - ACE '14
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 2017; you can also visit the original URL.
The file type is application/pdf.
The proposed approach combines planning, execution, and monitoring to efficiently handle nondeterministic events and support quests with multiple endings that affect the game's narrative and create interactive ...
Quests are a fundamental storytelling mechanism used by computer role-playing games to engage players in the game's narrative. ...
Therefore, when the player causes changes in the world, the planner recalculate the quest plan using the modified world state as the initial state of a new classical planning problem. ...
doi:10.1145/2663806.2663833
dblp:conf/ACMace/LimaFF14
fatcat:5jq7wui2t5hr5elznhvot4i4li
Task decomposition on abstract states, for planning under nondeterminism
2009
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 2017; you can also visit the original URL.
The file type is application/pdf.
Although several approaches have been developed for planning in nondeterministic domains, solving large planning problems is still quite difficult. ...
In this work, we present a new planning algorithm, called Yoyo, for solving planning problems in fully observable nondeterministic domains. ...
Then, we describe the Yoyo planning algorithm and the mechanisms it uses to generate solutions to nondeterministic planning problems in Sections 3 and 4, respectively. ...
doi:10.1016/j.artint.2008.11.012
fatcat:on4xpu75vbf63brk766wuyrfjm
Searching for Sequential Plans Using Tabled Logic Programming
2015
International Conference of the Italian Association for 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 2022; you can also visit the original URL.
The file type is application/pdf.
Logic programming provides a declarative framework for modeling and solving many combinatorial problems. ...
The paper brings an initial experimental study comparing various approaches to search for sequential plans in the Picat planning module. ...
The authors would like to thank Agostino Dovier and Neng-Fa Zhou for providing some of the domain models in Picat. ...
dblp:conf/aiia/BartakV15
fatcat:4zk53u5krbaf7np6fg7xvkzime
Planning for Temporally Extended Goals in Pure-Past Linear Temporal Logic: A Polynomial Reduction to Standard 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.
Other Versions
deterministic and nondeterministic domains (FOND) remains the same as for classical reachability goals. ...
We devise a technique to polynomially translate planning for PPLTL goals into standard planning. ...
Sec. 4) , studies ppltl and uses it to solve ltl f through mso. ...
arXiv:2204.09960v3
fatcat:zh2gei2ayzeelmo6fd3h5xtr4u
Planning for Interactions among Autonomous Agents
[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 2009; you can also visit the original URL.
The file type is application/pdf.
in the number of contingencies that the planner will need to consider. ...
This paper discusses several ways to alleviate the combinatorial explosion, and illustrates their use in several different kinds of multi-agent planning domains. ...
The classical representation scheme can be extended to model nondeterministic planning problems, by redefining a nondeterministic operator to be a tuple where each effects i (o) is a set of literals. ...
doi:10.1007/978-3-642-03278-3_1
fatcat:uowzhqjv4vft5b3i6w5defznim
AAAI-10 Classic Paper Award: Systematic Nonlinear Planning A Commentary
2011
The AI Magazine
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 2015; you can also visit the original URL.
The file type is application/pdf.
David McAllester and David Rosenblitt's paper Systematic Nonlinear Planning (published in the Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91) won the AAAI-10 classic paper ...
Weld describes the two major impacts the paper had on the field of automated planning. ...
Using a Graphplanlike, leveled-graph model, SATPLAN (Kautz and Selman 1996) showed that planning problems could be compiled into SAT problems, which modern SAT solvers could solve to create plans, blazingly ...
doi:10.1609/aimag.v32i1.2341
fatcat:j3wwlnaicvg4pcpw5oss3hbtpq
Current Trends in Automated Planning
2007
The AI Magazine
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 2017; you can also visit the original URL.
The file type is application/pdf.
It may fail to address several of the practical details but still can be very useful for getting a basic understanding of the problem. ...
■ Automated planning technology has become mature enough to be useful in applications that range from game playing to control of space vehicles. ...
Whether to use a plan, a policy, or a more general structure, such as a conditional plan or an execution structure, depends on what kind of planning problem we are trying to solve. ...
doi:10.1609/aimag.v28i4.2067
dblp:journals/aim/Nau07
fatcat:adqd2q36dzgclmxxk3rjng5vbi
SHOP2: An HTN Planning System
2003
The Journal of Artificial Intelligence Research
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.
Other Versions
This paper describes the features of SHOP2 which enabled it to excel in the competition, especially those aspects of SHOP2 that deal with temporal and metric planning domains. ...
The SHOP2 planning system received one of the awards for distinguished performance in the 2002 International Planning Competition. ...
We also wish to thank the anonymous reviewers, whose comments helped us to make significant improvements to this paper. ...
doi:10.1613/jair.1141
fatcat:p2iigotrtbgfvbx7hrp32ij3yy
Hybrid Conditional Planning using Answer Set Programming
[article]
2017
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.
using an ASP solver. ...
of a hybrid conditional plan describes a feasible execution of actions to reach their goals. ...
Geffner for useful discussions about HCP-ASP, and A. Albore, T. C. Son and C. Muise for their helps with CLG, DNFct, PO-PRP respectively. ...
arXiv:1707.05904v1
fatcat:yptcluhj5zhlhbel76bv3twafm
« Previous
Showing results 1 — 15 out of 889 results