TY - GEN
T1 - Multitask robot learning control
AU - Horowitz, Roberta
AU - Li, Perry
PY - 1992/1/1
Y1 - 1992/1/1
N2 - In this paper, we consider the problem of determining an optimal trajectory for the execution of class of robot tasks using a learning-adaptive robot control systems. A quadratic cost functional which involves the reference trajectory and the actual control efforts is optimized on-line while the robot is learning how to execute the tasks. The control-optimization scheme presented in this paper has a hierarchical structure which consists of i) a trajectory tracking controller; ii) a 'learning' algorithm which estimates the robot dynamics; and iii) a gradient flow algorithm which attempts to minimize the cost functional using the current estimate of the robot dynamics, and generates the reference trajectory for the tracking controller. The stability of the overall control-optimization system is analyzed and the system is proved to be asymptotically stable. The reference trajectory generated by the gradient flow algorithm converges to a local minimum as long as the training tasks are sufficiently rich.
AB - In this paper, we consider the problem of determining an optimal trajectory for the execution of class of robot tasks using a learning-adaptive robot control systems. A quadratic cost functional which involves the reference trajectory and the actual control efforts is optimized on-line while the robot is learning how to execute the tasks. The control-optimization scheme presented in this paper has a hierarchical structure which consists of i) a trajectory tracking controller; ii) a 'learning' algorithm which estimates the robot dynamics; and iii) a gradient flow algorithm which attempts to minimize the cost functional using the current estimate of the robot dynamics, and generates the reference trajectory for the tracking controller. The stability of the overall control-optimization system is analyzed and the system is proved to be asymptotically stable. The reference trajectory generated by the gradient flow algorithm converges to a local minimum as long as the training tasks are sufficiently rich.
UR - https://www.scopus.com/pages/publications/0027075314
UR - https://www.scopus.com/pages/publications/0027075314#tab=citedBy
U2 - 10.23919/acc.1992.4792615
DO - 10.23919/acc.1992.4792615
M3 - Conference contribution
AN - SCOPUS:0027075314
SN - 0780302109
SN - 9780780302105
T3 - Proceedings of the American Control Conference
SP - 2623
EP - 2628
BT - Proceedings of the American Control Conference
PB - Publ by American Automatic Control Council
T2 - Proceedings of the 1992 American Control Conference
Y2 - 24 June 1992 through 26 June 1992
ER -