Planning in artificial intelligence
type: Item
instance of: scholarly article
title: Planning in artificial intelligence
zbMATH Open document ID: 1547.68714
DOI: 10.1007/978-3-030-06167-8_10
author: Régis Sabbadin
author: Florent Teichteil-Königsbuch
author: Vincent Vidal
publication date: 2024-09-11T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C40
zbMATH DE Number: 7910878
MaRDI profile type: MaRDI publication profile
cites work: Optimal control of Markov processes with incomplete state information
cites work: Q3795523
cites work: Planning as heuristic search
cites work: Q5715734
cites work: Q5715724
cites work: Stochastic dynamic programming with factored representations
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: The factored policy-gradient planner
cites work: Q3564650
cites work: Q3564593
cites work: The computational complexity of propositional STRIPS planning
cites work: Q3624017
cites work: Q3624049
cites work: Q4449302
cites work: Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
cites work: STRIPS: A new approach to the application of theorem proving to problem solving
cites work: Q4449295
cites work: Q3624034
cites work: Complexity results and algorithms for possibilistic influence diagrams
cites work: Functional strips: A more flexible language for planning and problem solving
cites work: Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
cites work: Q5313998
cites work: Bayesian reinforcement learning: a survey
cites work: Equivalence notions and model minimization in Markov decision processes
cites work: Q3624001
cites work: Complexity results for standard benchmark domains in planning
cites work: Q3624014
cites work: Q5715723
cites work: The FF planning system: Fast plan generation through heuristic search
cites work: Q5715683
cites work: Planning and acting in partially observable stochastic domains
cites work: Sound and Complete Landmarks for And/Or Graphs
cites work: Q4506456
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: Q3487241
cites work: Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
cites work: Q4242054
cites work: Q4449294
cites work: Heuristic search viewed as path finding in a graph
cites work: Q4315289
cites work: The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
cites work: Towards qualitative approaches to multi-stage decision making
cites work: Multiagent Systems
cites work: The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs
cites work: Depth-based short-sighted stochastic shortest path problems
cites work: Solving Simple Planning Problems with More Inference and No Search
cites work: Branching and pruning: An optimal temporal POCL planner based on constraint programming
cites work: \({\mathcal Q}\)-learning
cites work: Q4449310
cites work: Q5715731
description: scientific article; zbMATH DE number 7910878