Argumentation for coordinating shared activities

Clement, Bradley J.; Barrett, Anthony C.; Schaffer, Steven R.

Home/Archive/NASA NTRS

NASA NTRS · 20060043519

Argumentation for coordinating shared activities

Clement, Bradley J.·Barrett, Anthony C.·Schaffer, Steven R.

View original source ↗Export metadata ↓

Abstract

There is an increasing need for space missions to be able to collaboratively (and competitively) develop plans both within and across missions. In addition, interacting spacecraft that interleave onboard planning and execution must reach consensus on their commitments to each other prior to execution.

Explore related subjects

scheduling planning coordination Mars multiple agents

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Clement, Bradley J., Barrett, Anthony C., Schaffer, Steven R.. 2004-06-01. Argumentation for coordinating shared activities. https://ntrs.nasa.gov/citations/20060043519

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

NASA NTRS2021

Human Performance of Novice Schedulers for Complex Spaceflight Operations Timelines

Objective: Investigate the effects on human performance as a function of scheduling task complexity for novice schedulers creating spaceflight timelines. Background: Future astronauts will be expected to self-schedule, yet will not be experts in creating timelines that meet complex constraints inherent to spaceflight operations. Method: Conducted a within-subject experiment to measure scheduling efficiency, effectiveness, workload and situation awareness while varying scheduling task complexity factors, namely number of constraints and types of constraints. Results: Fifteen participants completed various scheduling problems. Performance differences were identified between the independent variables. There was a main effect due to the number of constraints and type of constraint for efficiency, effectiveness, and workload. Significant interactions were observed in situation awareness and workload for certain types of constraints. Results also suggest that a lower number of constraints may be manageable by novice schedulers when compared to scheduling activities without constraints. Conclusion: Results suggest that novice schedulers performance decreases with high number of constraints and future scheduling aids may have to be targeted to type of constraint. Application: Knowledge on the effect of scheduling task complexity will help design scheduling systems that will enable self-scheduling for future astronauts. It will also inform other domains that conduct complex scheduling, such as nursing and manufacturing.

scheduling↗

NASA NTRS2016

Operational Characteristics Identification and Simulation Model Verification for Incheon International Airport

Incheon International Airport (ICN) is one of the hub airports in East Asia. Airport operations at ICN have been growing more than 5% per year in the past five years. According to the current airport expansion plan, a new passenger terminal will be added and the current cargo ramp will be expanded in 2018. This expansion project will bring 77 new stands without adding a new runway to the airport. Due to such continuous growth in airport operations and future expansion of the ramps, it will be highly likely that airport surface traffic will experience more congestion, and therefore, suffer from efficiency degradation. There is a growing awareness in aviation research community of need for strategic and tactical surface scheduling capabilities for efficient airport surface operations. Specific to ICN airport operations, a need for A-CDM (Airport - Collaborative Decision Making) or S-CDM(Surface - Collaborative Decision Making), and controller decision support tools for efficient air traffic management has arisen since several years ago. In the United States, there has been independent research efforts made by academia, industry, and government research organizations to enhance efficiency and predictability of surface operations at busy airports. Among these research activities, the Spot and Runway Departure Advisor (SARDA) developed and tested by National Aeronautics and Space Administration (NASA) is a decision support tool to provide tactical advisories to the controllers for efficient surface operations. The effectiveness of SARDA concept, was successfully verified through the human-in-the-loop (HITL) simulations for both spot release and runway operations advisories for ATC Tower controllers of Dallas/Fort Worth International Airport (DFW) in 2010 and 2012, and gate pushback advisories for the ramp controller of Charlotte/Douglas International Airport (CLT) in 2014. The SARDA concept for tactical surface scheduling is further enhanced and is being integrated into NASA's Airspace Technology Demonstration - 2 (ATD-2) project for technology demonstration of Integrated Arrival/Departure/Surface (ADS) operations at CLT. This study is a part of the international research collaboration between KAIA (Korea Agency for Infrastructure Technology Advancement)/KARI (Korea Aerospace Research Institute) and NASA, which is being conducted to validate the effectiveness of SARDA concept as a controller decision support tool for departure and surface management of ICN. This paper presents the preliminary results of the collaboration effort. It includes investigation of the operational environment of ICN, data analysis for identification of the operational characteristics of the airport, construction and verification of airport simulation model using Surface Operations Simulator and Scheduler (SOSS), NASA's fast-time simulation tool.

scheduling↗

NASA NTRS2016

Explorations of Quantum-Classical Approaches to Scheduling a Mars Lander Activity Problem

An effective approach to solving problems involving mixed (continuous and discrete) variables and constraints, such as hybrid systems, is to decompose them into subproblems and integrate dedicated solvers geared toward those subproblems. Here, we introduce a new framework based on a tree search algorithm to solve hybrid discrete-continuous problems that incorporates: (1) a quantum annealer that samples from the configuration space for the discrete portion and provides information about the quality of the samples, and (2) a classical computer that makes use of information from the quantum annealer to prune and focus the search as well as check a continuous constraint. We consider four variants of our algorithm, each with progressively more guidance from the results provided by the quantum annealer. We empirically test our algorithm and compare the variants on a simplified Mars Lander task scheduling problem. Variants with more guidance from the quantum annealer have better performance.

scheduling↗