Conditional nonlinear planning
Proceedings of the first international conference on Artificial intelligence planning systems
Fast planning through planning graph analysis
Artificial Intelligence
Planning control rules for reactive agents
Artificial Intelligence
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Extending Graphplan to handle uncertainty and sensing actions
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
TALplanner: A temporal logic based forward chaining planner
Annals of Mathematics and Artificial Intelligence
Planning as Satisfiability in Nondeterministic Domains
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Planning as Heuristic Search: New Results
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Strong Cyclic Planning Revisited
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
SAT-based planning in complex domains: concurrency, constraints and nondeterminism
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Planning for contingencies: a decision-based approach
Journal of Artificial Intelligence Research
Applications of SHOP and SHOP2
IEEE Intelligent Systems
Model-Driven Prototyping Based Requirements Elicitation
Innovations for Requirement Analysis. From Stakeholders' Needs to Formal Designs
Task decomposition on abstract states, for planning under nondeterminism
Artificial Intelligence
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Using domain-configurable search control for probabilistic planning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Fusing procedural and declarative planning goals for nondeterministic domains
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Learning hierarchical task networks for nondeterministic planning domains
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Nondeterministic planning for generating interactive plots
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
Service composition with directories
SC'06 Proceedings of the 5th international conference on Software Composition
Simple and fast strong cyclic planning for fully-observable nondeterministic planning problems
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
| Hi-index | 0.00 |
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work in nondeterministic domains. Our results suggest that our technique preserves many of the desirable properties of these planners, such as the ability to use heuristic techniques to achieve highly efficient planning. In our experimental studies on two problem domains, the well-known MBP algorithm took exponential time, confirming prior results by others. A nondeterminized version of SHOP2 took only polynomial time. The polynomial-time figures are confirmed by a complexity analysis, and a similar complexity analysis shows that a nondeterminized version of TLPlan would perform similarly.