scientific article
From MaRDI portal
Publication:3624014
zbMath1182.68245arXiv1109.6051MaRDI QIDQ3624014
Publication date: 28 April 2009
Full work available at URL: https://arxiv.org/abs/1109.6051
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (62)
Goal distance estimation for automated planning using neural networks and support vector machines ⋮ Bagging strategies for learning planning policies ⋮ Domain-independent planning for services in uncertain and dynamic environments ⋮ Long-distance mutual exclusion for planning ⋮ Concise finite-domain representations for PDDL planning tasks ⋮ Learning from planner performance ⋮ Anytime heuristic search for partial satisfaction planning ⋮ Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners ⋮ Mobile Robot Planning Using Action Language $${\mathcal {BC}}$$ with an Abstraction Hierarchy ⋮ Extracting mutual exclusion invariants from lifted temporal planning domains ⋮ Symbolic perimeter abstraction heuristics for cost-optimal planning ⋮ Merge-and-Shrink Abstraction ⋮ An approach to efficient planning with numerical fluents and multi-criteria plan quality ⋮ Efficient symbolic search for cost-optimal planning ⋮ Formally verified algorithms for upper-bounding state space diameters ⋮ Robot task planning and explanation in open and uncertain worlds ⋮ Relational reinforcement learning with guided demonstrations ⋮ On the importance of domain model configuration for automated planning engines ⋮ The MADLA planner: multi-agent planning by combination of distributed and local heuristic search ⋮ Verified Over-Approximation of the Diameter of Propositionally Factored Transition Systems ⋮ 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 ⋮ Optimal Sokoban solving using pattern databases with specific domain knowledge ⋮ Agent planning programs ⋮ Learning heuristic functions for large state spaces ⋮ The influence of \(k\)-dependence on the complexity of planning ⋮ Planning in domains with derived predicates through rule-action graphs and local search ⋮ Experimental evaluation of pheromone models in ACOPlan ⋮ Dynamic term-modal logics for first-order epistemic planning ⋮ Evaluation of the moral permissibility of action plans ⋮ Unnamed Item ⋮ On the complexity of planning for agent teams and its implications for single agent planning ⋮ On the completeness of pruning techniques for planning with conditional effects ⋮ Phase transitions of contingent planning problem ⋮ Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics ⋮ Rational deployment of multiple heuristics in optimal state-space search ⋮ State space search nogood learning: online refinement of critical-path dead-end detectors in planning ⋮ Star-topology decoupled state space search ⋮ New methods for proving the impossibility to solve problems through reduction of problem spaces ⋮ Landmark-enhanced abstraction heuristics ⋮ Conformant plans and beyond: principles and complexity ⋮ Potential-based bounded-cost search and anytime non-parametric A* ⋮ Causal graphs and structurally restricted planning ⋮ Optimal admissible composition of abstraction heuristics ⋮ Representing and planning with interacting actions and privacy ⋮ Landmark-based approaches for goal recognition as planning ⋮ plasp 3: Towards Effective ASP Planning ⋮ Dynamic branching in qualitative constraint-based reasoning via counting local models ⋮ On-the-Fly Macros ⋮ Foundations of explanations as model reconciliation ⋮ SAT competition 2020 ⋮ Computing programs for generalized planning using a classical planner ⋮ Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models ⋮ Gradient-based mixed planning with symbolic and numeric action parameters ⋮ Regarding Goal Bounding and Jump Point Search ⋮ Unnamed Item ⋮ Red-black planning: a new systematic approach to partial delete relaxation ⋮ Asymmetric Action Abstractions for Planning in Real-Time Strategy Games ⋮ The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions ⋮ Automated planning as an early verification tool for distributed control ⋮ Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning ⋮ A complete parameterized complexity analysis of bounded planning
This page was built for publication:
