Fault Tolerant Training for Optimal Interpolative Nets

The optimal interpolative (OI) classification network is extended to include fault tolerance and make the network more robust to the loss of a neuron. The OI net has the characteristic that the training data are fit with no more neurons than necessary. Fault tolerance further reduces the number of neurons generated during the learning procedure while maintaining the generalization capabilities of the network. The learning algorithm for the fault-tolerant OI net is presented in a recursive formal, allowing for relatively short training times. A simulated fault-tolerant OI net is tested on a navigation satellite selection proble

Navigation Satellite Selection Using Neural Networks

The application of neural networks to optimal satellite subset selection for navigation use is discussed. The methods presented in this paper are general enough to be applicable regardless of how many satellite signals are being processed by the receiver. The optimal satellite subset is chosen by minimizing a quantity known as Geometric Dilution of Precision (GDOP), which is given by the trace of the inverse of the measurement matrix. An artificial neural network learns the functional relationships between the entries of a measurement matrix and the eigenvalues of its inverse, and thus generates GDOP without inverting a matrix. Simulation results are given, and the computational benefit of neural network-based satellite selection is discussed

Fault Tolerant Training for Optimal Interpolative Nets

The optimal interpolative (OI) classification network is extended to include fault tolerance and make the network more robust to the loss of a neuron. The OI net has the characteristic that the training data are fit with no more neurons than necessary. Fault tolerance further reduces the number of neurons generated during the learning procedure while maintaining the generalization capabilities of the network. The learning algorithm for the fault-tolerant OI net is presented in a recursive formal, allowing for relatively short training times. A simulated fault-tolerant OI net is tested on a navigation satellite selection proble

A Fault-Tolerant Optimal Interpolative Net

The optimal interpolative (OI) classification network is extended to include fault tolerance and make the network more robust to the loss of a neuron. The OI Net has the characteristic that the training data are fit with no more neurons than necessary. Fault tolerance further reduces the number of neurons generated during the learning procedure while maintaining the generalization capabilities of the network. The learning algorithm for the fault tolerant OI Net is presented in a recursive format, allowing for relatively short training times. A simulated fault tolerant OI Net is tested on a navigation satellite selective problem

A Fault-Tolerant Optimal Interpolative Net

The optimal interpolative (OI) classification network is extended to include fault tolerance and make the network more robust to the loss of a neuron. The OI Net has the characteristic that the training data are fit with no more neurons than necessary. Fault tolerance further reduces the number of neurons generated during the learning procedure while maintaining the generalization capabilities of the network. The learning algorithm for the fault tolerant OI Net is presented in a recursive format, allowing for relatively short training times. A simulated fault tolerant OI Net is tested on a navigation satellite selective problem

Design of Predictive Controllers by Dynamic Programming and Neural Networks

This paper proposes a method for the design of predictive controllers for nonlinear systems. The method consists of two phases, a solution phase and a learning phase. In the solution phase, dynamic programming is applied to obtain a closed-loop control law. In the learning phase, neural networks are used to simulate the control law. This phase overcomes the curse of dimensionality problem that has often hindered the implementation of control laws generated by dynamic programming. Experimental results demonstrate the effectiveness of the metho

The 1990 progress report and future plans

This document describes the progress and plans of the Artificial Intelligence Research Branch (RIA) at ARC in 1990. Activities span a range from basic scientific research to engineering development and to fielded NASA applications, particularly those applications that are enabled by basic research carried out at RIA. Work is conducted in-house and through collaborative partners in academia and industry. Our major focus is on a limited number of research themes with a dual commitment to technical excellence and proven applicability to NASA short, medium, and long-term problems. RIA acts as the Agency's lead organization for research aspects of artificial intelligence, working closely with a second research laboratory at JPL and AI applications groups at all NASA centers

A Training Sample Sequence Planning Method for Pattern Recognition Problems

In solving pattern recognition problems, many classification methods, such as the nearest-neighbor (NN) rule, need to determine prototypes from a training set. To improve the performance of these classifiers in finding an efficient set of prototypes, this paper introduces a training sample sequence planning method. In particular, by estimating the relative nearness of the training samples to the decision boundary, the approach proposed here incrementally increases the number of prototypes until the desired classification accuracy has been reached. This approach has been tested with a NN classification method and a neural network training approach. Studies based on both artificial and real data demonstrate that higher classification accuracy can be achieved with fewer prototypes