Anticipation of goals in automated planning

DOI10.3233/AIC-180753zbMath1462.68173OpenAlexW2785367667MaRDI QIDQ5145429

Tomás de la Rosa, Daniel Borrajo, Raquel Fuentetaja

Publication date: 20 January 2021

Published in: AI Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/aic-180753

zbMATH Keywords

artificial intelligenceautomated planningAIAPgoal reasoning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• PDDL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Anytime heuristic search for partial satisfaction planning
• Approximate receding horizon approach for Markov decision processes: average reward case
• Simulation-based algorithms for Markov decision processes
• Soft Goals Can Be Compiled Away
• Error bounds for rolling horizon policies in discrete-time Markov control processes

This page was built for publication: Anticipation of goals in automated planning