A planner agent that tries its best in presence of nondeterminism

DOI10.1016/J.JAL.2012.06.002zbMath1262.68162OpenAlexW2022248509MaRDI QIDQ1948282

Leliane Nunes de Barros, Silvio Do Lago Pereira

Publication date: 2 May 2013

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2012.06.002

zbMATH Keywords

temporal logicautomated planningplanning under uncertaintyplanning as model checking

Mathematics Subject Classification ID

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

Cites Work

• A linear algorithm to solve fixed-point equations on transition systems
• The computational complexity of propositional STRIPS planning
• Using α -ctl to Specify Complex Planning Goals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A planner agent that tries its best in presence of nondeterminism