Planning and control in artificial intelligence: A unifying perspective

DOI10.1023/A:1011286518035MaRDI QIDQ5945807zbMATH OpenFDO

Authors Blai Bonet, Hector Geffner

Publication date 2 July 2002

Published in Applied Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1011286518035

zbMATH Keywords

Markov decision processesplanning with incomplete informationplanning with uncertainty

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Management decision making, including multiple objectives (90B50) Markov and semi-Markov decision processes (90C40)

Recommendations

• scientific article; zbMATH DE number 1844461
• A Concise Introduction to Models and Methods for Automated Planning
• scientific article; zbMATH DE number 1315585
• Planning and acting in partially observable stochastic domains
• Planning with incomplete information (invited paper)

Cites work

• An Algorithm for Solving the Job-Shop Problem
• Constraint satisfaction using constraint logic programming
• Depth-first iterative-deepening: An optimal admissible tree search
• Fast planning through planning graph analysis
• scientific article; zbMATH DE number 1696710 (Why is no real title available?)
• scientific article; zbMATH DE number 4162303 (Why is no real title available?)
• scientific article; zbMATH DE number 3827248 (Why is no real title available?)
• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 1285155 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• Linear-space best-first search
• Network flows. Theory, algorithms, and applications.
• Planning as heuristic search
• Real-time heuristic search
• STRIPS: A new approach to the application of theorem proving to problem solving
• The expected length of a shortest path
• Using regression-match graphs to control search in planning
• Using temporal logics to express search control knowledge for planning

Cited in

(12)

• On-the-fly informed search of non-blocking directed controllers
• SLAP: specification logic of actions with probability
• Non-classical planning with a classical planner: the power of transformations
• The problem of planning with three sources of uncertainty
• scientific article; zbMATH DE number 2134708 (Why is no real title available?)
• scientific article; zbMATH DE number 4174347 (Why is no real title available?)
• scientific article; zbMATH DE number 1844461 (Why is no real title available?)
• scientific article; zbMATH DE number 1882069 (Why is no real title available?)
• Intelligent agent planning with quasi-determined states using inductive learning
• DSMC evaluation stages: fostering robust and safe behavior in deep reinforcement learning -- extended version
• From knowledge-based programs to graded belief-based programs. I: On-line reasoning
• On the undecidability of probabilistic planning and related stochastic optimization problems

Describes a project that uses

Uses Software

• Graphplan
• STAN
• CPlan
• Walksat
• PDDL

This page was built for publication: Planning and control in artificial intelligence: A unifying perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5945807)