.png){kind=icon}
.png){kind=icon}
Return
Predictive robot programming: Theoretical and experimental analysis
.png){kind=icon}
OA
AI
DOI：10.1177/0278364904044401.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
As the capabilities of manipulator robots increase, they are pe forming more complex tasks. The cumbersome nature of conventional programming methods limits robotic automation due to the lengthy programming time. We present a novel method for reducing the time needed to program a manipulator robot: predictive robot programming (PRP). The PRP system constructs a statistical model of the user by incorporating information from previously completed tasks. Using this model, the PRP system computes predictions about where the user will move the robot. The user can reduce programming time by allowing the PRP system to complete the task automatically In this paper we derive a learning algorithm that estimates the structure of continuous-density hidden Markov models from tasks the user has already completed. We analyze the performance of the PRP system on two sets of data. The first set is based on data from complex, real world robotic tasks. We show that the PRP system is able to compute predictions for about 25 % of the waypoints with a median prediction error less than 0.5% of the distance traveled during prediction. We also present laboratory experiments showing that the PRP system results in a significant reduction in programming time, with users completing simple robot-programming tasks over 30% faster when using the PRP system to compute predictions of future positions.
Keywords:
manipulator robot programming
prediction
continuous-density hidden Markov model
structure estimation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5
Papers:
2.4K
Citations:
1.5W
Organization
No organization information available