Minimum Cost Averaging for Multivariate Time Series Using Constrained Dynamic Time Warping: A Case Study in Robotics

In this paper, an innovative algorithm for averaging a set of multivariate time series with different lengths based on Constrained Dynamic Time Warping (CDTW) is proposed. This approach relies on the CDTW to provide the non-linear alignment of the multivariate time series, and employs the proposed Minimum Cost Averaging (MCA) technique to identify the optimum matches and get equal-length time series. MCA-CDTW is a task-agnostic approach that after selecting a reference curve, transforms the rest of the demonstrations in the set to obtain new curves that are time-aligned with the reference. From these transformed curves, not only the mean but also the signal variability can be directly extracted. This technique provides smooth mean curves even when there are large deviations between the demonstrations in the set, and still the complexity of the proposed algorithm is significantly reduced compared to other averaging techniques from the literature. When learning techniques are used to teach a motion to a robotic system, obtaining smooth trajectories is important to achieve good robotic behaviors. The new algorithm MCA-CDTW is tested and compared on two different databases: a literature database where humans move a robotic arm with kinaesthetic teaching, and a set of recordings of a teleoperated robotic arm performing laboratory manipulation. On both datasets, it is demonstrated that the new approach is providing smooth average trajectories.

Automated summary

This paper proposes an innovative algorithm called MCA-CDTW for averaging multivariate time series with different lengths based on Constrained Dynamic Time Warping (CDTW). The algorithm utilizes CDTW for non-linear alignment and employs Minimum Cost Averaging (MCA) technique for obtaining equal-length time series. Compared to other averaging techniques, MCA-CDTW provides smooth mean curves even with large deviations and reduces algorithm complexity. Experimental results on different databases demonstrate the effectiveness of the proposed algorithm in achieving smooth average trajectories.