scientific article
From MaRDI portal
Publication:2717791
zbMath0970.68044MaRDI QIDQ2717791
Publication date: 18 June 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (80)
Bagging strategies for learning planning policies ⋮ Domain-independent planning for services in uncertain and dynamic environments ⋮ 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 ⋮ Mobile Robot Planning Using Action Language $${\mathcal {BC}}$$ with an Abstraction Hierarchy ⋮ Applications of Action Languages in Cognitive Robotics ⋮ Extracting mutual exclusion invariants from lifted temporal planning domains ⋮ Using Satisfiability for Non-optimal Temporal Planning ⋮ 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 ⋮ Planning as satisfiability: heuristics ⋮ Model-lite planning: case-based vs. model-based approaches ⋮ The MADLA planner: multi-agent planning by combination of distributed and local heuristic search ⋮ Planning with Critical Section Macros: Theory and Practice ⋮ EXPERIENCES WITH PLANNING FOR NATURAL LANGUAGE GENERATION ⋮ Recent advances in unfolding technique ⋮ Kernel functions for case-based planning ⋮ Epistemic planning: perspectives on the special issue ⋮ Learning efficient logic programs ⋮ 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 ⋮ Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces ⋮ Monte Carlo tree search for priced timed automata ⋮ Width-based search for multi agent privacy-preserving planning ⋮ 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 ⋮ Optimal mixed discrete-continuous planning for linear hybrid systems ⋮ Specifying and computing preferred plans ⋮ Heuristic Hill-Climbing as a Markov Process ⋮ Depth-based short-sighted stochastic shortest path problems ⋮ Plan aggregation for strong cyclic planning in nondeterministic domains ⋮ On the completeness of pruning techniques for planning with conditional effects ⋮ 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 ⋮ Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics ⋮ Planning with Incomplete Information ⋮ Selecting goals in oversubscription planning using relaxed plans ⋮ Fast strong planning for fully observable nondeterministic planning problems ⋮ State space search nogood learning: online refinement of critical-path dead-end detectors in planning ⋮ Robust planning with incomplete domain models ⋮ Star-topology decoupled state space search ⋮ Model checking approach to automated planning ⋮ New methods for proving the impossibility to solve problems through reduction of problem spaces ⋮ Discovering hidden structure in factored MDPs ⋮ Conformant plans and beyond: principles and complexity ⋮ Approximation of action theories and its application to conformant planning ⋮ State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning ⋮ Modelling and solving English peg solitaire ⋮ A constraint programming formulation for planning: From plan scheduling to plan generation ⋮ Set-structured and cost-sharing heuristics for classical planning ⋮ Directed Unfolding of Petri Nets ⋮ Representing and planning with interacting actions and privacy ⋮ Landmark-based approaches for goal recognition as planning ⋮ Manipulation of Articulated Objects Using Dual-arm Robots via Answer Set Programming ⋮ Transition-Based Directed Model Checking ⋮ On-the-Fly Macros ⋮ DEL Planning and Some Tractable Cases ⋮ CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement ⋮ Gradient-based mixed planning with symbolic and numeric action parameters ⋮ Unnamed Item ⋮ Red-black planning: a new systematic approach to partial delete relaxation ⋮ DeepSym: Deep Symbol Generation and Rule Learning for Planning from Unsupervised Robot Interaction ⋮ Asymmetric Action Abstractions for Planning in Real-Time Strategy Games ⋮ Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan ⋮ 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 ⋮ Complexity results for standard benchmark domains in planning ⋮ Multiobjective heuristic state-space planning
Uses Software
This page was built for publication:
