FOND Planning for Pure-Past Linear Temporal Logic Goals.

ECAI 2023(2023)

引用 1|浏览10
暂无评分
摘要
Recently, Pure-Past Temporal Logic (PPLTL) has been shown to be very effective for specifying temporally extended goals in deterministic planning domains. In this paper, we show its effectiveness also for FOND planning, both for strong and strong-cyclic plans. We present a notably simple encoding of FOND planning for PPLTL goals into standard FOND planning for reachability goals.  The encoding only introduces few fluents (at most linear in the PPLTL goal) without adding any spurious action and allows planners to lazily build the relevant part of the DFA for the goal formula on-the-fly during the search. We formally prove its correctness, implement it in a tool called Plan4Past, and experimentally show its practical effectiveness.
更多
查看译文
关键词
fond planning,logic,pure-past
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要