Construction of the minimal time control for processes with bounded control amplitudes and rates.
Linear time varying processes minimal time control by maximum principle to construct extremal control as explicit time function
Luh, J. Y. S.↗
SEARCH · Search NASA
Results for “time minimization”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
A stopping theoretic approach to minimal time detection of system parameter change
The problem of minimal time detection of abrupt parameter changes in linear stochastic systems considered. The problem is posed as an optimal stopping problem for the detection in change of the induced probability measure. Under the assumption of a prior distribution for the time of change (or disruption) a stopping rule is given which minimizes the average detection delay when there is knowledge of the new measure after the change. When the new induced measure is unknown, a stopping rule is given, based only on the noisy observations and is shown to be better than the a priori knowlege of the disruption time.
Mazumdar, Ravi R.↗
An approximate minimal time closed-loop controller for processes with bounded control amplitudes and rates.
Minimal time closed loop controller design for linear systems with bounded control amplitudes and rates
Luh, J. Y. S.↗
An approximate minimal time closed-loop controller for processes with bounded control amplitudes and rates
Minimal time closed loop controller design for linear systems with bounded control amplitudes and rates using approximate functional expression
Luh, J. Y. S.↗
The minimal time detection algorithm
An aerospace vehicle may operate throughout a wide range of flight environmental conditions that affect its dynamic characteristics. Even when the control design incorporates a degree of robustness, system parameters may drift enough to cause its performance to degrade below an acceptable level. The object of this paper is to develop a change detection algorithm so that we can build a highly adaptive control system applicable to aircraft systems. The idea is to detect system changes with minimal time delay. The algorithm developed is called Minimal Time-Change Detection Algorithm (MT-CDA) which detects the instant of change as quickly as possible with false-alarm probability below a certain specified level. Simulation results for the aircraft lateral motion with a known or unknown change in control gain matrices, in the presence of doublet input, indicate that the algorithm works fairly well as theory indicates though there is a difficulty in deciding the exact amount of change in some situations. One of MT-CDA distinguishing properties is that detection delay of MT-CDA is superior to that of Whiteness Test.
Kim, Sungwan↗
Minimal time change detection algorithm for reconfigurable control system and application to aerospace
System parameters should be tracked on-line to build a reconfigurable control system even though there exists an abrupt change. For this purpose, a new performance index that we are studying is the speed of adaptation- how quickly does the system determine that a change has occurred? In this paper, a new, robust algorithm that is optimized to minimize the time delay in detecting a change for fixed false alarm probability is proposed. Simulation results for the aircraft lateral motion with a known or unknown change in control gain matrices, in the presence of doublet input, indicate that the algorithm works fairly well. One of its distinguishing properties is that detection delay of this algorithm is superior to that of Whiteness Test.
Kim, Sungwan↗
Real-Time Minimization of Tracking Error for Aircraft Systems
This technology presents a novel, stable, discrete-time adaptive law for flight control in a Direct adaptive control (DAC) framework. Where errors are not present, the original control design has been tuned for optimal performance. Adaptive control works towards achieving nominal performance whenever the design has modeling uncertainties/errors or when the vehicle suffers substantial flight configuration change. The baseline controller uses dynamic inversion with proportional-integral augmentation. On-line adaptation of this control law is achieved by providing a parameterized augmentation signal to a dynamic inversion block. The parameters of this augmentation signal are updated to achieve the nominal desired error dynamics. If the system senses that at least one aircraft component is experiencing an excursion and the return of this component value toward its reference value is not proceeding according to the expected controller characteristics, then the neural network (NN) modeling of aircraft operation may be changed.
Garud, Sumedha↗
Real-time minimal bit error probability decoding of convolutional codes
A recursive procedure is derived for decoding of rate R=1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e. fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications such as in the inner coding system for concatenated coding.
Lee, L. N.↗
Minimal time control of linear systems with control amplitude and rate saturations
Time optimal control of linear systems with constraints on control amplitude and rate
Luh, J. Y. S.↗
Multi-Objective Multi-User Scheduling for Space Science Missions
We have developed an architecture called MUSE (Multi-User Scheduling Environment) to enable the integration of multi-objective evolutionary algorithms with existing domain planning and scheduling tools. Our approach is intended to make it possible to re-use existing software, while obtaining the advantages of multi-objective optimization algorithms. This approach enables multiple participants to actively engage in the optimization process, each representing one or more objectives in the optimization problem. As initial applications, we apply our approach to scheduling the James Webb Space Telescope, where three objectives are modeled: minimizing wasted time, minimizing the number of observations that miss their last planning opportunity in a year, and minimizing the (vector) build up of angular momentum that would necessitate the use of mission critical propellant to dump the momentum. As a second application area, we model aspects of the Cassini science planning process, including the trade-off between collecting data (subject to onboard recorder capacity) and transmitting saved data to Earth. A third mission application is that of scheduling the Cluster 4-spacecraft constellation plasma experiment. In this paper we describe our overall architecture and our adaptations for these different application domains. We also describe our plans for applying this approach to other science mission planning and scheduling problems in the future.
science planning↗
Simulations for Full Unit-memory and Partial Unit-memory Convolutional Codes with Real-time Minimal-byte-error Probability Decoding Algorithm
A program which was written to simulate Real Time Minimal-Byte-Error Probability (RTMBEP) decoding of full unit-memory (FUM) convolutional codes on a 3-bit quantized AWGN channel is described. This program was used to compute the symbol-error probability of FUM codes and to determine the signal to noise (SNR) required to achieve a bit error rate (BER) of 10 to the minus 6th power for corresponding concatenated systems. A (6,6/30) FUM code, 6-bit Reed-Solomon code combination was found to achieve the required BER at a SNR of 1.886 dB. The RTMBEP algorithm was then modified for decoding partial unit-memory (PUM) convolutional codes. A simulation program was also written to simulate the symbol-error probability of these codes.
Vo, Q. D.↗
Design and architecture of the Mars relay network planning and analysis framework
In this paper we describe the design and architecture of the Mars Network planning and analysis framework that supports generation and validation of efficient planning and scheduling strategy. The goals are to minimize the transmitting time, minimize the delaying time, and/or maximize the network throughputs. The proposed framework would require (1) a client-server architecture to support interactive, batch, WEB, and distributed analysis and planning applications for the relay network analysis scheme, (2) a high-fidelity modeling and simulation environment that expresses link capabilities between spacecraft to spacecraft and spacecraft to Earth stations as time-varying resources, and spacecraft activities, link priority, Solar System dynamic events, the laws of orbital mechanics, and other limiting factors as spacecraft power and thermal constraints, (3) an optimization methodology that casts the resource and constraint models into a standard linear and nonlinear constrained optimization problem that lends itself to commercial off-the-shelf (COTS)planning and scheduling algorithms.
Mars relay network planning analysis↗
Improved circuit minimizes generation time of pseudonoise check bits
Computer switching network consists of parallel and series combinations of mod 2 adders using the minimum number of gating levels. This network minimizes the propagation time in which a sequence of pseudonoise check bits are generated.
Anderson, T. O.↗
Minimizing the time to troubleshoot a failed system
A procedure is presented to determine the order in which to inspect the components of a failed series system so as to minimize the expected time until the failed component is isolated. The model includes the case in which inspection of a component may falsely indicate the component is functioning.
Subelman, E. J.↗
Fuel conservative guidance concept for shipboard landing of powered-life aircraft
A simulation study was undertaken to investigate the application of energy conservative guidance (ECG) software, developed at NASA Ames Research Center, to improve the time and fuel efficiency of powered lift airplanes operating from aircraft carriers at sea. When a flightpath is indicated by a set of initial conditions for the aircraft and a set of positional waypoints with associated airspeeds, the ECG software synthesizes the necessary guidance commands to optimize fuel and time along the specified path. A major feature of the ECG system is the ability to synthesize a trajectory that will allow the aircraft to capture the specified path at any waypoint with the desired heading and airspeed from an arbitrary set of initial conditions. Five paths were identified and studied. These paths demonstrate the ECG system's ability to save flight time and fuel by more efficiently managing the aircraft's capabilities. Results of this simulation study show that when restrictions on the approach flightpath imposed for manual operation are removed completely, fuel consumption during the approach was reduced by as much as 49% (610 lb fuel) and the time required to fly the flightpath was reduced by as much as 41% (5 min). Savings due to ECG were produced by: (1) shortening the total flight time; (2) keeping the airspeed high as long as possible to minimize time spent flying in a regime in which more engine thrust is required for lift to aid the aerodynamic lift; (3) minimizing time spent flying at constant altitude at slow airspeeds; and (4) synthesizing a path from any location for a direct approach to landing without entering a holding pattern or other fixed approach path.
Warner, D. N., Jr.↗
Balancing antagonistic time and resource utilization constraints in over-subscribed scheduling problems
In this paper, we report work aimed at applying concepts of constraint-based problem structuring and multi-perspective scheduling to an over-subscribed scheduling problem. Previous research has demonstrated the utility of these concepts as a means for effectively balancing conflicting objectives in constraint-relaxable scheduling problems, and our goal here is to provide evidence of their similar potential in the context of HST observation scheduling. To this end, we define and experimentally assess the performance of two time-bounded heuristic scheduling strategies in balancing the tradeoff between resource setup time minimization and satisfaction of absolute time constraints. The first strategy considered is motivated by dispatch-based manufacturing scheduling research, and employs a problem decomposition that concentrates local search on minimizing resource idle time due to setup activities. The second is motivated by research in opportunistic scheduling and advocates a problem decomposition that focuses attention on the goal activities that have the tightest temporal constraints. Analysis of experimental results gives evidence of differential superiority on the part of each strategy in different problem solving circumstances. A composite strategy based on recognition of characteristics of the current problem solving state is then defined and tested to illustrate the potential benefits of constraint-based problem structuring and multi-perspective scheduling in over-subscribe scheduling problems.
Smith, Stephen F.↗
Results of using the global positioning system to maintain the time and frequency synchronization in the Deep Space Network
There are two hydrogen maser clocks located at each signal processing center (SPC) in the DSN. Close coordination of the time and frequency of the SPC clocks is needed to navigate spacecraft to the outer planets. A recent example was the Voyager spacecraft's encounter with Uranus in January 1986. The clocks were adjusted with the goal of minimizing time and frequency offsets between the SPCs at encounter. How time and frequency at each SPC is estimated using data acquired from the Global Positioning System Timing Receivers operating on the NBS-BIH (National Bureau of Standards-Bureau International de l'Heure) tracking schedule is described. These data are combined with other available timing receiver data to calculate the time offset estimates. The adjustment of the clocks is described. It was determined that long range hydrogen maser drift is quite predictable and adjustable within limits. This enables one to minimize time and frequency differences between the three SPCs for many months by matching the drift rates of the three standards. Data acquisition and processing techniques using a Kalman filter to make estimates of time and frequency offsets between the clocks at the SPCs and UTC(NBS) (Coordinated Universal Time realized at NBS) are described.
Clements, P. A.↗
Real-time minimal-bit-error probability decoding of convolutional codes
A recursive procedure is derived for decoding of rate R = 1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit, subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e., fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications, such as in the inner coding system for concatenated coding.
Lee, L.-N.↗