提出可直接生成策略的时序规划方法，避免传统耗时确定化步骤。
Synthesis of timeline-based planning strategies avoiding determinization
- 将时序规划问题映射为确定性有限自动机非空性问题
- 在特定时序关系子集上实现策略直接合成
- 适用于需要高效策略生成的复杂时序系统
定性时序规划将领域建模为独立但相互作用的组件，其随时间演变的行为由定性时序约束（排序关系）控制，称为同步规则。该规划存在性问题已被证明为PSPACE完全；特别是，通过归约至非确定性有限自动机的非空性问题，证明了PSPACE成员性。然而，非确定性自动机无法直接用于合成规划策略，因需代价高昂的确定化步骤。本文识别出一个定性时序规划的片段，其规划存在性问题可直接映射到确定性有限自动机的非空性问题，从而实现策略的直接合成。此外，我们确定了满足该确定性片段的最大Allen关系子集。
原文摘要 · Abstract (English)
Qualitative timeline-based planning models domains as sets of independent, but interacting, components whose behaviors over time, the timelines, are governed by sets of qualitative temporal constraints (ordering relations), called synchronization rules. Its plan-existence problem has been shown to be PSPACE-complete; in particular, PSPACE-membership has been proved via reduction to the nonemptiness problem for nondeterministic finite automata. However, nondeterministic automata cannot be directly used to synthesize planning strategies as a costly determinization step is needed. In this paper, we identify a fragment of qualitative timeline-based planning whose plan-existence problem can be directly mapped into the nonemptiness problem of deterministic finite automata, which can then synthesize strategies. In addition, we identify a maximal subset of Allen's relations that fits into such a deterministic fragment.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。