The reviewed record of science sign in
Pith

arxiv: 2208.09074 · v1 · pith:GCV6ALAB · submitted 2022-08-18 · cs.RO

dPMP-Deep Probabilistic Motion Planning: A use case in Strawberry Picking Robot

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:GCV6ALABrecord.jsonopen to challenge →

classification cs.RO
keywords robotlearningprobabilisticapproachdeeplatentmodelnovel
0
0 comments X
read the original abstract

This paper presents a novel probabilistic approach to deep robot learning from demonstrations (LfD). Deep movement primitives (DMPs) are deterministic LfD model that maps visual information directly into a robot trajectory. This paper extends DMPs and presents a deep probabilistic model that maps the visual information into a distribution of effective robot trajectories. The architecture that leads to the highest level of trajectory accuracy is presented and compared with the existing methods. Moreover, this paper introduces a novel training method for learning domain-specific latent features. We show the superiority of the proposed probabilistic approach and novel latent space learning in the lab's real-robot task of strawberry harvesting. The experimental results demonstrate that latent space learning can significantly improve model prediction performances. The proposed approach allows to sample trajectories from distribution and optimises the robot trajectory to meet a secondary objective, e.g. collision avoidance.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.