Browsing by Author "Yan, I."
Now showing 1 - 3 of 3
Results Per Page
Sort Options
Item An Expert System for Control and Signal Processing With Automatic FORTRAN Program Generation.(1986) Chancelier, P.; Gomez, C.; Quadrat, J.P.; Sulem, A.; Blankenehip, Gilmer L.; LaVigna, Anthony; MacEnany, David C.; Yan, I.; ISRA prototype expert system for the treatment of stochastic control and nonlinear signal processing problems is described with several illustrative examples. The system is written In MACSYMA, LISP and PROLOG. It accepts user input in natural language or symbolic form; it carries out the basic analysis of the user's problem in symbolic form (e.g., computing the Bellman dynamic programming equations for stochastic control problems or the Zakai equation and the estimation Lie algebra or likelihood ratio for nonlinear filtering problems); and it produces output in the form of automatically generated FORTRAN code for the flannel numerical reduction of the problem. The system also has a module using PROLOG which can check the well-posedness (existence and uniqueness) of certain classes of linear and nonlinear partial differential equations specified in symbolic form by computing a natural Sobolev space for the solutions and verifying classical existence and uniqueness criteria for the given equation using MACSYMA for the computations and PROLOG for the logical analysis. Sample sessions with three of the modules of the system are presented to illustrate its operation. The status of the system and plans for its further development are described.Item Search for Randomly Moving Targets I: Estimation.(1987) Yan, I.; Blankenehip, Gilmer L.; ISRThe detection search problem is the identification of search paths for a specified time interval [0,T], so that the expected number of surviving targets at time T is minimized. The problem can be solved in real time only when the two major procedures: (1) estimation of target posterior distribution; and (2) evaluation of optimal controls (search path planning) based on this posterior target distribution can be done on line. The unnormalized target conditional pdf, p{ABOVE ~}(t, {SOME GREEK LETTER}|x^t_0), satisfies a linear partial differential equation, too complex to be solved on line. Hence, a dual stochastic optimal control problem (in fact, a conventional LQG problem) by using a logarithmic transformation. A special case of the dual problem is studied in detail and a recursive formula is obtained for updating the target's conditional density. The search path planning problem is treated in Part II.Item Stochastic Unit Commitment Scheduling and Dispatch of Electric Power Systems.(1985) Yan, I.; Blankenehip, Gilmer L.; ISRUnit commitment, including economic dispatch, is a key component of short term operation scheduling of an electric energy system. Common industry practice is based on the use of a 'priority list' for generation scheduling and a deterministic model for power/energy demand. The priority list specifies the next unit to be started or shutdown in response to an increase or decrease in load. A common problem in the use of priority lists is that the next unit is improperly sized to meet the actual change in load. The algorithm proposed here is more accurate than the priority list method , much faster than dynamic programming which can hardly be applied to systems of more 5 machines. For a system of 41 machines, the algorithm can determine schedules in 0.1 second which is test enough for on-line control. Furthermore the total generating cost is superior to that obtained by dynamic programming successive approximations.