A simplification of the backpropagation-through-time algorithm for optimal neurocontrol

Backpropagation-through-time (BPTT) is the temporal extension of backpropagation which allows a multilayer neural network to approximate an optimal state-feedback control law provided some prior knowledge (Jacobian matrices) of the process is available. In this paper, a simplified version of the BPT...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on neural networks Vol. 8; no. 2; pp. 437 - 441
Main Authors: Bersini, H., Gorrini, V.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.03.1997
Institute of Electrical and Electronics Engineers
Subjects:
ISSN:1045-9227, 1941-0093
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Backpropagation-through-time (BPTT) is the temporal extension of backpropagation which allows a multilayer neural network to approximate an optimal state-feedback control law provided some prior knowledge (Jacobian matrices) of the process is available. In this paper, a simplified version of the BPTT algorithm is proposed which more closely respects the principle of optimality of dynamic programming. Besides being simpler, the new algorithm is less time-consuming and allows in some cases the discovery of better control laws. A formal justification of this simplification is attempted by mixing the Lagrangian calculus underlying BPTT with Bellman-Hamilton-Jacobi equations. The improvements due to this simplification are illustrated by two optimal control problems: the rendezvous and the bioreactor.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1045-9227
1941-0093
DOI:10.1109/72.557698