arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.05242cs.ROcs.SYeess.SY
收藏

概率时间任务和安全返回约束下的分层运动规划

Hierarchical Motion Planning under Probabilistic Temporal Tasks and Safe-Return Constraints

Peking University(北京大学);Academy of Military Sciences(军事科学院)

Meng Guo, Tianjun Liao, Junjie Wang, Zhongkui Li

摘要:

对于在不确定环境中执行任务的机器人来说,安全至关重要。常见的安全要求,如避免碰撞,仅取决于状态,这可能是复杂的任务的限制。在这项工作中,我们解决了一个更一般的配方作为安全返回约束,这需要存在一个返回策略,以驱动系统返回到一组安全状态的概率很高。机器人的运动被建模为一个马尔可夫决策过程(MDP)的概率标签,这可以是高度非遍历。机器人任务被指定为这些标签上的线性时序逻辑(LTL)公式,例如监视和运输。我们首先提供理论上的保证,重新制定这样的安全返回的约束,并计算两个完整的产品自动机的基础上的基线解决方案。此外,为了解决计算复杂性,我们提出了一个层次规划算法,结合了基于特征的符号和时间抽象的约束优化。它同时合成两个相关的运动策略:出站策略最小化满足任务的高概率的总成本,而返回策略确保安全返回的约束。问题的制定是通用的机器人模型,任务规范和安全约束。所提出的分层算法是更有效的,可以解决更大的问题比基线解决方案,只有轻微的损失的最优性。数值验证包括模拟和硬件实验的搜索和救援任务和行星探测任务在不同的系统大小。

英文摘要:

Safety is crucial for robotic missions within an uncertain environment. Common safety requirements such as collision avoidance are only state-dependent, which can be restrictive for complex missions. In this work, we address a more general formulation as safe-return constraints, which require the existence of a return-policy to drive the system back to a set of safe states with high probability. The robot motion is modeled as a Markov Decision Process (MDP) with probabilistic labels, which can be highly non-ergodic. The robotic task is specified as Linear Temporal Logic (LTL) formulas over these labels, such as surveillance and transportation. We first provide theoretical guarantees on the re-formulation of such safe-return constraints, and a baseline solution based on computing two complete product automata. Furthermore, to tackle the computational complexity, we propose a hierarchical planning algorithm that combines the feature-based symbolic and temporal abstraction with constrained optimization. It synthesizes simultaneously two dependent motion policies: the outbound policy minimizes the overall cost of satisfying the task with a high probability, while the return policy ensures the safe-return constraints. The problem formulation is versatile regarding the robot model, task specifications and safety constraints. The proposed hierarchical algorithm is more efficient and can solve much larger problems than the baseline solution, with only a slight loss of optimality. Numerical validations include simulations and hardware experiments of a search-and-rescue mission and a planetary exploration mission over various system sizes.

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

↑