SEARCH · Engineering Papers

Results for “schedules”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 901 records · Page 50

All sources NASA NTRS DOE OSTI

NASA NTRS1987

An AI approach for scheduling space-station payloads at Kennedy Space Center

The Payload Processing for Space-Station Operations (PHITS) is a prototype modeling tool capable of addressing many Space Station related concerns. The system's object oriented design approach coupled with a powerful user interface provide the user with capabilities to easily define and model many applications. PHITS differs from many artificial intelligence based systems in that it couples scheduling and goal-directed simulation to ensure that on-orbit requirement dates are satisfied.

Castillo, D.↗

NASA NTRS1988

A traveling-salesman-based approach to aircraft scheduling in the terminal area

An efficient algorithm is presented, based on the well-known algorithm for the traveling salesman problem, for scheduling aircraft arrivals into major terminal areas. The algorithm permits, but strictly limits, reassigning an aircraft from its initial position in the landing order. This limitation is needed so that no aircraft or aircraft category is unduly penalized. Results indicate, for the mix of arrivals investigated, a potential increase in capacity in the 3 to 5 percent range. Furthermore, it is shown that the computation time for the algorithm grows only linearly with problem size.

Luenberger, Robert A.↗

NASA NTRS1988

A knowledge-based decision support system for payload scheduling

The role that artificial intelligence/expert systems technologies play in the development and implementation of effective decision support systems is illustrated. A recently developed prototype system for supporting the scheduling of subsystems and payloads/experiments for NASA's Space Station program is presented and serves to highlight various concepts. The potential integration of knowledge based systems and decision support systems which has been proposed in several recent articles and presentations is illustrated.

Floyd, Stephen↗

NASA NTRS1988

Lisp Object State Saver (LOSS): A facility used to save partial schedules of the Hubble Space Telescope

Current research in the area of long term scheduling of the Hubble Space Telescope is being done using Common Lisp and Flavors on Lisp Machines. The planning tools manipulate memory-resident data structures which represent the many entities and relationships that represent planning states. The Lisp Object State Saver (LOSS), a general purpose utility, was constructed which allows one to take a snapshot of memory by storing a representation of the structures in a text file. This text file can later be loaded thus restoring the pre-existing and logically equivalent planning state. A LOSS template must be created for each datatype to be stored and a simple grammar governs the creation of such templates.

Sponsler, Jeffrey L.↗

NASA NTRS1987

Application of gain scheduling to the control of batch bioreactors

The implementation of control algorithms to batch bioreactors is often complicated by the inherent variations in process dynamics during the course of fermentation. Such a wide operating range may render the performance of fixed gain PID controllers unsatisfactory. In this work, a detailed study on the control of batch fermentation is performed. Furthermore, a simple batch controller design is proposed which incorporates the concept of gain-scheduling, a subclass of adaptive control, with oxygen uptake rate as an auxiliary variable. The control of oxygen tension in the biorector is used as a vehicle to convey the proposed idea, analysis and results. Simulation experiments indicate significant improvement in controller performance can be achieved by the proposed approach even in the presence of measurement noise.

Cardello, Ralph↗

NASA NTRS1988

A knowledge-based decision support system for payload scheduling

This paper presents the development of a prototype Knowledge-based Decision Support System, currently under development, for scheduling payloads/experiments on space station missions. The DSS is being built on Symbolics, a Lisp machine, using KEE, a commercial knowledge engineering tool.

Tyagi, Rajesh↗

NASA NTRS1988

Automatic Scheduling and Planning (ASAP) in future ground control systems

This report describes two complementary approaches to the problem of space mission planning and scheduling. The first is an Expert System or Knowledge-Based System for automatically resolving most of the activity conflicts in a candidate plan. The second is an Interactive Graphics Decision Aid to assist the operator in manually resolving the residual conflicts which are beyond the scope of the Expert System. The two system designs are consistent with future ground control station activity requirements, support activity timing constraints, resource limits and activity priority guidelines.

Matlin, Sam↗

NASA NTRS1988

Run-time parallelization and scheduling of loops

The class of problems that can be effectively compiled by parallelizing compilers is discussed. This is accomplished with the doconsider construct which would allow these compilers to parallelize many problems in which substantial loop-level parallelism is available but cannot be detected by standard compile-time analysis. We describe and experimentally analyze mechanisms used to parallelize the work required for these types of loops. In each of these methods, a new loop structure is produced by modifying the loop to be parallelized. We also present the rules by which these loop transformations may be automated in order that they be included in language compilers. The main application area of the research involves problems in scientific computations and engineering. The workload used in our experiment includes a mixture of real problems as well as synthetically generated inputs. From our extensive tests on the Encore Multimax/320, we have reached the conclusion that for the types of workloads we have investigated, self-execution almost always performs better than pre-scheduling. Further, the improvement in performance that accrues as a result of global topological sorting of indices as opposed to the less expensive local sorting, is not very significant in the case of self-execution.

Saltz, Joel H.↗

NASA NTRS1988

Space languages: Solving the classic scheduling problem in Ada and Lisp

The comparison of programming languages is best seen while evaluating similar systems. The strengths and weaknesses of both languages were investigated as the scheduler was being implemented. Some features used in both languages shall be object-oriented paradigms, parallel programming, search and production heuristics, and other classical artificial intelligence implementations.

Davis, Stephen↗

NASA NTRS1989

Mission scheduling

How a neural network can work, compared to a hybrid system based on an operations research and artificial intelligence approach, is investigated through a mission scheduling problem. The characteristic features of each system are discussed.

Gaspin, Christine↗

NASA NTRS1988

Planning and scheduling in AI

An account is given of the many related activities employing AI that are classifiable as 'automatic planning and scheduling'. A human can form plans and successfully execute them, but no current automatic-planning AI system can match this robustness and generality; it is in fact suggested that automatic planning is unlikely to be achieved by a general-purpose planning system. It is judged likely that partially-specialized planners will emerge for the efficient solution of specific classes of problems. Current planners are also found to make unrealistic informational demands, especially in the requirement that the 'state of the world' be known at all times, and that the only changes that occur are under the planner's control.

Cheeseman, Peter↗

NASA NTRS1990

Algorithm Schedules Airplane Landings

Algorithm schedules arrivals of airplanes to reduce average or overall landing delay. Rearranges order of landing according to weight class of each airplane. Limits extent of one rearrangement to avoid penalizing any airplane or category of airplanes.

Luenberger, Robert A.↗

NASA NTRS1990

Electric power scheduling: A distributed problem-solving approach

Space Station Freedom's power system, along with the spacecraft's other subsystems, needs to carefully conserve its resources and yet strive to maximize overall Station productivity. Due to Freedom's distributed design, each subsystem must work cooperatively within the Station community. There is a need for a scheduling tool which will preserve this distributed structure, allow each subsystem the latitude to satisfy its own constraints, and preserve individual value systems while maintaining Station-wide integrity. The value-driven free-market economic model is such a tool.

Mellor, Pamela A.↗

NASA NTRS1990

Run-time parallelization and scheduling of loops

Run time methods are studied to automatically parallelize and schedule iterations of a do loop in certain cases, where compile-time information is inadequate. The methods presented involve execution time preprocessing of the loop. At compile-time, these methods set up the framework for performing a loop dependency analysis. At run time, wave fronts of concurrently executable loop iterations are identified. Using this wavefront information, loop iterations are reordered for increased parallelism. Symbolic transformation rules are used to produce: inspector procedures that perform execution time preprocessing and executors or transformed versions of source code loop structures. These transformed loop structures carry out the calculations planned in the inspector procedures. Performance results are presented from experiments conducted on the Encore Multimax. These results illustrate that run time reordering of loop indices can have a significant impact on performance. Furthermore, the overheads associated with this type of reordering are amortized when the loop is executed several times with the same dependency structure.

Saltz, Joel H.↗

NASA NTRS1991

Aiming Schedule For Orbiting Astrometric Telescope

Report discusses schedule of observation times and aiming directions of proposed astrometric telescope facility mounted on Space Station in orbit around Earth. Primarily makes repeated observations of apparent positions of each of 127 selected stars with respect to distant reference stars in same field of view known to have unperturbed proper motions. Purpose of observations to detect motions of selected stars about centers of mass and to analyze harmonic content of motions to infer existence, number, masses, and orbital radii of planets.

Mascy, Alfred C.↗

NASA NTRS1988

Software sizing, cost estimation and scheduling

The Technology Implementation and Support Section at Martin Marietta Astronautics Group Denver is tasked with software development analysis, data collection, software productivity improvement and developing and applying various computerized software tools and models. The computerized tools are parametric models that reflect actuals taken from the large data base of completed software development projects. Martin Marietta's data base consists of over 300 completed projects and hundreds of cost estimating relationships (CERs) that are used in sizing, costing, scheduling and productivity improvement equations, studies, models and computerized tools.

Cheadle, William G.↗

NASA NTRS1991

User interface issues in supporting human-computer integrated scheduling

Explored here is the user interface problems encountered with the Operations Missions Planner (OMP) project at the Jet Propulsion Laboratory (JPL). OMP uses a unique iterative approach to planning that places additional requirements on the user interface, particularly to support system development and maintenance. These requirements are necessary to support the concepts of heuristically controlled search, in-progress assessment, and iterative refinement of the schedule. The techniques used to address the OMP interface needs are given.

Cooper, Lynne P.↗

NASA NTRS1990

Sensitivity of high-accuracy Tracking and Data Relay Satellite System (TDRSS) user spacecraft orbit determination to tracking schedules

The results of a study to analyze the dependence of TDRSS user spacecraft orbit determination consistencies on varying tracking schedules are presented. In this study, the TDRS-East orbit determination results obtained utilizing Bilateration Ranging Transponder System data were evaluated. Six state parameters, three position and three velocity components and the solar radiation pressure coefficient, are estimated for TDRS-East. It is concluded that, in order to achieve high-precision orbit determination, the tracking coverage should not fall below 10 minutes every two orbits as decreasing it to every four orbits will significantly degrade the accuracy; present state-of-the-art consistency in orbit determination using TDRSS tracking is approximately 15 to 20 meters.

Doll, C. E.↗