Engineering topics

Morris, Robert

Publications and source records attributed to Morris, Robert.

At least 19 records

NASA NTRS2019

Scheduling and Airport Taxiway Path Planning Under Uncertainty

Congestion and uncertainty on the airport surface are major constraints to the available capacity of the air transport system. This project is to study the problem of planning and scheduling airport surface movement at large airports. Specifically, we focus on the departure time scheduling and taxiway path planning of multiple aircraft under uncertainty. We also developed a simulation tool that is capable of simulating aircraft movement along the taxiway and possible uncertainty during the movement.

Li, Jiaoyang↗

NASA NTRS2018

Dynamic Scheduling Under Uncertainty

Often, autonomous agents that operate in real-world environments must be able to schedule and execute actions to accomplish mission goals while being robust to uncertainty and disturbances that arise during operations. This tutorial will focus on classes of models and algorithms that have been used to enable effective, robust strategies for dynamically dispatching plans in real time. The tutorial will begin with a survey of past and current research in modeling uncertainty in planning and scheduling, as well as research in different classes of approaches to dynamic scheduling. We then focus on a general class of approaches based on executing temporal plans using graphical models of events and their temporal ordering. These approaches allow for ensuring temporal flexibility in scheduling, as well as for developing strategies for executing partially controllable plans.

Morris, Robert↗

NASA NTRS2017

An Integrated System for Autonomous Search and Track with a Small Unmanned Aerial Vehicle

This article presents a framework for searching, detecting, and tracking an object of interest with a small unmanned aerial vehicle (sUAV). The vehicle is given an area to search for an object of interest. Once the object is detected, the sUAV follows the target while maintaining a fixed distance and centered on its image plane. This paper describes an architecture for integrating autonomy capabilities for search and track for sUAVs. The system has been implemented in the Robot Operating System (ROS) framework using the Parrot ARDrone platform. In this paper we present our technical approach, the system architecture and demonstrate the principles of the approach in a simulation environment and indoor flight tests.

Unmanned Aerial Vehicle↗

NASA NTRS2005

Constraint-based Temporal Reasoning with Preferences

Often we need to work in scenarios where events happen over time and preferences are associated to event distances and durations. Soft temporal constraints allow one to describe in a natural way problems arising in such scenarios. In general, solving soft temporal problems require exponential time in the worst case, but there are interesting subclasses of problems which are polynomially solvable. In this paper we identify one of such subclasses giving tractability results. Moreover, we describe two solvers for this class of soft temporal problems, and we show some experimental results. The random generator used to build the problems on which tests are performed is also described. We also compare the two solvers highlighting the tradeoff between performance and robustness. Sometimes, however, temporal local preferences are difficult to set, and it may be easier instead to associate preferences to some complete solutions of the problem. To model everything in a uniform way via local preferences only, and also to take advantage of the existing constraint solvers which exploit only local preferences, we show that machine learning techniques can be useful in this respect. In particular, we present a learning module based on a gradient descent technique which induces local temporal preferences from global ones. We also show the behavior of the learning module on randomly-generated examples.

Khatib, Lina↗

NASA NTRS2005

Coordinated Science Campaign Scheduling for Sensor Webs

Future Earth observing missions will study different aspects and interacting pieces of the Earth's eco-system. Scientists are designing increasingly complex, interdisciplinary campaigns to exploit the diverse capabilities of multiple Earth sensing assets. In addition, spacecraft platforms are being configured into clusters, trains, or other distributed organizations in order to improve either the quality or the coverage of observations. These simultaneous advances in the design of science campaigns and in the missions that will provide the sensing resources to support them offer new challenges in the coordination of data and operations that are not addressed by current practice. For example, the scheduling of scientific observations for satellites in low Earth orbit is currently conducted independently by each mission operations center. An absence of an information infrastructure to enable the scheduling of coordinated observations involving multiple sensors makes it difficult to execute campaigns involving multiple assets. This paper proposes a software architecture and describes a prototype system called DESOPS (Distributed Earth Science Observation Planning and Scheduling) that will address this deficiency.

Edgington, Will↗

NASA NTRS2004

Automated Recognition of Geologically Significant Shapes in MER PANCAM and MI Images

Autonomous recognition of scientifically important information provides the capability of: 1) Prioritizing data return; 2) Intelligent data compression; 3) Reactive behavior onboard robotic vehicles. Such capabilities are desirable as mission scenarios include longer durations with decreasing interaction from mission control. To address such issues, we have implemented several computer algorithms, intended to autonomously recognize morphological shapes of scientific interest within a software architecture envisioned for future rover missions. Mars Exploration Rovers (MER) instrument payloads include a Panoramic Camera (PANCAM) and Microscopic Imager (MI). These provide a unique opportunity to evaluate our algorithms when applied to data obtained from the surface of Mars. Early in the mission we applied our algorithms to images available at the mission web site (http://marsrovers.jpl.nasa.gov/gallery/images.html), even though these are not at full resolution. Some algorithms would normally use ancillary information, e.g. camera pointing and position of the sun, but these data were not readily available. The initial results of applying our algorithms to the PANCAM and MI images are encouraging. The horizon is recognized in all images containing it; such information could be used to eliminate unwanted areas from the image prior to data transmission to Earth. Additionally, several rocks were identified that represent targets for the mini-thermal emission spectrometer. Our algorithms also recognize the layers, identified by mission scientists. Such information could be used to prioritize data return or in a decision-making process regarding future rover activities. The spherules seen in MI images were also autonomously recognized. Our results indicate that reliable recognition of scientifically relevant morphologies in images is feasible.

Morris, Robert↗

NASA NTRS2004

Strategies for Global Optimization of Temporal Preferences

A temporal reasoning problem can often be naturally characterized as a collection of constraints with associated local preferences for times that make up the admissible values for those constraints. Globally preferred solutions to such problems emerge as a result of well-defined operations that compose and order temporal assignments. The overall objective of this work is a characterization of different notions of global preference, and to identify tractable sub-classes of temporal reasoning problems incorporating these notions. This paper extends previous results by refining the class of useful notions of global temporal preference that are associated with problems that admit of tractable solution techniques. This paper also answers the hitherto open question of whether problems that seek solutions that are globally preferred from a Utilitarian criterion for global preference can be found tractably.

Morris, Paul↗

NASA NTRS2004

Integration of On-board EOS Schedule Revision with Space Communication Emulation System

The need for on-board decision-making for planning science observations on Earth Observing Satellites is based on the fact that the desirability of acquiring an image can change dynamically, because of changes in meteorological conditions (e.g. cloud cover), unforeseen events such as fires, floods, or volcanic eruptions, or unexpected changes in satellite or ground station capability. In such cases, satellite resources, such as power and SSR capacity can potentially be better utilized taking another image that is of higher quality. Currently, typical Earth observing satellites cannot communicate directly with each other, and can only communicate with ground stations about 5% to 10% of the time. Because of the limited communication windows, as well as the cost and effort that would need to be expended in revising a mission schedule, a ground-based scheduler would have little or no opportunity to revise the schedule in response to the contingencies that may arise. For this reason, a distributed science planning system combining a ground-based scheduler with on-board schedule revision capabilities is warranted. This paper will describe algorithms for on-board decision-making for science planning and their integration with the advanced satellite control and communications technology developed at the Space Communication Emulation Facility (SCEF) at NASA Glenn Research Center. Our objective of demonstrating how advanced communications and scheduling technology can be combined to improve the scientific utility of images acquired by Earth observing systems will be discussed via a description of a number of realistic flight scenarios.

Khatib, Lina↗

NASA NTRS2004

Demonstrating Robotic Autonomy in NASA's Intelligent Systems Project

This paper will provide an overview of NASA's investments in autonomy during the past five years within the Intelligent Systems Project, with particular attention paid to investments that have resulted in mission infusion of autonomy technology, in particular, into the recent Mars Exploration Rover (MER) mission. The content of the paper will be divided into two primary topic areas: a technical overview of the component technologies developed under the program, and a programmatic overview of the history and organization of the NASA IS project itself, with a focus on describing the program elements related to autonomy and intelligent robotics. The paper will also provide an overview of the September 2004 autonomy demonstrations, including a discussion of objectives, organization, and preliminary results (to the extent they are available before the submission deadline).

Morris, Robert↗

NASA NTRS2003

Automated Reasoning CICT Program/Intelligent Systems Project ATAC-PRT Review

An overview is presented of the Automated Reasoning CICT Program/Intelligent Systems project. Automated reasoning technology will help NASA missions by increasing the amount of science achieved, ensuring safety of spacecraft and surface explorers, and by enabling more robust mission operations.

Morris, Robert↗

NASA NTRS2003

Self-Directed Cooperative Planetary Rovers

The project is concerned with the development of decision-theoretic techniques to optimize the scientific return of planetary rovers. Planetary rovers are small unmanned vehicles equipped with cameras and a variety of sensors used for scientific experiments. They must operate under tight constraints over such resources as operation time, power, storage capacity, and communication bandwidth. Moreover, the limited computational resources of the rover limit the complexity of on-line planning and scheduling. We have developed a comprehensive solution to this problem that involves high-level tools to describe a mission; a compiler that maps a mission description and additional probabilistic models of the components of the rover into a Markov decision problem; and algorithms for solving the rover control problem that are sensitive to the limited computational resources and high-level of uncertainty in this domain.

Zilberstein, Shlomo↗

NASA NTRS2003

Tractable Pareto Optimization of Temporal Preferences

This paper focuses on temporal constraint problems where the objective is to optimize a set of local preferences for when events occur. In previous work, a subclass of these problems has been formalized as a generalization of Temporal CSPs, and a tractable strategy for optimization has been proposed, where global optimality is defined as maximizing the minimum of the component preference values. This criterion for optimality, which we call 'Weakest Link Optimization' (WLO), is known to have limited practical usefulness because solutions are compared only on the basis of their worst value; thus, there is no requirement to improve the other values. To address this limitation, we introduce a new algorithm that re-applies WLO iteratively in a way that leads to improvement of all the values. We show the value of this strategy by proving that, with suitable preference functions, the resulting solutions are Pareto Optimal.

Morris, Robert↗

NASA NTRS2003

Decision-Theoretic Control of Planetary Rovers

Planetary rovers are small unmanned vehicles equipped with cameras and a variety of sensors used for scientific experiments. They must operate under tight constraints over such resources as operation time, power, storage capacity, and communication bandwidth. Moreover, the limited computational resources of the rover limit the complexity of on-line planning and scheduling. We describe two decision-theoretic approaches to maximize the productivity of planetary rovers: one based on adaptive planning and the other on hierarchical reinforcement learning. Both approaches map the problem into a Markov decision problem and attempt to solve a large part of the problem off-line, exploiting the structure of the plan and independence between plan components. We examine the advantages and limitations of these techniques and their scalability.

Zilberstein, Shlomo↗

NASA NTRS2003

Symbolic Heuristic Search for Factored Markov Decision Processes

We describe a planning algorithm that integrates two approaches to solving Markov decision processes with large state spaces. State abstraction is used to avoid evaluating states individually. Forward search from a start state, guided by an admissible heuristic, is used to avoid evaluating all states. We combine these two approaches in a novel way that exploits symbolic model-checking techniques and demonstrates their usefulness for decision-theoretic planning.

Morris, Robert↗

NASA NTRS2003

Transition-Independent Decentralized Markov Decision Processes

There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of multi-agent systems is lacking. A recent complexity result, showing that solving decentralized MDPs is NEXP-hard, provides a partial explanation. To overcome this complexity barrier, we identify a general class of transition-independent decentralized MDPs that is widely applicable. The class consists of independent collaborating agents that are tied up by a global reward function that depends on both of their histories. We present a novel algorithm for solving this class of problems and examine its properties. The result is the first effective technique to solve optimally a class of decentralized MDPs. This lays the foundation for further work in this area on both exact and approximate solutions.

Becker, Raphen↗

NASA NTRS2003

Interleaved Observation Execution and Rescheduling on Earth Observing Systems

Observation scheduling for Earth orbiting satellites solves the following problem: given a set of requests for images of the Earth, a set of instruments for acquiring those images distributed on a collecting of orbiting satellites, and a set of temporal and resource constraints, generate a set of assignments of instruments and viewing times to those requests that satisfy those constraints. Observation scheduling is often construed as a constrained optimization problem with the objective of maximizing the overall utility of the science data acquired. The utility of an image is typically based on the intrinsic importance of acquiring it (for example, its importance in meeting a mission or science campaign objective) as well as the expected value of the data given current viewing conditions (for example, if the image is occluded by clouds, its value is usually diminished). Currently, science observation scheduling for Earth Observing Systems is done on the ground, for periods covering a day or more. Schedules are uplinked to the satellites and are executed rigorously. An alternative to this scenario is to do some of the decision-making about what images are to be acquired on-board. The principal argument for this capability is that the desirability of making an observation can change dynamically, because of changes in meteorological conditions (e.g. cloud cover), unforeseen events such as fires, floods, or volcanic eruptions, or un-expected changes in satellite or ground station capability. Furthermore, since satellites can only communicate with the ground between 5% to 10% of the time, it may be infeasible to make the desired changes to the schedule on the ground, and uplink the revisions in time for the on-board system to execute them. Examples of scenarios that motivate an on-board capability for revising schedules include the following. First, if a desired visual scene is completely obscured by clouds, then there is little point in taking it. In this case, satellite resources, such as power and storage space can be better utilized taking another image that is higher quality. Second, if an unexpected but important event occurs (such as a fire, flood, or volcanic eruption), there may be good reason to take images of it, instead of expending satellite resources on some of the lower priority scheduled observations. Finally, if there is unexpected loss of capability, it may be impossible to carry out the schedule of planned observations. For example, if a ground station goes down temporarily, a satellite may not be able to free up enough storage space to continue with the remaining schedule of observations. This paper describes an approach for interleaving execution of observation schedules with dynamic schedule revision based on changes to the expected utility of the acquired images. We describe the problem in detail, formulate an algorithm for interleaving schedule revision and execution, and discuss refinements to the algorithm based on the need for search efficiency. We summarize with a brief discussion of the tests performed on the system.

Khatib, Lina↗

NASA NTRS2003

Essential Autonomous Science Inference on Rovers (EASIR)

Existing constraints on time, computational, and communication resources associated with Mars rover missions suggest on-board science evaluation of sensor data can contribute to decreasing human-directed operational planning, optimizing returned science data volumes, and recognition of unique or novel data. All of which act to increase the scientific return from a mission. Many different levels of science autonomy exist and each impacts the data collected and returned by, and activities of, rovers. Several computational algorithms, designed to recognize objects of interest to geologists and biologists, are discussed. The algorithms represent various functions that producing scientific opinions and several scenarios illustrate how the opinions can be used.

Roush, Ted L.↗

NASA NTRS2002

Scheduling Earth Observing Fleets Using Evolutionary Algorithms: Problem Description and Approach

We describe work in progress concerning multi-instrument, multi-satellite scheduling. Most, although not all, Earth observing instruments currently in orbit are unique. In the relatively near future, however, we expect to see fleets of Earth observing spacecraft, many carrying nearly identical instruments. This presents a substantially new scheduling challenge. Inspired by successful commercial applications of evolutionary algorithms in scheduling domains, this paper presents work in progress regarding the use of evolutionary algorithms to solve a set of Earth observing related model problems. Both the model problems and the software are described. Since the larger problems will require substantial computation and evolutionary algorithms are embarrassingly parallel, we discuss our parallelization techniques using dedicated and cycle-scavenged workstations.

Globus, Al↗