Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains.
FSTTCS(2019)
摘要
Planning is one of the most studied problems in computer science. In this paper, we focus on the timeline-based approach, where the domain is modeled by a set of independent, but interacting, components, each one represented by a number of state variables, whose behavior over time (timelines) is governed by a set of temporal constraints (transition functions and synchronization rules). Whereas the time domain is usually assumed to be discrete, here we address decidability and complexity issues for timeline-based planning (TP) over dense time.
更多查看译文
关键词
Planning,Timelines,Metric temporal logic,Timed automata
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络