The following pages link to (Q4449295):
Displaying 50 items.
- PDDL (Q19137) (← links)
- Domain-independent planning for services in uncertain and dynamic environments (Q286080) (← links)
- Planning in domains with derived predicates through rule-action graphs and local search (Q421464) (← links)
- A unifying action calculus (Q543584) (← links)
- Managing concurrency in temporal planning using planner-scheduler interaction (Q834400) (← links)
- Long-distance mutual exclusion for planning (Q835814) (← links)
- Concise finite-domain representations for PDDL planning tasks (Q835819) (← links)
- A heuristic search approach to planning with temporally extended preferences (Q835825) (← links)
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners (Q835826) (← links)
- The factored policy-gradient planner (Q835832) (← links)
- An extension of metric temporal planning with application to AC voltage control (Q900312) (← links)
- Linear temporal logic as an executable semantics for planning languages (Q1006453) (← links)
- Learning action models from plan examples using weighted MAX-SAT (Q1028900) (← links)
- Reasoning from last conflict(s) in constraint programming (Q1045989) (← links)
- Extracting mutual exclusion invariants from lifted temporal planning domains (Q1639696) (← links)
- Strong temporal planning with uncontrollable durations (Q1748463) (← links)
- A case study in programming a quantum annealer for hard operational planning problems (Q2018131) (← links)
- Complexity issues for timeline-based planning over dense time under future and minimal semantics (Q2067619) (← links)
- Gradient-based mixed planning with symbolic and numeric action parameters (Q2093396) (← links)
- Decidability and complexity of action-based temporal planning over dense time (Q2124463) (← links)
- A constraint-based approach to learn temporal features on action models from multiple plans (Q2152282) (← links)
- Out of control: reducing probabilistic models by control-state elimination (Q2152665) (← links)
- Model-checking precision agriculture logistics: the case of the differential harvest (Q2220343) (← links)
- Selecting goals in oversubscription planning using relaxed plans (Q2238655) (← links)
- Deliberative acting, planning and learning with hierarchical operational models (Q2238702) (← links)
- Model checking approach to automated planning (Q2248102) (← links)
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm (Q2268503) (← links)
- A constraint programming formulation for planning: From plan scheduling to plan generation (Q2268509) (← links)
- Solve-and-robustify (Q2268511) (← links)
- Book review of: P. Haslum et. al., An introduction to the planning domain definition language (Q2302292) (← links)
- Computing programs for generalized planning using a classical planner (Q2321292) (← links)
- First-order stable model semantics with intensional functions (Q2321299) (← links)
- Learning action models with minimal observability (Q2321324) (← links)
- Bagging strategies for learning planning policies (Q2364365) (← links)
- State-set branching: leveraging BDDs for heuristic search (Q2389616) (← links)
- An approach to efficient planning with numerical fluents and multi-criteria plan quality (Q2389640) (← links)
- Temporal reasoning about fuzzy intervals (Q2389652) (← links)
- Representations for robot knowledge in the \textsc{KnowRob} framework (Q2407430) (← links)
- A temporal logic programming approach to planning (Q2424818) (← links)
- Constraint partitioning in penalty formulations for solving temporal planning problems (Q2457638) (← links)
- Branching and pruning: An optimal temporal POCL planner based on constraint programming (Q2457640) (← links)
- In defense of PDDL axioms (Q2457650) (← links)
- Processes and continuous change in a SAT-based planner (Q2457662) (← links)
- Handling fuzzy temporal constraints in a planning environment (Q2468753) (← links)
- CP methods for scheduling and routing with~time-dependent task costs (Q2513747) (← links)
- On the importance of domain model configuration for automated planning engines (Q2666958) (← links)
- MANAGING TEMPORAL CYCLES IN PLANNING PROBLEMS REQUIRING CONCURRENCY (Q2857288) (← links)
- ACTION FAILURE RECOVERY VIA MODEL-BASED DIAGNOSIS AND CONFORMANT PLANNING (Q2857292) (← links)
- Applications of Action Languages in Cognitive Robotics (Q2900522) (← links)
- Using Satisfiability for Non-optimal Temporal Planning (Q2915070) (← links)
