PDDL

swMATH7079MaRDI QIDQ19137FDOQ19137

Author name not available (Why is that?)

Cited In (92)

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

This page was built for software: PDDL