Title :
Learning and planning high-dimensional physical trajectories via structured Lagrangians
Author :
Vernaza, Paul ; Lee, Daniel D. ; Yi, Seung-Joon
Author_Institution :
GRASP Lab., Univ. of Pennsylvania, Philadelphia, PA, USA
Abstract :
We consider the problem of finding sufficiently simple models of high-dimensional physical systems that are consistent with observed trajectories, and using these models to synthesize new trajectories. Our approach models physical trajectories as least-time trajectories realized by free particles moving along the geodesics of a curved manifold, reminiscent of the way light rays obey Fermat´s principle of least time. Finding these trajectories, unfortunately, requires finding a minimum-cost path in a high-dimensional space, which is generally a computationally intractable problem. In this work we show that this high-dimensional planning problem can often be solved nearly optimally in practice via deterministic search, as long as we can find a certain low-dimensional structure in the Lagrangian that describes our observed trajectories. This low-dimensional structure additionally makes it feasible to learn an estimate of a Lagrangian that is consistent with the observed trajectories, thus allowing us to present a complete approach for learning from and predicting high-dimensional physical motion sequences. We finally show experimental results applying our method to human motion and robotic walking gaits. In doing so, we furthermore demonstrate efficient path planning in a 990-dimensional space.
Keywords :
path planning; search problems; Fermat least time principle; curved manifold; deterministic search; high-dimensional physical motion sequences; high-dimensional physical trajectory; high-dimensional planning problem; human motion; least-time trajectories; path planning; robotic walking gaits; structured Lagrangians; Lagrangian functions; Trajectory;
Conference_Titel :
Robotics and Automation (ICRA), 2010 IEEE International Conference on
Conference_Location :
Anchorage, AK
Print_ISBN :
978-1-4244-5038-1
Electronic_ISBN :
1050-4729
DOI :
10.1109/ROBOT.2010.5509698