PDDL

swMATH7079MaRDI QIDQ19137FDOQ19137

Author name not available (Why is that?)

Official website: https://en.wikipedia.org/wiki/Planning_Domain_Definition_Language

Cited In (only showing first 100 items - show all)

• Using machine learning for decreasing state uncertainty in planning
• Handling fuzzy temporal constraints in a planning environment
• Landmark-based approaches for goal recognition as planning
• Representations for robot knowledge in the \textsc{KnowRob} framework
• 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
• 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
• 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
• Merge-and-Shrink Abstraction
• Reasoning from last conflict(s) in constraint programming
• On strongest necessary and weakest sufficient conditions
• 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
• Linear temporal logic as an executable semantics for planning languages
• Planning in multi-agent environment using strips representation and non-cooperative equilibrium strategy
• PASS
• CPlan
• BuDDy
• simpleAPL
• GASP
• plasp
• FODD-Planner
• Graphplan
• CCGbank
• Coala
• TRAMP
• Galliwasp
• SATMC
• QBFLIB
• CCalc
• SWORD
• ANML
• ASPMT2SMT
• ERA-PAT
• TorchLight
• TEXPLORE
• ArgoTriCS
• SUMO
• SHOP2
• AltAlt
• LPG
• PPlan
• Prodigy
• SAPA
• KnowRob
• UCPOP
• VHPOP
• Yochan
• LINERLIB
• COLIN
• GDL
• UPMurphi
• ALM
• BWIBots
• SMCDEL
• meSAT
• IDPDraw
• CLARION
• SCIPPlan
• pyrunlim
• CPCES
• Metaopt
• RLBench
• An approach to efficient planning with numerical fluents and multi-criteria plan quality
• Approximation of action theories and its application to conformant planning
• SUPPLE
• In defense of PDDL axioms
• StatePredictions
• sitar
• Logic of temporal attribute implications
• Specifying and computing preferred plans
• CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement
• 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
• Planning and control in artificial intelligence: A unifying perspective
• Learning action models from plan examples using weighted MAX-SAT
• On transformation of conditional, conformant and parallel planning to linear programming
• Planning with Critical Section Macros: Theory and Practice
• Recursive definitions of tabular transformations
• A Comprehensive Framework for Learning Declarative Action Models
• Position systems in dynamic domains
• Managing temporal cycles in planning problems requiring concurrency
• Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
• Strong temporal planning with uncontrollable durations
• Selecting goals in oversubscription planning using relaxed plans
• Title not available (Why is that?)
• Constraint partitioning in penalty formulations for solving temporal planning problems

This page was built for software: PDDL