TAG-K:尾部平均贪心Kaczmarz用于计算高效且性能优异的在线惯性参数估计
TAG-K: Tail-Averaged Greedy Kaczmarz for Computationally Efficient and Performant Online Inertial Parameter Estimation
AI总结:
本文提出TAG-K算法,结合贪心随机行选择和尾部平均,实现高效稳定的在线惯性参数估计,在计算受限的机器人系统中表现出更快的求解速度和更高的鲁棒性。
摘要:
准确的在线惯性参数估计对于自适应机器人控制至关重要,能够实时调整负载变化、环境交互和系统磨损。传统方法难以跟踪突变参数变化或计算成本高,限制了动态环境和计算受限机器人系统中的有效性。我们介绍了TAG-K,一种轻量级的Kaczmarz方法扩展,结合贪心随机行选择以实现快速收敛和尾部平均以在噪声和不一致性下保持鲁棒性。这种设计实现了快速稳定的参数适应,同时保留了Kaczmarz框架固有的低每迭代复杂度。我们在合成基准和四旋翼跟踪任务中评估了TAG-K,与RLS、KF和其他Kaczmarz变体相比,TAG-K在笔记本类CPU上求解速度提高1.5x-1.9x,在嵌入式微控制器上提高4.8x-20.7x。更重要的是,这些加速与对测量噪声的改进鲁棒性和估计误差减少25%相结合,导致几乎2倍更好的端到端跟踪性能。网站、文档和代码可在:https://a2r-lab.org/TAG-K/。
英文摘要:
Accurate online inertial parameter estimation is essential for adaptive robotic control, enabling real-time adjustment to payload changes, environmental interactions, and system wear. Traditional methods often struggle to track abrupt parameter shifts or incur high computational costs, limiting their effectiveness in dynamic environments and for computationally constrained robotic systems. We introduce TAG-K, a lightweight extension of the Kaczmarz method that combines greedy randomized row selection for rapid convergence with tail averaging for robustness under noise and inconsistency. This design enables fast, stable parameter adaptation while retaining the low per-iteration complexity inherent to the Kaczmarz framework. We evaluate TAG-K in synthetic benchmarks and quadrotor tracking tasks against RLS, KF, and other Kaczmarz variants. TAG-K achieves 1.5x-1.9x faster solve times on laptop-class CPUs and 4.8x-20.7x faster solve times on embedded microcontrollers. More importantly, these speedups are paired with improved robustness to measurement noise and a 25% reduction in estimation error, leading to nearly 2x better end-to-end tracking performance. Website, documentation, and code available at: https://a2r-lab.org/TAG-K/.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。