Abstract
Perception-related tasks often arise in autonomous systems operating under partial observability. This work studies the problem of synthesizing optimal policies for complex perception-related objectives in environments modeled by partially observable Markov decision processes. To formally specify such objectives, we introduce \emph{co-safe linear inequality temporal logic} (sc-iLTL), which can define complex tasks that are formed by the logical concatenation of atomic propositions as linear inequalities on the belief space of the POMDPs. Our solution to the control synthesis problem is to transform the \mbox{sc-iLTL} objectives into reachability objectives by constructing the product of the belief MDP and a deterministic finite automaton built from the sc-iLTL objective. To overcome the scalability challenge due to the product, we introduce a Monte Carlo Tree Search (MCTS) method that converges in probability to the optimal policy. Finally, a drone-probing case study demonstrates the applicability of our method.
Abstract (translated)
与自主系统在部分可观测性环境下运行时出现的感知相关任务有关,这项工作研究了如何为部分可观测马尔可夫决策过程(POMDP)模型环境中复杂的感知目标合成最优策略的问题。为了正式指定此类目标,我们引入了**co-safe线性不等式时态逻辑**(sc-iLTL),它可以通过在POMDP信念空间上的线性不等式来定义复杂任务,这些任务由原子命题的逻辑串联组成。 我们的控制综合方法是通过构建信念MDP与从sc-iLTL目标构造出的确定有限自动机(DFA)的产品,将sc-iLTL目标转化为可达性目标。为了克服因产品构造而导致的可扩展性挑战,我们引入了一种蒙特卡洛树搜索(MCTS)方法,该方法可以以概率收敛到最优策略。 最后,通过一个无人机探测案例研究展示了我们这种方法的应用可行性。
URL
https://arxiv.org/abs/2507.02942