This paper presents an approach that generates the overall trajectory of mobile manipulators for a complex mission consisting of several sub-tasks. Parametric dynamic movement primitives (PDMPs) can quickly generalize the… Click to show full abstract
This paper presents an approach that generates the overall trajectory of mobile manipulators for a complex mission consisting of several sub-tasks. Parametric dynamic movement primitives (PDMPs) can quickly generalize the online motion of robot manipulation by learning multiple demonstrations in offline. However, regarding complex missions consisting of multiple sub-tasks, a large number of demonstrations are required for full generalization, which is impractical. In this paper, we propose a framework that reduces the number of demonstrations for a complex mission. In the proposed method, complex demonstrations are segmented into multiple unit motions representing sub-tasks, and one PDMP is formed per each segment, resulting in multiple PDMPs. The phase decision process determines which sub-task and associated PDMPs to be executed online, allowing multiple PDMPs to be autonomously configured within an integrated framework. In order to generalize the execution time and regional goal in each phase, the Gaussian process regression (GPR) is applied. Simulation results from two different scenarios confirm that the proposed framework not only effectively reduces the number of demonstrations but also improves generalization performance. The actual experiments also demonstrate that the mobile manipulators effectively perform complex missions through the proposed framework. Note to Practitioners—This paper presents an approach of learning from demonstration (LfD) to generalize complex movements of robots. Parametric dynamic movement primitives (PDMPs) compute styles of movements from multiple demonstrations. However, the complexity of the PDMP increases as the mission involves more sub-tasks. In this paper, we resolve this issue by segmenting the complex mission into multiple sub-tasks and configuring multiple PDMPs. This work effectively reduces the number of required demonstrations for PDMPs, moderates the complexity of the algorithm. Also, the proposed approach allows flexible sub-task sequencing. It enables the mission in an unlearned sequence or a new combination of sub-tasks. The proposed approach is validated in both simulation and experimental results. Our approach is applicable for complex missions whose sub-tasks are clearly identified
               
Click one of the above tabs to view related content.