arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.08334eess.SYcs.ROcs.SY
收藏

基于时序逻辑树与Hamilton-Jacobi可达性的复杂任务保证完成方法

Guaranteed Completion of Complex Tasks via Temporal Logic Trees and Hamilton-Jacobi Reachability

KTH Royal Institute of Technology(瑞典皇家理工学院);Integrated Transport Research Lab(综合交通研究实验室);Digital Futures(数字未来);Simon Fraser University(西蒙菲莎大学)

Frank J. Jiang, Kaj Munhoz Arfvidsson, Chong He, Mo Chen, Karl H. Johansson

AI总结:

该研究提出结合Hamilton-Jacobi可达性与时序逻辑树的方法,检测泄漏角问题以验证控制策略存在性,高效合成实时控制输入集保障CPS复杂任务完成,并通过仿真驾驶任务验证了方法有效性。

摘要:

本文提出了一种保障信息物理系统(CPS)完成复杂任务的方法。具体而言,我们利用通过Hamilton-Jacobi可达性分析构建的时序逻辑树,实现两大目标:一是检验是否存在可完成指定任务的控制策略;二是提出一种计算高效的方法,以综合出CPS可实时执行的全部控制输入集合,确保任务完成。我们证明,通过检查时序逻辑树中每个状态集的逼近方向,可检测该树是否存在“泄漏角问题”——即可达集的交集会产生错误逼近。只要确保时序逻辑树不存在泄漏角,就能确定该树可正确验证满足指定任务的控制策略是否存在。在确认控制策略存在后,我们表明可利用通过Hamilton-Jacobi可达性分析得到的值函数,高效计算CPS在部署时间范围内可执行的控制输入集合,以保证指定任务的完成。最后,我们使用一个新发布的Python工具箱,在一项仿真驾驶任务上评估了所提方法。

英文摘要:

In this paper, we present an approach for guaranteeing the completion of complex tasks with cyber-physical systems (CPS). Specifically, we leverage temporal logic trees constructed using Hamilton-Jacobi reachability analysis to (1) check for the existence of control policies that complete a specified task and (2) develop a computationally-efficient approach to synthesize the full set of control inputs the CPS can implement in real-time to ensure the task is completed. We show that, by checking the approximation directions of each state set in the temporal logic tree, we can check if the temporal logic tree suffers from the "leaking corner issue," where the intersection of reachable sets yields an incorrect approximation. By ensuring a temporal logic tree has no leaking corners, we know the temporal logic tree correctly verifies the existence of control policies that satisfy the specified task. After confirming the existence of control policies, we show that we can leverage the value functions obtained through Hamilton-Jacobi reachability analysis to efficiently compute the set of control inputs the CPS can implement throughout the deployment time horizon to guarantee the completion of the specified task. Finally, we use a newly released Python toolbox to evaluate the presented approach on a simulated driving task.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑