Report
Learning from Sparse Demonstrations
| العنوان: | Learning from Sparse Demonstrations |
|---|---|
| المؤلفون: | Jin, Wanxin, Murphey, Todd D., Kulić, Dana, Ezer, Neta, Mou, Shaoshuai |
| سنة النشر: | 2020 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Robotics, Computer Science - Machine Learning, Electrical Engineering and Systems Science - Systems and Control |
| الوصف: | This paper develops the method of Continuous Pontryagin Differentiable Programming (Continuous PDP), which enables a robot to learn an objective function from a few sparsely demonstrated keyframes. The keyframes, labeled with some time stamps, are the desired task-space outputs, which a robot is expected to follow sequentially. The time stamps of the keyframes can be different from the time of the robot's actual execution. The method jointly finds an objective function and a time-warping function such that the robot's resulting trajectory sequentially follows the keyframes with minimal discrepancy loss. The Continuous PDP minimizes the discrepancy loss using projected gradient descent, by efficiently solving the gradient of the robot trajectory with respect to the unknown parameters. The method is first evaluated on a simulated robot arm and then applied to a 6-DoF quadrotor to learn an objective function for motion planning in unmodeled environments. The results show the efficiency of the method, its ability to handle time misalignment between keyframes and robot execution, and the generalization of objective learning into unseen motion conditions. Comment: This is a preprint. The published version can be accessed at IEEE Transactions on Robotics |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2008.02159 |
| رقم الانضمام: | edsarx.2008.02159 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |