MANAGING TEMPORAL CYCLES IN PLANNING PROBLEMS REQUIRING CONCURRENCY

DOI10.1111/j.1467-8640.2012.00430.xzbMath1274.68419OpenAlexW2043732946MaRDI QIDQ2857288

Frédéric Maris, Martin C. Cooper, Pierre Régnier

Publication date: 1 November 2013

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

Full work available at URL: https://oatao.univ-toulouse.fr/12314/1/cooper_12314.pdf

zbMATH Keywords

planningtimetemporally cyclic problemstemporally expressive problems

Mathematics Subject Classification ID

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

Related Items

The epistemic gossip problem ⋮ Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics

Uses Software

• PDDL
• Graphplan

Cites Work

• Towards a general theory of action and time
• The computational complexity of propositional STRIPS planning
• Fast planning through planning graph analysis
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item