A planner agent that tries its best in presence of nondeterminism

DOI10.1016/J.JAL.2012.06.002MaRDI QIDQ1948282zbMATH OpenOpenAlexFDO

Authors Silvio Do Lago Pereira, Leliane Nunes de Barros

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

automated planningplanning as model checkingplanning under uncertaintytemporal logic

Mathematics Subject Classification ID

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

Recommendations

• Weak, strong, and strong cyclic planning via symbolic model checking
• Using α -ctl to Specify Complex Planning Goals
• Fast strong planning for fully observable nondeterministic planning problems
• Plan aggregation for strong cyclic planning in nondeterministic domains
• The planning spectrum - one, two, three, infinity

Cites work

• A linear algorithm to solve fixed-point equations on transition systems
• scientific article; zbMATH DE number 3870578 (Why is no real title available?)
• scientific article; zbMATH DE number 1487860 (Why is no real title available?)
• scientific article; zbMATH DE number 2201583 (Why is no real title available?)
• scientific article; zbMATH DE number 3212004 (Why is no real title available?)
• The computational complexity of propositional STRIPS planning
• Using α -ctl to Specify Complex Planning Goals

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

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