正则化时间离散多体动力学的参数与状态联合估计
Joint parameter and state estimation for regularized time-discrete multibody dynamics
AI总结:
本文提出一种基于逆动力学与观测误差的非线性最小二乘方法,通过Levenberg-Marquardt算法联合估计正则化离散多体动力学的状态与参数,并在真实Furuta摆数据上验证了其秒级收敛速度和参数设置的鲁棒性。
摘要:
我们提出了一种针对具有正则化和摩擦运动学约束的离散多体动力学进行离线参数估计的方法。该问题设置会导致存在不可观测的自由度,我们通过状态与参数的联合估计来处理这些自由度。我们的方法将状态和参数作为基于逆动力学和观测误差的非线性最小二乘优化问题的解来求解。该解通过Levenberg-Marquardt算法获得,其中导数来自自动微分以及针对干摩擦约束所出现的互补条件定制的微分规则。我们将方法参数的数量缩减为时间步长、正则化系数以及一个控制逆动力学误差与观测误差相对权重的参数。我们使用合成数据和真实测量数据对该方法进行了评估,重点关注性能以及对方法参数的敏感性。特别地,我们使用来自真实Furuta摆的数据,在一个13维参数空间上进行优化,其中包括惯性参数、摩擦参数、倾斜参数和电机参数。结果表明该方法收敛速度快,达到秒级,并且在多种方法参数选择下,不同的记录数据时间序列均表现出良好的一致性。然而,非常刚性的约束可能会给优化问题的求解带来困难。我们得出结论:在测试场景中,我们的方法可以非常快速,并且其方法参数具有鲁棒性且易于设置。
英文摘要:
We develop a method for offline parameter estimation of discrete multibody dynamics with regularized and frictional kinematic constraints. This setting leads to unobserved degrees of freedom, which we handle using joint state and parameter estimation. Our method finds the states and parameters as the solution to a nonlinear least squares optimization problem based on the inverse dynamics and the observation error. The solution is found using a Levenberg-Marquardt algorithm with derivatives from automatic differentiation and custom differentiation rules for the complementary conditions that appear due to dry frictional constraints. We reduce the number of method parameters to the choice of the time-step, regularization coefficients, and a parameter that controls the relative weighting of inverse dynamics and observation errors. We evaluate the method using synthetic and real measured data, focusing on performance and sensitivity to method parameters. In particular, we optimize over a 13-dimensional parameter space, including inertial, frictional, tilt, and motor parameters, using data from a real Furuta pendulum. Results show fast convergence, in the order of seconds, and good agreement for different time-series of recorded data over multiple method parameter choices. However, very stiff constraints may cause difficulties in solving the optimization problem. We conclude that our method can be very fast and has method parameters that are robust and easy to set in the tested scenarios.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。