Managing concurrency in temporal planning using planner-scheduler interaction

DOI10.1016/j.artint.2008.08.003zbMath1180.68245OpenAlexW1974951007MaRDI QIDQ834400

Andrew Coles, Amanda Smith, Keith Halsey, Maria Fox, Derek Long

Publication date: 20 August 2009

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

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

zbMATH Keywords

planning and schedulingPDDL2.1temporal planning

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Using Satisfiability for Non-optimal Temporal Planning ⋮ A constraint-based approach to learn temporal features on action models from multiple plans ⋮ Strong temporal planning with uncontrollable durations ⋮ Linear logic as a tool for planning under temporal uncertainty

Uses Software

• PDDL
• SAPA
• VHPOP
• LPG

Cites Work

• Maintaining knowledge about temporal intervals
• Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
• TALplanner: A temporal logic based forward chaining planner
• Using temporal logics to express search control knowledge for planning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Managing concurrency in temporal planning using planner-scheduler interaction