Search NASA⌕ Search

SEARCH · Search NASA

Results for “Scheduling and planning”

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 109 records · Page 6

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

Automated Planning and Scheduling for Orbital Express (151)

The challenging timeline for DARPA's Orbital Express mission demanded a flexible, responsive, and (above all) safe approach to mission planning. Because the mission was a technology demonstration, pertinent planning information was learned during actual mission execution. This information led to amendments to procedures, which led to changes in the mission plan. In general, we used the ASPEN planner scheduler to generate and validate the mission plans. We enhanced ASPEN to enable it to reason about uncertainty. We also developed a model generator that would read the text of a procedure and translate it into an ASPEN model. These technologies had a significant impact on the success of the Orbital Express mission.

autonomy↗

Constraints on future observing plans

Scheduling considerations in the deployment of transportable laser ranging systems (TLRS) in 1985 are discussed. The new TLRS units will be field tested in North America and Europe first before being sent to remote Mediterranean and South American sites. Six weeks' residence will be required for 600 hr of measurements at each site, although a second crew could bring the necessary time down to four weeks. The surveys are set for periods of the year with the greatest incidence of clear skies. Twelve sites have been selected in the Mediterranean area, although no weather data have been acquired. Site selections are constrained by the need for accessible roads, telephones, and the stability of the terrain. Details of the marker monument layouts are provided.

Coates, R. J.↗

The Consolidated Planning and Scheduling System for Space Transportation and Space Station operations - Successful development experience

In 1992, NASA made the decision to evolve a Consolidated Planning System (CPS) by adding the Space Transportation System (STS) requirements to the Space Station Freedom (SSF) planning software. This paper describes this evolutionary process, which began with a series of six-month design-build-test cycles, using a domain-independent architecture and a set of developmental tools known as the Advanced Scheduling Environment. It is shown that, during these tests, the CPS could be used at multiple organizational levels of planning and for integrating schedules from geographically distributed (including international) planning environments. The potential for using the CPS for other planning and scheduling tasks in the SSF program is being currently examined.

Hornstein, Rhoda S.↗

Multi-agent planning and scheduling, execution monitoring and incremental rescheduling: Application to motorway traffic

This article describes a planning method applicable to agents with great perception and decision-making capabilities and the ability to communicate with other agents. Each agent has a task to fulfill allowing for the actions of other agents in its vicinity. Certain simultaneous actions may cause conflicts because they require the same resource. The agent plans each of its actions and simultaneously transmits these to its neighbors. In a similar way, it receives plans from the other agents and must take account of these plans. The planning method allows us to build a distributed scheduling system. Here, these agents are robot vehicles on a highway communicating by radio. In this environment, conflicts between agents concern the allocation of space in time and are connected with the inertia of the vehicles. Each vehicle made a temporal, spatial, and situated reasoning in order to drive without collision. The flexibility and reactivity of the method presented here allows the agent to generate its plan based on assumptions concerning the other agents and then check these assumptions progressively as plans are received from the other agents. A multi-agent execution monitoring of these plans can be done, using data generated during planning and the multi-agent decision-making algorithm described here. A selective backtrack allows us to perform incremental rescheduling.

Mourou, Pascal↗

Autonomous planning and scheduling on the TechSat 21 mission

The Autonomous Sciencecraft Experiment (ASE) will fly onboard the Air Force TechSat 21 constellation of three spacecraft scheduled for launch in 2006. ASE uses onboard continuous planning, robust task and goal-based execution, model-based mode identification and reconfiguration, and onboard machine learning and pattern recognition to radically increase science return by enabling intelligent downlink selection and autonomous retargeting.

AI architectures applications intelligent agents m↗

Planning and scheduling the Hubble Space Telescope: Practical application of advanced techniques

NASA's Hubble Space Telescope (HST) is a major astronomical facility that was launched in April, 1990. In late 1993, the first of several planned servicing missions refurbished the telescope, including corrections for a manufacturing flaw in the primary mirror. Orbiting above the distorting effects of the Earth's atmosphere, the HST provides an unrivaled combination of sensitivity, spectral coverage and angular resolution. The HST is arguably the most complex scientific observatory ever constructed and effective use of this valuable resource required novel approaches to astronomical observation and the development of advanced software systems including techniques to represent scheduling preferences and constraints, a constraint satisfaction problem (CSP) based scheduler and a rule based planning system. This paper presents a discussion of these systems and the lessons learned from operational experience.

Miller, Glenn E.↗

MAPGEN : mixed initiative planning and scheduling for the Mars '03 MER mission

The Mars Exploration Rovers Mars '03 mission is one of NASA's most ambitious science missions to date. The rovers will be launched in the summer of 2003 with each rover carrying instruments to conduct remote and in-situ observation to elucidate the planet's past climate, water activity, and habitability. Science is the primary driver of MER and, as a consequence, making best use of the scientific instruments, within the available resources, is a crucial aspect of the mission. To address this critically, the MER project has selected MAPGEN (Mixed-Initiative Activity Plan GENerator) as an activity planning tool. MAPGEN combines two exiting systems, each with a strong heritage: APGEN the Activity Planning tool from the Jet Propulsion Laboratory and the Europs Planning/Scheduling system from NASA Ames Research Center. This paper discusses the issues arising from combining these tools in the context of this mission.

planning and scheduling↗

Language for Allocation and Network Scheduling

Programing Language for Allocation and Network Scheduling, Plans, handles many scheduling requirements of Space Shuttle program. Also generalized, high-level tree manipulation language.

Willoughby, J. K.↗

Software reuse in spacecraft planning and scheduling systems

The use of a software toolkit and development methodology that supports software reuse is described. The toolkit includes source-code-level library modules and stand-alone tools which support such tasks as data reformatting and report generation, simple relational database applications, user interfaces, tactical planning, strategic planning and documentation. The current toolkit is written in C and supports applications that run on IBM-PC's under DOS and UNlX-based workstations under OpenLook and Motif. The toolkit is fully integrated for building scheduling systems that reuse AI knowledge base technology. A typical scheduling scenario and three examples of applications that utilize the reuse toolkit will be briefly described. In addition to the tools themselves, a description of the software evolution and reuse methodology that was used is presented.

Mclean, David↗

An expert system for planning and scheduling in a telerobotic environment

A knowledge based approach to assigning tasks to multi-agents working cooperatively in jobs that require a telerobot in the loop was developed. The generality of the approach allows for such a concept to be applied in a nonteleoperational domain. The planning architecture known as the task oriented planner (TOP) uses the principle of flow mechanism and the concept of planning by deliberation to preserve and use knowledge about a particular task. The TOP is an open ended architecture developed with a NEXPERT expert system shell and its knowledge organization allows for indirect consultation at various levels of task abstraction. Considering that a telerobot operates in a hostile and nonstructured environment, task scheduling should respond to environmental changes. A general heuristic was developed for scheduling jobs with the TOP system. The technique is not to optimize a given scheduling criterion as in classical job and/or flow shop problems. For a teleoperation job schedule, criteria are situation dependent. A criterion selection is fuzzily embedded in the task-skill matrix computation. However, goal achievement with minimum expected risk to the human operator is emphasized.

Ntuen, Celestine A.↗