The FF planning system: Fast plan generation through heuristic search
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Automatically selecting and using primary effects in planning: Theory and experiments.
- Fast planning through planning graph analysis
- Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan
- Extracting mutual exclusion invariants from lifted temporal planning domains
- The MADLA planner: multi-agent planning by combination of distributed and local heuristic search
- Star-topology decoupled state space search
- Discovering hidden structure in factored MDPs
- Gradient-based mixed planning with symbolic and numeric action parameters
- Selecting goals in oversubscription planning using relaxed plans
- Model checking approach to automated planning
- A constraint programming formulation for planning: From plan scheduling to plan generation
- Set-structured and cost-sharing heuristics for classical planning
- Representing and planning with interacting actions and privacy
- Landmark-based approaches for goal recognition as planning
- Red-black planning: a new systematic approach to partial delete relaxation
- Automated planning as an early verification tool for distributed control
- Bagging strategies for learning planning policies
- Sequential Monte Carlo in reachability heuristics for probabilistic planning
- An approach to efficient planning with numerical fluents and multi-criteria plan quality
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
- Model-lite planning: case-based vs. model-based approaches
- Learning efficient logic programs
- Planning as satisfiability: parallel plans and algorithms for plan search
- Conformant planning via heuristic forward search: A new approach
- Constraint partitioning in penalty formulations for solving temporal planning problems
- In defense of PDDL axioms
- Modelling and solving English peg solitaire
- Goal distance estimation for automated planning using neural networks and support vector machines
- Domain-independent planning for services in uncertain and dynamic environments
- Applications of action languages in cognitive robotics
- Using satisfiability for non-optimal temporal planning
- Planning with incomplete information (invited paper)
- DEL planning and some tractable cases
- Experiences with planning for natural language generation
- Mobile robot planning using action language \({\mathcal {BC}}\) with an abstraction hierarchy
- Heuristic Hill-Climbing as a Markov Process
- Directed Unfolding of Petri Nets
- Planning as satisfiability: heuristics
- Transition-Based Directed Model Checking
- The fast downward planning system
- Flucap: a heuristic search planner for first-order MDPS
- On-the-Fly Macros
- Recent advances in unfolding technique
- Learning heuristic functions for large state spaces
- Planning in domains with derived predicates through rule-action graphs and local search
- Experimental evaluation of pheromone models in ACOPlan
- scientific article; zbMATH DE number 2038902 (Why is no real title available?)
- scientific article; zbMATH DE number 1753146 (Why is no real title available?)
- Depth-based short-sighted stochastic shortest path problems
- Plan aggregation for strong cyclic planning in nondeterministic domains
- Relational reinforcement learning for planning with exogenous effects
- On the completeness of pruning techniques for planning with conditional effects
- Manipulation of articulated objects using dual-arm robots via answer set programming
- Online relaxation refinement for satisficing planning: on partial delete relaxation, complete hill-climbing, and novelty pruning
- Fast strong planning for fully observable nondeterministic planning problems
- Planning with Critical Section Macros: Theory and Practice
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning
- Robust planning with incomplete domain models
- Cost-optimal planning, delete relaxation, approximability, and heuristics
- Forward heuristic search planning based on an ordered hill-climbing algorithm
- Approximation of action theories and its application to conformant planning
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
- scientific article; zbMATH DE number 2243407 (Why is no real title available?)
- scientific article; zbMATH DE number 2243410 (Why is no real title available?)
- DeepSym: Deep Symbol Generation and Rule Learning for Planning from Unsupervised Robot Interaction
- Asymmetric Action Abstractions for Planning in Real-Time Strategy Games
- Planning as heuristic search
- Epistemic planning: perspectives on the special issue
- Monte Carlo tree search for priced timed automata
- Width-based search for multi agent privacy-preserving planning
- Optimal mixed discrete-continuous planning for linear hybrid systems
- Kernel functions for case-based planning
- Specifying and computing preferred plans
- Planning in artificial intelligence
- A knowledge compilation perspective on queries and transformations for belief tracking
- On the exploitation of control knowledge for enhancing automated planning
- AxSAT -- bringing axioms to SAT planning
- Domain independent heuristics for online stochastic contingent planning
- Planning for temporally extended goals in pure-past linear temporal logic
- New methods for proving the impossibility to solve problems through reduction of problem spaces
- Symbolic search for cost-optimal planning with expressive model extensions
- \textit{Explain it as simple as possible, but no simpler} -- explanation via model simplification for addressing inferential gap
- Capturing (optimal) relaxed plans with stable and supported models of logic programs
- Answer set planning: a survey
- Planning with uncertainty: symmetries, policy inference, and solution compression
- CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement
- Complexity results for standard benchmark domains in planning
- Multiobjective heuristic state-space planning
- Managing concurrency in temporal planning using planner-scheduler interaction
- Concise finite-domain representations for PDDL planning tasks
- Learning from planner performance
- Anytime heuristic search for partial satisfaction planning
- A heuristic search approach to planning with temporally extended preferences
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- The factored policy-gradient planner
- Practical solution techniques for first-order MDPs
- Automatic construction of optimal static sequential portfolios for AI planning and beyond
- A generic approach to planning in the presence of incomplete information: theory and implementation
- Agent planning programs
- An extension of metric temporal planning with application to AC voltage control
This page was built for publication: The FF planning system: Fast plan generation through heuristic search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2717791)
