In this paper, we introduce Tolerant Discrete Barrier States (T-DBaS), a novel safety-embedding technique for trajectory optimization with enhanced exploratory capabilities. The proposed approach generalizes the standard discrete barrier state (DBaS) method by accommodating temporary constraint violation during the optimization process while still approximating its safety guarantees. Consequently, the proposed approach eliminates the DBaS's safe nominal trajectories assumption, while enhancing its exploration effectiveness for escaping local minima. Towards applying T-DBaS to safety-critical autonomous robotics, we combine it with Differential Dynamic Programming (DDP), leading to the proposed safe trajectory optimization method T-DBaS-DDP, which inherits the convergence and scalability properties of the solver. The effectiveness of the T-DBaS algorithm is verified on differential drive robot and quadrotor simulations. In addition, we compare against the classical DBaS-DDP as well as Augmented-Lagrangian DDP (AL-DDP) in extensive numerical comparisons that demonstrate the proposed method's competitive advantages. Finally, the applicability of the proposed approach is verified through hardware experiments on the Georgia Tech Robotarium platform.
翻译:在本文中,我们引入了耐受性障碍国(T-DBaAS),这是一种新型的以强化探测能力优化轨迹的安全装饰技术。拟议方法通过在优化过程中满足暂时违反限制规定的情况,同时仍然接近其安全保障,对标准离散障碍国(DBAS)方法进行概括化,在优化过程中满足暂时违反限制的情况,同时仍然接近其安全保障。因此,拟议方法消除了DBAS的安全名义轨迹假设,同时增强了其逃避本地迷你的探索效力。在将T-DBaAS应用到安全临界自主机器人时,我们将其与差异动态程序(DDP)相结合,从而导致拟议的安全轨迹优化方法(T-DBAS-DDP)具有安全性,从而继承了溶剂的趋同性和可缩缩缩性。T-DBAS算法的有效性在差异驱动器和 quadrotor模拟器上得到了验证。此外,我们通过显示拟议方法竞争优势的广泛数字比较,将Georgia的硬件实验平台与经典DBAS-Georgia方法的可适用性。</s>