The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Neurocontrol of nonlinear dynamical systems with Kalman filter trained recurrent networks
Abstract
Although the potential of the powerful mapping and representational capabilities of recurrent network architectures is generally recognized by the neural network research community, recurrent neural networks have not been widely used for the control of nonlinear dynamical systems, possibly due to the relative ineffectiveness of simple gradient descent training algorithms. Developments in the use of parameter-based extended Kalman filter algorithms for training recurrent networks may provide a mechanism by which these architectures will prove to be of practical value. This paper presents a decoupled extended Kalman filter (DEKF) algorithm for training of recurrent networks with special emphasis on application to control problems. We demonstrate in simulation the application of the DEKF algorithm to a series of example control problems ranging from the well-known cart-pole and bioreactor benchmark problems to an automotive subsystem, engine idle speed control. These simulations suggest that recurrent controller networks trained by Kalman filter methods can combine the traditional features of state-space controllers and observers in a homogeneous architecture for nonlinear dynamical systems, while simultaneously exhibiting less sensitivity than do purely feedforward controller networks to changes in plant parameters and measurement noise.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Identification and control of dynamical systems using neural networks
Narendra, K. S., & Parthasarathy, K. (1990) · IEEE Transactions on Neural Networks · doi:10.1109/72.80202 · Cited by 8,014
Backpropagation through time: what it does and how to do it
Werbos, P. J. (1990) · Proceedings of the IEEE · doi:10.1109/5.58337 · Cited by 4,879
A Learning Algorithm for Continually Running Fully Recurrent Neural Networks
Williams, R. J., & Zipser, D. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.270 · Cited by 4,369
Neuronlike adaptive elements that can solve difficult learning control problems
Barto, A. G., Sutton, R. S., & Anderson, C. W. (1983) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1983.6313077 · Cited by 3,233
(1991) · The MIT Press eBooks · doi:10.7551/mitpress/4939.001.0001 · Cited by 873
Gradient methods for the optimization of dynamical systems containing neural networks
Narendra, K. S., & Parthasarathy, K. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.80336 · Cited by 641
An Efficient Gradient-Based Algorithm for On-Line Training of Recurrent Network Trajectories
Williams, R. J., & Peng, J. (1990) · Neural Computation · doi:10.1162/neco.1990.2.4.490 · Cited by 577
Training Multilayer Perceptrons with the Extended Kalman Algorithm
Singhal, S., & Wu, L. (1988) · neural information processing systems · Cited by 320
Decoupled extended Kalman filter training of feedforward layered networks
Puskorius, G. V., & Feldkamp, L. A. (2002) · IJCNN-91-Seattle International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1991.155276 · Cited by 229
Self-citationSupervised learning and systems with excess degrees of freedom
Jordan, M. I. (1988) · Cited by 180
Optimal filtering algorithms for fast learning in feedforward neural networks
Shah, S., Palmieri, F., & Datum, M. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80139-x · Cited by 170
Generic constraints on underspecified target trajectories
Jordan, M. I. (1989) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1989.118584 · Cited by 167
Training recurrent networks using the extended Kalman filter
Williams, R. J. (2003) · 2022 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1992.227335 · Cited by 118
Ruck, D. W., Rogers, S. K., Kabrisky, M., Maybeck, P. S., & Oxley, M. E. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.141559 · Cited by 117
Adaptive State Representation and Estimation Using Recurrent Connectionist Networks
Williams, R. J. (1991) · The MIT Press eBooks · doi:10.7551/mitpress/4939.003.0008 · Cited by 57
A Computationally Efficient Algorithm for Training Recurrent Connectionist Networks
Livstone, M. M., Farrell, J. A., & Baker, W. L. (1992) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.1992.4792127 · Cited by 15
Cited by
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Reservoir computing approaches to recurrent neural network training
Lukoševičius, M., & Jaeger, H. (2009) · Computer Science Review · doi:10.1016/j.cosrev.2009.03.005 · Cited by 2,956
Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processing
Monga, V., Li, Y., & Eldar, Y. C. (2021) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.3016905 · Cited by 1,414
Prokhorov, D. V., & Wunsch, D. C. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.623201 · Cited by 1,186
Metadata
- Authors
- Puskorius, G. V., & Feldkamp, L. A.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1994-03
- Volume
- 5
- Issue
- 2
- Pages
- 279-297
- ISSN
- 1045-9227 (ISSN-L)
- 1941-0093
- OpenAlex
- W2123716044
- Cited by
- 528
- References
- 16
- FWCI
- 32.39
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.