On Expected Value Strong Controllability

Frank, Jeremy D.

Home/Archive/NASA NTRS

NASA NTRS · 20190027408

On Expected Value Strong Controllability

Frank, Jeremy D.

View original source ↗Export metadata ↓

Abstract

The Probabilistic Simple Temporal Network (PSTN) generalizes Simple Temporal Networks with Uncertainty (STNUs) by introducing probability distributions over the timing of uncontrollable timepoints. PSTNs are controllable if there is a strategy to execute the controllable timepoints while bounding the risk of violating any constraint to a small value. If this risk bound can't be satisfied, PSTNs are not considered controllable. We introduce the Expected Value Probabilistic SimpleTemporal Network (EPSTN), which extends PSTNs by including a benefit to the satisfaction of temporal constraints. We study the problem of Expected Value Strong Controllability (EvSC) of EPSTNs, which seeks a schedule maximizing the expected value of satisfied constraints. We solve the EvSC problem by extending a previously developed linear program, combined with search over constraints to violate at execution time. We describe conditions under which the solution to this linear program is the maximum expected value schedule. We then show how to search for constraints to discard, using the linear program at the core of the search. While the general problem is shown to be exponential, we conclude by providing several methods to bound the complexity of search.

Explore related subjects

Planning Scheduling Uncertainty

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Frank, Jeremy D.. 2019-07-11. On Expected Value Strong Controllability. https://ntrs.nasa.gov/citations/20190027408

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

KEEP EXPLORING

Related reports

DOE OSTI2021

The Making of a Metric: Co-Producing Decision-Relevant Climate Science

Developing decision-relevant science for adaptation requires the identification of climatic parameters that are both actionable for practitioners as well as tractable for modelers. In many sectors, these decision-relevant climatic metrics and the approaches that enable their identification remain largely unknown. “Co-production” of science with scientists and decision-makers is one potential way to identify these metrics, but there is little research describing specific and successful co-production approaches. This paper examines the negotiations and outcomes from Project Hyperion, wherein scientists and water managers jointly developed decision-relevant climatic metrics for adaptive water management. We identify successful co-production strategies by analyzing the project’s numerous back-and-forth engagements and tracing the evolution of the science during these engagements. We found that effective mediation between scientists and managers needed dedicated “boundary spanners” with significant modeling expertise. Translating practitioners’ information needs into tractable climatic metrics required direct and indirect methods of eliciting knowledge. We identified four indirect methods that were particularly salient for extracting tacitly held knowledge and enabling shared learning: developing a hierarchical framework linking management issues with metrics, starting discussions from the planning challenges, collaboratively exploring the planning relevance of new scientific capabilities, and using analogies of other “good” metrics. The decision-relevant metrics we developed provide insights into advancing adaptation-relevant climate science in the water sector. The co-production strategies we identified can be used to design and implement productive scientist–decision-maker interactions. Overall, the approaches and metrics we developed can help climate science to expand in new and more use-inspired directions.

Planning↗

NASA NTRS2016

NASA Work Breakdown Structure (WBS) Handbook

The purpose of this document is to provide program/project teams necessary instruction and guidance in the best practices for Work Breakdown Structure (WBS) and WBS dictionary development and use for project implementation and management control. This handbook can be used for all types of NASA projects and work activities including research, development, construction, test and evaluation, and operations. The products of these work efforts may be hardware, software, data, or service elements (alone or in combination). The aim of this document is to assist project teams in the development of effective work breakdown structures that provide a framework of common reference for all project elements. The WBS and WBS dictionary are effective management processes for planning, organizing, and administering NASA programs and projects. The guidance contained in this document is applicable to both in-house, NASA-led effort and contracted effort. It assists management teams from both entities in fulfilling necessary responsibilities for successful accomplishment of project cost, schedule, and technical goals. Benefits resulting from the use of an effective WBS include, but are not limited to: providing a basis for assigned project responsibilities, providing a basis for project schedule and budget development, simplifying a project by dividing the total work scope into manageable units, and providing a common reference for all project communication.

Planning↗

NASA NTRSDate not supplied

Explaining Soft-Goal Conflicts through Constraint Relaxations

Recent work suggests to explain trade-offs between soft goals in terms of their conflicts, i. e., minimal unsolvable soft-goal subsets. But this does not explain the conflicts themselves: Why can a given set of soft-goals not be jointly achieved? Here we approach that question in terms of the underlying constraints on plans in the task at hand, namely resource availability and time windows. In this context, a natural form of explanation for a soft-goal conflict is a minimal constraint relaxation under which the conflict disappears (“if the deadline was 1 hour later, it would work”). We explore algorithms for computing such explanations. A baseline is to simply loop over all relaxed tasks and compute the conflicts for each separately. We improve over this by two algorithms that leverage information – conflicts, reachable states – across relaxed tasks. We show that these algorithms can exponentially outperform the baseline in theory, and we run experiments confirming that advantage in practice.

Planning↗