Search NASA⌕ Search
Home/Archive/NASA NTRS

NASA NTRS · 20060043840

Robust local search for spacecraft operations using adaptive noise

Fukunaga, Alex S.·Rabideau, Gregg·Chien, Steve
View original source ↗Export metadata ↓

Abstract

Randomization is a standard technique for improving the performance of local search algorithms for constraint satisfaction. However, it is well-known that local search algorithms are constraints satisfaction. However, it is well-known that local search algorithms are to the noise values selected. We investigate the use of an adaptive noise mechanism in an iterative repair-based planner/scheduler for spacecraft operations. Preliminary results indicate that adaptive noise makes the use of randomized repair moves safe and robust; that is, using adaptive noise makes it possible to consistently achieve, performance comparable with the best tuned noise setting without the need for manually tuning the noise parameter.

Explore related subjects

planningschedulingmachine learningautonomy

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fukunaga, Alex S., Rabideau, Gregg, Chien, Steve. 2004-06-23. Robust local search for spacecraft operations using adaptive noise. https://ntrs.nasa.gov/citations/20060043840

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

KEEP EXPLORING

Related reports

NASA NTRS2019

Crew Autonomy Scheduling: Scheduling Performance Pilot Study

The purpose of this pilot study is to quantify crew performance in self-scheduling through Playbook, a mobile-based scheduling and planning tool. By investigating human performance within the task of self-scheduling, we can further develop countermeasures that can mitigate deficient scheduling performance, and evaluate changes as a result of these countermeasures. Moreover, this research can advise the development of standards and guidelines for autonomous crews in future missions. In human spaceflight today, the task of planning crew member’s schedules falls to Ops Planners. It takes many weeks to plan due to the complex impact each day-to-day activity can have on other activities, crew members, and resources. These impacts are measured as constraints, and these constraints can result in temporal, ordering, or resource requirements. As future spaceflight missions span longer distances and the latency of communication between the crew and Mission Control Center (MCC) increases, the need for crew members to work independently from MCC will also increase. This results in a need for crew members to be able to autonomously plan and adjust their own schedules.

planning↗
NASA NTRS2017

Temporal Planning for Compilation of Quantum Approximate Optimization Algorithm Circuits

We investigate the application of temporal planners to the problem of compiling quantum circuits to newly emerging quantum hardware. While our approach is general, we focus our initial experiments on Quantum Approximate Optimization Algorithm (QAOA) circuits that have few ordering constraints and allow highly parallel plans. We report on experiments using several temporal planners to compile circuits of various sizes to a realistic hardware. This early empirical evaluation suggests that temporal planning is a viable approach to quantum circuit compilation.

planning↗
NASA NTRS2013

Flight Test Engineering

Although the scope of flight test engineering efforts may vary among organizations, all point to a common theme: flight test engineering is an interdisciplinary effort to test an asset in its operational flight environment. Upfront planning where design, implementation, and test efforts are clearly aligned with the flight test objective are keys to success. This chapter provides a top level perspective of flight test engineering for the non-expert. Additional research and reading on the topic is encouraged to develop a deeper understanding of specific considerations involved in each phase of flight test engineering.

planning↗