A heuristic search approach to planning with temporally extended preferences

DOI10.1016/J.ARTINT.2008.11.011zbMath1191.68623OpenAlexW1978892650MaRDI QIDQ835825

Sheila A. McIlraith, Jorge A. Baier, Fahiem Bacchus

Publication date: 31 August 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2008.11.011

zbMATH Keywords

planning with preferencesPDDL3temporally extended preferences

Mathematics Subject Classification ID

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

Related Items (6)

Heuristics for planning with penalties and rewards formulated in logic and computed through circuits ⋮ Agent planning programs ⋮ Specifying and computing preferred plans ⋮ Selecting goals in oversubscription planning using relaxed plans ⋮ A Non-monotonic Goal Specification Language for Planning with Preferences ⋮ Using Temporal Logic to Integrate Goals and Qualitative Preferences into Agent Programming

Uses Software

• PDDL
• Graphplan
• Yochan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planning for temporally extended goals.
• Fast planning through planning graph analysis
• STRIPS: A new approach to the application of theorem proving to problem solving
• Logic Programming and Nonmonotonic Reasoning
• Planning as heuristic search

This page was built for publication: A heuristic search approach to planning with temporally extended preferences