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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS1998

Using Iterative Repair to Increase the Responsiveness of Planning and Scheduling for Autonomous Spacecraft

An autonomous spacecraft must balance long-term and short-term considerations. It must perform purposeful activities that ensure long-term science and engineering goals are achieved and ensure that it maintains positive resource margins. This requires planning in advance to avoid a series of shortsighted decisions that can lead to failure, However, it must also respond in a timely fashion to a somewhat dynamic and unpredictable environment. Thus, spacecraft plans must often be modified due to fortuitous events such as early completion of observations and setbacks such as failure to acquire a guidestar for a science observation. This paper describes the use of iterative repair to support continuous modification and updating of a current working plan in light of changing operating context.

Chien, Steve↗
NASA NTRS1992

Reducing the complexity of software systems - A strategic software perspective

The results of a combined management and technical initiative aimed at reducing the size and complexity associated with developing operations planning, scheduling, and resource management software systems are presented. The initiative has produced operations concepts, functional requirements, system architectures, a comprehensive lexicon, and software tools to revolutionize the traditional software technology and development practices for planning, scheduling, and resource management systems used in space operations control centers. Examples of technology and practices to reduce complexity include a method for projecting design consequences from an operations concept, a universal architecture for heuristic algorithms, an object-oriented framework for describing large classes of problems that parametrically adapt to all domain peculiarities, the identification of general approaches which respond to changes with minimum impact on systems implementations, and a management structure for prototyping to minimize the risks of ill-conceived designs.

Hornstein, Rhoda S.↗
NASA NTRS2008

Verification and Planning Based on Coinductive Logic Programming

Coinduction is a powerful technique for reasoning about unfounded sets, unbounded structures, infinite automata, and interactive computations [6]. Where induction corresponds to least fixed point's semantics, coinduction corresponds to greatest fixed point semantics. Recently coinduction has been incorporated into logic programming and an elegant operational semantics developed for it [11, 12]. This operational semantics is the greatest fix point counterpart of SLD resolution (SLD resolution imparts operational semantics to least fix point based computations) and is termed co- SLD resolution. In co-SLD resolution, a predicate goal p( t) succeeds if it unifies with one of its ancestor calls. In addition, rational infinite terms are allowed as arguments of predicates. Infinite terms are represented as solutions to unification equations and the occurs check is omitted during the unification process. Coinductive Logic Programming (Co-LP) and Co-SLD resolution can be used to elegantly perform model checking and planning. A combined SLD and Co-SLD resolution based LP system forms the common basis for planning, scheduling, verification, model checking, and constraint solving [9, 4]. This is achieved by amalgamating SLD resolution, co-SLD resolution, and constraint logic programming [13] in a single logic programming system. Given that parallelism in logic programs can be implicitly exploited [8], complex, compute-intensive applications (planning, scheduling, model checking, etc.) can be executed in parallel on multi-core machines. Parallel execution can result in speed-ups as well as in larger instances of the problems being solved. In the remainder we elaborate on (i) how planning can be elegantly and efficiently performed under real-time constraints, (ii) how real-time systems can be elegantly and efficiently model- checked, as well as (iii) how hybrid systems can be verified in a combined system with both co-SLD and SLD resolution. Implementations of co-SLD resolution as well as preliminary implementations of the planning and verification applications have been developed [4]. Co-LP and Model Checking: The vast majority of properties that are to be verified can be classified into safety properties and liveness properties. It is well known within model checking that safety properties can be verified by reachability analysis, i.e, if a counter-example to the property exists, it can be finitely determined by enumerating all the reachable states of the Kripke structure.

Bansal, Ajay↗
NASA NTRS2009

Mission Planning and Scheduling System for NASA's Lunar Reconnaissance Mission

In the framework of NASA's return to the Moon efforts, the Lunar Reconnaissance Orbiter (LRO) is the first step. It is an unmanned mission to create a comprehensive atlas of the Moon's features and resources necessary to design and build a lunar outpost. LRO is scheduled for launch in April, 2009. LRO carries a payload comprised of six instruments and one technology demonstration. In addition to its scientific mission LRO will use new technologies, systems and flight operations concepts to reduce risk and increase productivity of future missions. As part of the effort to achieve robust and efficient operations, the LRO Mission Operations Team (MOT) will use its Mission Planning System (MPS) to manage the operational activities of the mission during the Lunar Orbit Insertion (LOI) and operational phases of the mission. The MPS, based on GMV's flexplan tool and developed for NASA with Honeywell Technology Solutions (prime contractor), will receive activity and slew maneuver requests from multiple science operations centers (SOC), as well as from the spacecraft engineers. flexplan will apply scheduling rules to all the requests received and will generate conflict free command schedules in the form of daily stored command loads for the orbiter and a set of daily pass scripts that help automate nominal real-time operations.

Garcia, Gonzalo↗
NASA NTRS1990

Knowledge based automated scheduling and planning tools for IUE

The International Ultraviolet Explorer has been successfully operated as a real time user-interactive space observatory for twelve years. It is expected to continue operation for up to five additional years, but under increasing constraints. The option to operate IUE in a more automated, non user-interactive mode is under consideration. A sophisticated software system to support such an operation is a clear requirement. The conceptual framework of such a system is described. Results of a preliminary tests are presented for which a hypothetical four day schedule of space-craft activities at a time resolutions as low as ten minutes was generated.

Shrader, Chris R.↗
NASA NTRS1987

Planning and scheduling for robotic assembly

A system for reasoning about robotic assembly tasks is described. The first element of this system is a facility for itemizing the constraints which determine the admissible orderings over the activities to be sequenced. The second element is a facility which partitions the activities into independent subtasks and produces a set of admissible strategies for each. Finally, the system has facilities for constructing an admissible sequence of activities which is consistent with the given constraints. This can be done off-line, in advance of task execution, or it can be done incrementally, at execution time, according to conditions in the execution environment. The language of temporal constraints and the methods of inference presented in related papers are presented. It is shown how functional and spatial relationships between components impose temporal constraints on the order of assembly and how temporal constraints then imply admissible strategies and feasible sequences.

Fox, Barry R.↗
NASA NTRS1991

Proposed planning and scheduling services for the SNC in the CDOS era

Studies indicate that the current NCC mode of operation needs to be enhanced to meet the needs of the mid to late 19990's. There is a need to simplify the request interface for Space Network services. This is because there are more complex missions, more flexible spacecraft operations, more scheduling data volume, and more events per spacecraft and scheduling period.

Welden, Todd↗
NASA NTRS1991

Task planning and scheduling: Toward real-time expert system autonomous control

Research under this grant successfully developed and tested the Interruptable Control System (ICE). The best description of ICE is in the M.S. thesis of Jim Vezina, who was the primary designer and implementer of ICE. Vezina's thesis is included as the bulk of this report. To test the general usefulness and maintainability of the ICE System, the examples of the ICE system in action given in Vezina's thesis were extended. The extensions consisted of two components: debugging and rewriting the simulation of passive and active agents, both controlled and uncontrolled, and benchmarking more extensively the HES expert system concerned with monitoring sensors. The expert system was chosen because it demonstrates the ability of CLIPS.

Sterling, Leon↗
NASA NTRS2001

Planning and Scheduling for Fleets of Earth Observing Satellites

We address the problem of scheduling observations for a collection of earth observing satellites. This scheduling task is a difficult optimization problem, potentially involving many satellites, hundreds of requests, constraints on when and how to service each request, and resources such as instruments, recording devices, transmitters, and ground stations. High-fidelity models are required to ensure the validity of schedules; at the same time, the size and complexity of the problem makes it unlikely that systematic optimization search methods will be able to solve them in a reasonable time. This paper presents a constraint-based approach to solving the Earth Observing Satellites (EOS) scheduling problem, and proposes a stochastic heuristic search method for solving it.

Frank, Jeremy↗
NASA NTRS2010

Assessment of Scheduling and Plan Execution of Apollo 14 Lunar Surface Operations

Although over forty years have passed since first landing on the Moon, there is not yet a comprehensive, quantitative assessment of Apollo extravehicular activities (EVAs). Quantitatively evaluating lunar EVAs will provide a better understanding of the challenges involved with surface operations. This first evaluation of a surface EVA centers on comparing the planned and the as-ran timeline, specifically collecting data on discrepancies between durations that were estimated versus executed. Differences were summarized by task categories in order to gain insight as to the type of surface operation activities that were most challenging. One Apollo 14 EVA was assessed utilizing the described methodology. Selected metrics and task categorizations were effective, and limitations to this process were identified.

Marquez, Jessica J.↗
NASA NTRS2015

Integrating Human Performance Measures into Space Operations: Beyond Our Scheduling Capabilities?

Current planning and scheduling software tools for International Space Station (ISS) support different flight controller teams as they plan daily space operations. Planning and scheduling tools capabilities include integrating digitized ISS state inputs, evaluating their expected future states, and propagating them over time. Extensive, custom-made computational models of operations, of objectives, and of operational constraints help ISS flight controllers identify where scheduled events violate constraints. Based on the current capabilities of these tools, this paper proposes how human performance measures could be better integrated into planning and scheduling tools for space mission operations. Future integration of human performance measures could be applied to state inputs (in this case, the astronaut’s state) and to modeling human performance operational constraints & operational objectives (i.e., assigned activities) with parameters that are relevant to human performance measures. Gaps between the state-of-the-art for human performance modeling and planning tools for future exploration missions are identified.

space operations↗