.png){kind=icon}
.png){kind=icon}
Return
N-Dimensional Reduction Algorithm for Learning from Demonstration Path Planning
.png){kind=icon}
OA
AI
DOI：10.3390/s25072145.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an n-dimensional reduction algorithm for Learning from Demonstration (LfD) for robotic path planning, addressing the complexity of high-dimensional data. The method extends the Douglas-Peucker algorithm by incorporating velocity and orientation alongside position, enabling more precise trajectory simplification. A magnitude-based normalization process preserves proportional relationships across dimensions, and the reduced dataset is used to train Hidden Markov Models (HMMs), where continuous trajectories are discretized into identifier sequences. The algorithm is evaluated in 2D and 3D environments with datasets combining position and velocity. The results show that incorporating additional dimensions significantly enhances trajectory simplification while preserving key information. Additionally, the study highlights the importance of selecting appropriate encoding parameters to achieve optimal resolution. The HMM-based models generated new trajectories that retained the patterns of the original demonstrations, demonstrating the algorithm's capacity to generalize learned behaviors for trajectory learning in high-dimensional spaces.
Keywords:
learning from demonstration
hidden Markov models
data reduction
Douglas-Peucker algorithm
high-dimensional data encoding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.