scientific article; zbMATH DE number 2038893
From MaRDI portal
zbMath1036.68093MaRDI QIDQ4449295
Publication date: 8 February 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The Hybrid Plan Controller Construction for Trajectories in Sobolev Space, Decidability and complexity of action-based temporal planning over dense time, 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, Long-distance mutual exclusion for planning, Concise finite-domain representations for PDDL planning tasks, 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, Extracting mutual exclusion invariants from lifted temporal planning domains, 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, 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, Constraint-Based Algorithm for Computing Temporal Invariants, Representations for robot knowledge in the \textsc{KnowRob} framework, On the importance of domain model configuration for automated planning engines, A Comprehensive Framework for Learning Declarative Action Models, Visual language integration: a survey and open challenges, OMTPlan: A Tool for Optimal Planning Modulo Theories, A temporal logic programming approach to planning, Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms, 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, Optimal mixed discrete-continuous planning for linear hybrid systems, A Fluent Calculus Semantics for ADL with Plan Constraints, Model-checking precision agriculture logistics: the case of the differential harvest, Using Machine Learning for Decreasing State Uncertainty in Planning, Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem, 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, Anticipation of goals in automated planning, Learning-driven goal generation, Selecting goals in oversubscription planning using relaxed plans, 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, Simulation of Action Theories and an Application to General Game-Playing Robots, A Non-monotonic Goal Specification Language for Planning with Preferences, A unifying action calculus, 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, A case study in programming a quantum annealer for hard operational planning problems, CP methods for scheduling and routing with~time-dependent task costs, 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, PDDL, Learning action models from plan examples using weighted MAX-SAT, Complexity issues for timeline-based planning over dense time under future and minimal semantics, Computing programs for generalized planning using a classical planner, First-order stable model semantics with intensional functions, Learning action models with minimal observability, Reasoning from last conflict(s) in constraint programming, 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, Creative Problem Solving in Artificially Intelligent Agents: A Survey and Framework, The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions, A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning
Uses Software
