Planning in artificial intelligence
From MaRDI portal
Recommendations
Cites work
- \({\mathcal Q}\)-learning
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
- Bayesian reinforcement learning: a survey
- Branching and pruning: An optimal temporal POCL planner based on constraint programming
- Complexity results and algorithms for possibilistic influence diagrams
- Complexity results for standard benchmark domains in planning
- Depth-based short-sighted stochastic shortest path problems
- Depth-first iterative-deepening: An optimal admissible tree search
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Equivalence notions and model minimization in Markov decision processes
- Functional strips: A more flexible language for planning and problem solving
- Graph-Based Algorithms for Boolean Function Manipulation
- Heuristic search viewed as path finding in a graph
- scientific article; zbMATH DE number 4160608 (Why is no real title available?)
- scientific article; zbMATH DE number 4061056 (Why is no real title available?)
- scientific article; zbMATH DE number 1285155 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 2038892 (Why is no real title available?)
- scientific article; zbMATH DE number 2038893 (Why is no real title available?)
- scientific article; zbMATH DE number 2038899 (Why is no real title available?)
- scientific article; zbMATH DE number 2038905 (Why is no real title available?)
- scientific article; zbMATH DE number 1509472 (Why is no real title available?)
- scientific article; zbMATH DE number 2201583 (Why is no real title available?)
- scientific article; zbMATH DE number 2243372 (Why is no real title available?)
- scientific article; zbMATH DE number 2243406 (Why is no real title available?)
- scientific article; zbMATH DE number 2243407 (Why is no real title available?)
- scientific article; zbMATH DE number 2243413 (Why is no real title available?)
- scientific article; zbMATH DE number 2243416 (Why is no real title available?)
- Improving heuristics through relaxed search - an analysis of TP4 and HSP*a in the 2004 planning competition
- Markov decision processes in artificial intelligence. Vol. 1. General principles and applications
- Markov decision processes in artificial intelligence. Vol. 2. Advanced methods and applications.
- Marvin: a heuristic search planner with online macro-action learning
- Modelling mixed discrete-continuous domains for planning
- Multiagent Systems
- Optimal control of Markov processes with incomplete state information
- Planning and acting in partially observable stochastic domains
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
- Planning as heuristic search
- Solving Simple Planning Problems with More Inference and No Search
- Sound and complete landmarks for and/Or graphs
- Stochastic dynamic programming with factored representations
- STRIPS: A new approach to the application of theorem proving to problem solving
- Temporal planning using subgoal partitioning and resolution in SGPlan
- The computational complexity of propositional STRIPS planning
- The factored policy-gradient planner
- The fast downward planning system
- The FF planning system: Fast plan generation through heuristic search
- The LAMA planner: guiding cost-based anytime planning with landmarks
- The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs
- Towards qualitative approaches to multi-stage decision making
This page was built for publication: Planning in artificial intelligence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602257)