Comparing the Performance of Expert User Heuristics and an Integer Linear Program in Aircraft Carrier Deck Operations

Planning operations across a number of domains can be considered as resource allocation problems with timing constraints. An unexplored instance of such a problem domain is the aircraft carrier flight deck, where, in current operations, replanning is done without the aid of any computerized decision support. Rather, veteran operators employ a set of experience based heuristics to quickly generate new operating schedules. These expert user heuristics are neither codified nor evaluated by the United States Navy; they have grown solely from the convergent experiences of supervisory staff. As unmanned aerial vehicles (UAVs) are introduced in the aircraft carrier domain, these heuristics may require alterations due to differing capabilities. The inclusion of UAVs also allows for new opportunities for on-line planning and control, providing an alternative to the current heuristic-based replanning methodology. To investigate these issues formally, we have developed a decision support system for flight deck operations that utilizes a conventional integer linear program-based planning algorithm. In this system, a human operator sets both the goals and constraints for the algorithm, which then returns a proposed schedule for operator approval. As a part of validating this system, the performance of this collaborative human–automation planner was compared with that of the expert user heuristics over a set of test scenarios. The resulting analysis shows that human heuristics often outperform the plans produced by an optimization algorithm, but are also often more conservative

Assessing the performance of human-automation collaborative planning systems

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2011.Cataloged from PDF version of thesis.Includes bibliographical references (p. 215-221).Planning and Resource Allocation (P/RA) Human Supervisory Control (HSC) systems utilize the capabilities of both human operators and automated planning algorithms to schedule tasks for complex systems. In these systems, the human operator and the algorithm work collaboratively to generate new scheduling plans, each providing a unique set of strengths and weaknesses. A systems engineering approach to the design and assessment of these P/RA HSC systems requires examining each of these aspects individually, as well as examining the performance of the system as a whole in accomplishing its tasks. An obstacle in this analysis is the lack of a standardized testing protocol and a standardized set of metric classes that define HSC system performance. An additional issue is the lack of a comparison point for these revolutionary systems, which must be validated with respect to current operations before implementation. This research proposes a method for the development of test metrics and a testing protocol for P/RA HSC systems. A representative P/RA HSC system designed to perform high-level task planning for deck operations on United States Naval aircraft carriers is utilized in this testing program. Human users collaborate with the planning algorithm to generate new schedules for aircraft and crewmembers engaged in carrier deck operations. A metric class hierarchy is developed and used to create a detailed set of metrics for this system, allowing analysts to detect variations in performance between different planning configurations and to depict variations in performance for a single planner across levels of environment complexity. In order to validate this system, these metrics are applied in a testing program that utilizes three different planning conditions, with a focus on validating the performance of the combined Human-Algorithm planning configuration. Experimental result analysis revealed that the experimental protocol was successful in providing points of comparison for planners within a given scenario while also being able to explain the root causes of variations in performance between planning conditions. The testing protocol was also able to provide a description of relative performance across complexity levels. The results demonstrate that the combined Human-Algorithm planning condition performed poorly for simple and complex planning conditions, due to errors in the recognition of a transient state condition and in modeling the effects of certain actions, respectively. The results also demonstrate that Human planning performance was relatively consistent as complexity increased, while combined Human-Algorithm planning was effective only in moderate complexity levels. Although the testing protocol used for these scenarios and this planning algorithm was effective, several limiting factors should be considered. Further research must address how the effectiveness of the defined metrics and the test methodology changes as different types of planning algorithms are utilized and as a larger number of human test subjects are incorporated.by Jason C. Ryan.S.M

PhD Thesis Proposal: Human-Machine Collaborative Optimization via Apprenticeship Scheduling

Resource optimization in health care, manufacturing, and military operations requires the careful choreography of people and equipment to effectively fulfill the responsibilities of the profession. However, resource optimization is a computationally challenging problem, and poorly utilizing resources can have drastic consequences. Within these professions, there are human domain experts who are able to learn from experience to develop strategies, heuristics, and rules-of-thumb to effectively utilize the resources at their disposal. Manually codifying these heuristics within a computational tool is a laborious process and leaves much to be desired. Even with a codified set of heuristics, it is not clear how to best insert an autonomous decision-support system into the human decision-making process. The aim of this thesis is to develop an autonomous computational method for learning domain-expert heuristics from demonstration that can support the human decision-making process. We propose a new framework, called apprenticeship scheduling, which learns and embeds these heuristics within a scalable resource optimization algorithm for real-time decision-support. Our initial investigation, comprised of developing scalable methods for scheduling and studying shared control in human-machine collaborative resource optimization, inspires the development of our apprenticeship scheduling approach. We present a promising, initial prototype for learning heuristics from demonstration and outline a plan for our continuing work

Human-Machine Collaborative Optimization via Apprenticeship Scheduling

Coordinating agents to complete a set of tasks with intercoupled temporal and resource constraints is computationally challenging, yet human domain experts can solve these difficult scheduling problems using paradigms learned through years of apprenticeship. A process for manually codifying this domain knowledge within a computational framework is necessary to scale beyond the ``single-expert, single-trainee" apprenticeship model. However, human domain experts often have difficulty describing their decision-making processes, causing the codification of this knowledge to become laborious. We propose a new approach for capturing domain-expert heuristics through a pairwise ranking formulation. Our approach is model-free and does not require enumerating or iterating through a large state space. We empirically demonstrate that this approach accurately learns multifaceted heuristics on a synthetic data set incorporating job-shop scheduling and vehicle routing problems, as well as on two real-world data sets consisting of demonstrations of experts solving a weapon-to-target assignment problem and a hospital resource allocation problem. We also demonstrate that policies learned from human scheduling demonstration via apprenticeship learning can substantially improve the efficiency of a branch-and-bound search for an optimal schedule. We employ this human-machine collaborative optimization technique on a variant of the weapon-to-target assignment problem. We demonstrate that this technique generates solutions substantially superior to those produced by human domain experts at a rate up to 9.5 times faster than an optimization approach and can be applied to optimally solve problems twice as complex as those solved by a human demonstrator.Comment: Portions of this paper were published in the Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) in 2016 and in the Proceedings of Robotics: Science and Systems (RSS) in 2016. The paper consists of 50 pages with 11 figures and 4 table

Estimating the efficacy of mass rescue operations in ocean areas with vehicle routing models and heuristics

Tese de doutoramento, Estatística e Investigação Operacional (Optimização), Universidade de Lisboa, Faculdade de Ciências, 2018Mass rescue operations (MRO) in maritime areas, particularly in ocean areas, are a major concern for the authorities responsible for conducting search and rescue (SAR) activities. A mass rescue operation can be defined as a search and rescue activity characterized by the need for immediate assistance to a large number of persons in distress, such that the capabilities normally available to search and rescue are inadequate. In this dissertation we deal with a mass rescue operation within ocean areas and we consider the problem of rescuing a set of survivors following a maritime incident (cruise ship, oil platform, ditched airplane) that are drifting in time. The recovery of survivors is performed by nearby ships and helicopters. We also consider the possibility of ships capable of refuelling helicopters while hovering which can extend the range to which survivors can be rescued. A linear binary integer formulation is presented along with an application that allows users to build instances of the problem. The formulation considers a discretization of time within a certain time step in order to assess the possibility of travelling along different locations. The problem considered in this work can be perceived as an extension of the generalized vehicle routing problem (GVRP) with a profit stance since we may not be able to recover all of the survivors. We also present a look ahead approach, based on the pilot method, to the problem along with some optimal results using state of the art Mixed-integer linear programming solvers. Finally, the efficacy of the solution from the GVRP is estimated for a set of scenarios that combine incident severity, location, traffic density for nearby ships and SAR assets availability and location. Using traffic density maps and the estimated MRO efficacy, one can produce a combined vulnerability map to ascertain the quality of response to each scenario.Marinha Portuguesa, Plano de Atividades de Formação Nacional (PAFN

An Advanced Tabu Search Approach to Solving the Mixed Payload Airlift Load Planning Problem

This paper presents a new tabu search based two-dimensional bin packing algorithm which produces high quality solutions to the Mixed Payload Airlift Load Planning (MPALP) problem using C-5 and C-17 aircraft. This algorithm, called Mixed Payload Airlift Load Planning Tabu Search (MPALPTS), surpasses previous research conducted in this area because, in addition to pure pallet cargo loads, MPALPTS can accommodate rolling stock cargo (i.e. tanks, trucks, HMMMVs, etc.) while still maintaining aircraft feasibility with respect to aircraft center of balance, mandatory cargo separations, aircraft floor structural limitations, etc. Furthermore, while this research is currently restricted to C-5 and C-17 aircraft, MPALPTS is capable of modeling nearly any type of cargo aircraft and requires a limited number of assumptions thereby making it applicable to operational missions. To demonstrate its effectiveness, the load plans generated by MPALPTS are directly compared to those generated by the Automated Air Load Planning Software (AALPS) for a given cargo set; AALPS is the load planning software currently mandated for use in all Department of Defense load planning. While more time consuming than AALPS, MPALPTS required the same or fewer aircraft than AALPS in all test scenario

COBE's search for structure in the Big Bang

The launch of Cosmic Background Explorer (COBE) and the definition of Earth Observing System (EOS) are two of the major events at NASA-Goddard. The three experiments contained in COBE (Differential Microwave Radiometer (DMR), Far Infrared Absolute Spectrophotometer (FIRAS), and Diffuse Infrared Background Experiment (DIRBE)) are very important in measuring the big bang. DMR measures the isotropy of the cosmic background (direction of the radiation). FIRAS looks at the spectrum over the whole sky, searching for deviations, and DIRBE operates in the infrared part of the spectrum gathering evidence of the earliest galaxy formation. By special techniques, the radiation coming from the solar system will be distinguished from that of extragalactic origin. Unique graphics will be used to represent the temperature of the emitting material. A cosmic event will be modeled of such importance that it will affect cosmological theory for generations to come. EOS will monitor changes in the Earth's geophysics during a whole solar color cycle

Joint University Program for Air Transportation Research, 1991-1992

This report summarizes the research conducted during the academic year 1991-1992 under the FAA/NASA sponsored Joint University Program for Air Transportation Research. The year end review was held at Ohio University, Athens, Ohio, June 18-19, 1992. The Joint University Program is a coordinated set of three grants sponsored by the Federal Aviation Administration and NASA Langley Research Center, one each with the Massachusetts Institute of Technology (NGL-22-009-640), Ohio University (NGR-36-009-017), and Princeton University (NGL-31-001-252). Completed works, status reports, and annotated bibliographies are presented for research topics, which include navigation, guidance and control theory and practice, intelligent flight control, flight dynamics, human factors, and air traffic control processes. An overview of the year's activities for each university is also presented

A Polyhedral Study of Mixed 0-1 Set

We consider a variant of the well-known single node fixed charge network flow set with constant capacities. This set arises from the relaxation of more general mixed integer sets such as lot-sizing problems with multiple suppliers. We provide a complete polyhedral characterization of the convex hull of the given set

Decision-Making Authority, Team Efficiency and Human Worker Satisfaction in Mixed Human-Robot Teams

has opened up the possibility of integrating highly autonomous mobile robots into human teams. However, with this capability comes the issue of how to maximize both team efficiency and the desire of human team members to work with robotic counterparts. We hypothesized that giving workers partial decision-making authority over a task allocation process for the scheduling of work would achieve such a maximization, and conducted an experiment on human subjects to test this hypothesis. We found that an autonomous robot can outperform a worker in the execution of part or all of the task allocation (p < 0.001 for both). However, rather than finding an ideal balance of control authority to maximize worker satisfaction, we observed that workers preferred to give control authority to the robot (p < 0.001). Our results indicate that workers prefer to be part of an efficient team rather than have a role in the scheduling process, if maintaining such a role decreases their efficiency. These results provide guidance for the successful introduction of semi-autonomous robots into human teams. I