PDDL

swMATH7079MaRDI QIDQ19137

No author found.

Related Items (92)

The Hybrid Plan Controller Construction for Trajectories in Sobolev Space ⋮ Goal distance estimation for automated planning using neural networks and support vector machines ⋮ Decidability and complexity of action-based temporal planning over dense time ⋮ Bagging strategies for learning planning policies ⋮ Logic of temporal attribute implications ⋮ Domain-independent planning for services in uncertain and dynamic environments ⋮ Bounded situation calculus action theories ⋮ Automatic workflow verification and generation ⋮ Managing concurrency in temporal planning using planner-scheduler interaction ⋮ Long-distance mutual exclusion for planning ⋮ Concise finite-domain representations for PDDL planning tasks ⋮ Learning from planner performance ⋮ 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 ⋮ Applications of Action Languages in Cognitive Robotics ⋮ Gearing Up for Effective ASP Planning ⋮ Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming ⋮ COLIN: Planning with Continuous Linear Numeric Change ⋮ SAP Speaks PDDL: Exploiting a Software-Engineering Model for Planning in Business Process Management ⋮ Using Satisfiability for Non-optimal Temporal Planning ⋮ A constraint-based approach to learn temporal features on action models from multiple plans ⋮ Out of control: reducing probabilistic models by control-state elimination ⋮ Merge-and-Shrink Abstraction ⋮ Systems of relational transformations: rules and realizability criterion ⋮ State-set branching: leveraging BDDs for heuristic search ⋮ An approach to efficient planning with numerical fluents and multi-criteria plan quality ⋮ Temporal reasoning about fuzzy intervals ⋮ Representations for robot knowledge in the \textsc{KnowRob} framework ⋮ On the importance of domain model configuration for automated planning engines ⋮ Knowledge-based programs as building blocks for planning ⋮ The MADLA planner: multi-agent planning by combination of distributed and local heuristic search ⋮ Unnamed Item ⋮ Planning with Critical Section Macros: Theory and Practice ⋮ A Comprehensive Framework for Learning Declarative Action Models ⋮ Planning in multi-agent environment using strips representation and non-cooperative equilibrium strategy ⋮ Unnamed Item ⋮ EXPERIENCES WITH PLANNING FOR NATURAL LANGUAGE GENERATION ⋮ Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I ⋮ Symmetric Monoidal Categories with Attributes ⋮ A history based approximate epistemic action theory for efficient postdictive reasoning ⋮ Design and results of the Fifth Answer Set Programming Competition ⋮ An extension of metric temporal planning with application to AC voltage control ⋮ Planning in domains with derived predicates through rule-action graphs and local search ⋮ Dynamic term-modal logics for first-order epistemic planning ⋮ Specifying and computing preferred plans ⋮ Using Machine Learning for Decreasing State Uncertainty in Planning ⋮ Planning as satisfiability: parallel plans and algorithms for plan search ⋮ Constraint partitioning in penalty formulations for solving temporal planning problems ⋮ Branching and pruning: An optimal temporal POCL planner based on constraint programming ⋮ In defense of PDDL axioms ⋮ Processes and continuous change in a SAT-based planner ⋮ Understanding planning with incomplete information and sensing ⋮ Anticipation of goals in automated planning ⋮ Learning-driven goal generation ⋮ Selecting goals in oversubscription planning using relaxed plans ⋮ A lightweight epistemic logic and its application to planning ⋮ Deliberative acting, planning and learning with hierarchical operational models ⋮ Handling fuzzy temporal constraints in a planning environment ⋮ Strong temporal planning with uncontrollable durations ⋮ Model checking approach to automated planning ⋮ Recursive definitions of tabular transformations ⋮ Simulation of Action Theories and an Application to General Game-Playing Robots ⋮ A Non-monotonic Goal Specification Language for Planning with Preferences ⋮ Approximation of action theories and its application to conformant planning ⋮ A unifying action calculus ⋮ On strongest necessary and weakest sufficient conditions ⋮ Planning as heuristic search ⋮ Unnamed Item ⋮ Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm ⋮ A constraint programming formulation for planning: From plan scheduling to plan generation ⋮ Solve-and-robustify ⋮ Planning and control in artificial intelligence: A unifying perspective ⋮ Landmark-based approaches for goal recognition as planning ⋮ CP methods for scheduling and routing with~time-dependent task costs ⋮ plasp 3: Towards Effective ASP Planning ⋮ Linear temporal logic as an executable semantics for planning languages ⋮ Book review of: P. Haslum et. al., An introduction to the planning domain definition language ⋮ Learning action models from plan examples using weighted MAX-SAT ⋮ Complexity issues for timeline-based planning over dense time under future and minimal semantics ⋮ First-order stable model semantics with intensional functions ⋮ Learning action models with minimal observability ⋮ Reasoning from last conflict(s) in constraint programming ⋮ CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement ⋮ Gradient-based mixed planning with symbolic and numeric action parameters ⋮ MANAGING TEMPORAL CYCLES IN PLANNING PROBLEMS REQUIRING CONCURRENCY ⋮ ACTION FAILURE RECOVERY VIA MODEL-BASED DIAGNOSIS AND CONFORMANT PLANNING ⋮ On transformation of conditional, conformant and parallel planning to linear programming ⋮ Position systems in dynamic domains ⋮ Automated planning as an early verification tool for distributed control ⋮ A Survey of Algorithms for Black-Box Safety Validation of Cyber-Physical Systems ⋮ A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system

This page was built for software: PDDL