Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “schedule”

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.

At least 1,081 records · Page 60

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↗

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.↗

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.↗

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.↗

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.↗

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.↗

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.↗

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.↗

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.

Mellor, Pamela A.↗

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, wavefronts 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 indexes can have a significant impact on performance.

Saltz, Joel H.↗

Computer-Assisted Scheduling System (COMPASS)

COMPASS is interactive planning and scheduling software system used like spreadsheet. System places activities only at feasible times, taking into consideration all constraints imposed upon activity and resources it requires. Version 1.4 written in Ada and contains standard X-Windows interfaces written in C.

Fox, Barry R.↗

Effects of partitioning and scheduling sparse matrix factorization on communication and load balance

A block based, automatic partitioning and scheduling methodology is presented for sparse matrix factorization on distributed memory systems. Using experimental results, this technique is analyzed for communication and load imbalance overhead. To study the performance effects, these overheads were compared with those obtained from a straightforward 'wrap mapped' column assignment scheme. All experimental results were obtained using test sparse matrices from the Harwell-Boeing data set. The results show that there is a communication and load balance tradeoff. The block based method results in lower communication cost whereas the wrap mapped scheme gives better load balance.

Venugopal, Sesh↗

Initial Hardware Development Schedule

The hardware development schedule for the Common Lunar Lander's (CLLs) tracking system is presented. Among the topics covered are the following: historical perspective, solution options, industry contacts, and the rationale for selection.

Culpepper, William X.↗

The entropy reduction engine: Integrating planning, scheduling, and control

The Entropy Reduction Engine, an architecture for the integration of planning, scheduling, and control, is described. The architecture is motivated, presented, and analyzed in terms of its different components; namely, problem reduction, temporal projection, and situated control rule execution. Experience with this architecture has motivated the recent integration of learning. The learning methods are described along with their impact on architecture performance.

Drummond, Mark↗

Design and scheduling for periodic concurrent error detection and recovery in processor arrays

Periodic application of time-redundant error checking provides the trade-off between error detection latency and performance degradation. The goal is to achieve high error coverage while satisfying performance requirements. We derive the optimal scheduling of checking patterns in order to uniformly distribute the available checking capability and maximize the error coverage. Synchronous buffering designs using data forwarding and dynamic reconfiguration are described. Efficient single-cycle diagnosis is implemented by error pattern analysis and direct-mapped recovery cache. A rollback recovery scheme using start-up control for local recovery is also presented.

Wang, Yi-Min↗

Obtaining schedules for digital systems

A systematic technique is presented to derive correct schedules for a synchronous digital system, given a signal flow graph for an algorithm. It is also shown how to use this technique to derive designs that are optimal in having the lowest latency, the highest throughput, or the smallest number of registers. The same technique can also be used to verify digital systems that have already been designed.

Jagadish, H. V.↗

Seamless transitions from early prototypes to mature operational software - A technology that enables the process for planning and scheduling applications

New and innovative software technology is presented that provides a cost effective bridge for smoothly transitioning prototype software, in the field of planning and scheduling, into an operational environment. Specifically, this technology mixes the flexibility and human design efficiency of dynamic data typing with the rigor and run-time efficiencies of static data typing. This new technology provides a very valuable tool for conducting the extensive, up-front system prototyping that leads to specifying the correct system and producing a reliable, efficient version that will be operationally effective and will be accepted by the intended users.

Hornstein, Rhoda S.↗

Scheduling of an aircraft fleet

Scheduling is the task of assigning resources to operations. When the resources are mobile vehicles, they describe routes through the served stations. To emphasize such aspect, this problem is usually referred to as the routing problem. In particular, if vehicles are aircraft and stations are airports, the problem is known as aircraft routing. This paper describes the solution to such a problem developed in OMAR (Operative Management of Aircraft Routing), a system implemented by Bull HN for Alitalia. In our approach, aircraft routing is viewed as a Constraint Satisfaction Problem. The solving strategy combines network consistency and tree search techniques.

Paltrinieri, Massimo↗