Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic planning”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Improved Results for Route Planning in Stochastic Transportation Networks

In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times are not determined by a fixed schedule but instead may be random. the problem requires more than standard shortest path techniques. In recent work, Datar and Ranade provide algorithms in the case where bus arrivals are assumed to be independent and exponentially distributed. We offer solutions to two important generalizations of the problem, answering open questions posed by Datar and Ranade. First, we provide a polynomial time algorithm for a much wider class of arrival distributions, namely those with increasing failure rate. This class includes not only exponential distributions but also uniform, normal, and gamma distributions. Second, in the case where bus arrival times are independent and geometric discrete random variable,. we provide an algorithm for transportation networks of buses and trains, where trains run according to a fixed schedule.

Boyan, Justin↗

Proactive Operations and Investment Planning via Stochastic Optimization to Enhance Power Systems’ Extreme Weather Resilience

We present scalable stochastic optimization approaches for improving power systems’ resilience to extreme weather events. We consider both proactive redispatch and transmission line hardening as alternatives for mitigating expected load shed due to extreme weather, resulting in large-scale stochastic linear programs (LPs) and mixed-integer linear programs (MILPs). We solve these stochastic optimization problems with progressive hedging (PH), a parallel, scenario-based decomposition algorithm. Our computational experiments indicate that our proposed method for enhancing power system resilience can provide high-quality solutions efficiently. With up to 128 scenarios on a 2,000-bus network, the operations (redispatch) and investment (hardening) resilience problems can be solved in approximately 6 min and 2 h of wall-clock time, respectively. Additionally, we solve the investment problems with up to 512 scenarios, demonstrating that the approach scales very well with the number of scenarios. Moreover, the method produces high quality solutions that result in statistically significant reductions in expected load shed. Our proposed approach can be augmented to incorporate a variety of other operational and investment resilience strategies, or a combination of such strategies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Stochastic Evolutionary Algorithms for Planning Robot Paths

A computer program implements stochastic evolutionary algorithms for planning and optimizing collision-free paths for robots and their jointed limbs. Stochastic evolutionary algorithms can be made to produce acceptably close approximations to exact, optimal solutions for path-planning problems while often demanding much less computation than do exhaustive-search and deterministic inverse-kinematics algorithms that have been used previously for this purpose. Hence, the present software is better suited for application aboard robots having limited computing capabilities (see figure). The stochastic aspect lies in the use of simulated annealing to (1) prevent trapping of an optimization algorithm in local minima of an energy-like error measure by which the fitness of a trial solution is evaluated while (2) ensuring that the entire multidimensional configuration and parameter space of the path-planning problem is sampled efficiently with respect to both robot joint angles and computation time. Simulated annealing is an established technique for avoiding local minima in multidimensional optimization problems, but has not, until now, been applied to planning collision-free robot paths by use of low-power computers.

Fink, Wolfgang↗

Planning with Continuous Resources in Stochastic Domains

We consider the problem of optimal planning in stochastic domains with metric resource constraints. Our goal is to generate a policy whose expected sum of rewards is maximized for a given initial state. We consider a general formulation motivated by our application domain--planetary exploration--in which the choice of an action at each step may depend on the current resource levels. We adapt the forward search algorithm AO* to handle our continuous state space efficiently.

Mausam, Mausau↗

Robust Path Planning and Feedback Design Under Stochastic Uncertainty

Autonomous vehicles require optimal path planning algorithms to achieve mission goals while avoiding obstacles and being robust to uncertainties. The uncertainties arise from exogenous disturbances, modeling errors, and sensor noise, which can be characterized via stochastic models. Previous work defined a notion of robustness in a stochastic setting by using the concept of chance constraints. This requires that mission constraint violation can occur with a probability less than a prescribed value.In this paper we describe a novel method for optimal chance constrained path planning with feedback design. The approach optimizes both the reference trajectory to be followed and the feedback controller used to reject uncertainty. Our method extends recent results in constrained control synthesis based on convex optimization to solve control problems with nonconvex constraints. This extension is essential for path planning problems, which inherently have nonconvex obstacle avoidance constraints. Unlike previous approaches to chance constrained path planning, the new approach optimizes the feedback gain as wellas the reference trajectory.The key idea is to couple a fast, nonconvex solver that does not take into account uncertainty, with existing robust approaches that apply only to convex feasible regions. By alternating between robust and nonrobust solutions, the new algorithm guarantees convergence to a global optimum. We apply the new method to an unmanned aircraft and show simulation results that demonstrate the efficacy of the approach.

autonomuys vehicles↗

Multi-Period Active Distribution Network Planning Using Multi-Stage Stochastic Programming and Nested Decomposition by SDDIP

This paper presents a multi-period active distribution network planning (ADNP) with distributed generation (DG). The objective of the proposed ADNP is to minimize the total planning cost, subject to both investment and operation constraints. The paper proposes a multi-stage stochastic optimization model to address DG uncertainties over several periods, in which the decisions are made sequentially by only using the present-stage information. A nested decomposition method is proposed which applies the stochastic dual dynamic integer programming (SDDIP) method to address computational intractabilities of the proposed ADNP approach. The presented numerical results and discussions on a 33-bus distribution system and a large-scale 906-bus system verify the effectiveness of the proposed ADNP method and its solution method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Airport Infrastructure Planning Using Multi-Stage Stochastic Programming

The Athena project, funded by the Department of Energy, has worked to identify the critical infrastructure at Dallas Fort Worth (DFW) Airport which influences mobility between the airport and the surrounding city of Dallas. Using scalable methods that can leverage HPC resources we have developed a multi-stage stochastic infrastructure expansion model for determining parking and curb modifications to the DFW Airport over a 20-year horizon. Additionally, we have explored the impacts of congestion pricing in conjunction with infrastructure modifications. Our multi-stage stochastic model is implemented using the mpi-sppy software and solved in parallel using progressive hedging on the National Renewable Energy Laboratory's HPC system Eagle. In this talk we present results from solving this model at scale.

airport planning↗

A Stochastic Charging Station Deployment Model for Electrified Taxi Fleets in Coupled Urban Transportation and Power Distribution Networks

Metropolitansworldwide are increasingly adopting electric taxis (ET) to address concerns about transportation-related emissions. However, the widespread deployment of electric taxis presents challenges in terms of increased electricity demand and changing demand profiles. This transition impacts both the urban transportation network (TN) and the electricity power distribution network (PDN), highlighting the interdependence between these two systems. Here, in this paper, we propose a two-stage stochastic programming planning model that aims to optimize both the TN and PDN, enabling efficient deployment of charging stations and grid upgrades. Our model seeks to strike a balance between meeting ET drivers' charging preferences, minimizing the costs associated with infrastructure deployment and grid expansion, and harmonizing the coordination between the TN and PDN. Additionally, we explore the potential benefits of utilizing an autonomous ET fleet to enhance overall system performance.

33 ADVANCED PROPULSION SYSTEMS↗

Bi-Level Adaptive Storage Expansion Strategy for Microgrids Using Deep Reinforcement Learning

Battery energy storage (BES) is a versatile resource for the secure and economic operation of microgrids (MGs). Prevailing stochastic optimization-based approaches for BES expansion planning for MGs are computationally complicated. This work proposes a data-driven bi-level multi-period BES expansion planning framework to determine the siting, sizing, and timing of BES installations. The proposed planning framework unifies deep reinforcement learning (DRL) and linear programming, thereby decoupling the determinations for the integer and continuous decision variables in two time scales, respectively. In the upper level, a rainbow DRL agent with quantile regression is trained to provide dynamic planning policies to accommodate stochastic renewable energy resources (RESs), load, and battery price changes efficiently. Further, the lower level computes the optimal operation of MGs with frequency constraints to hedge the islanding contingency. The two levels communicate with one another by exchanging storage configuration and operating expenses in order to accomplish the shared goal of minimizing investment and operation costs. Comparative case studies on an MG are carried out to demonstrate the superiority of the proposed DRL-based solution to the mixed-integer linear programming counterpart on efficiency, scalability, and adaptability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Climate Generator for Agricultural Planning in Southeastern South America

A method is described for the generation of climate scenarios in a form suitable for driving agricultural models. The scenarios are tailored to the region in southeastern South America bounded by 25-40 deg S, 45-65 deg W, denoted here as SESA. SESA has been characterized by increasing summer precipitation, particularly during the late 20th century, which, in the context of favorable market conditions, has enabled increases in agricultural production. Since about year 2000, however, the upward tendency appears to have slowed or possibly stopped, raising questions about future climate inputs to regional agricultural yields. The method is not predictive in the deterministic sense, but rather attempts to characterize uncertainty in near-term future climate, taking into account both forced trends and unforced, natural climate fluctuations. It differs from typical downscaling methods in that GCM information is utilized only at the regional scale, subregional variability being modeled based on the observational record. Output, generated on the monthly time scale, is disaggregated to daily values with a weather generator and used to drive soybean yields in the crop model DSSAT-CSM, for which preliminary results are discussed. The simulations produced permit assessment of the interplay between long-range trends and near-term climate variability in terms of agricultural production.

climate simulation↗

Numerically Testing Conceptual Models of the Utah FORGE Reservoir Using July 2023 Circulation Test Data

Over the past several years, many new data sets have become available regarding the characterization of the Utah FORGE reservoir. These include, but are not limited to, the stimulation of Well 16A, the drilling and completion of Well 16B, and interwell circulation confirmatory testing. As part of the characterization efforts, conceptual models of the reservoir are re-examined as new data become available. As part of the planning for FORGE activities, numerical models are often used to predict the reservoir response to the planned testing. Stochastic methods are often employed to bound uncertainty and allow for evaluation of comprehensive ranges of key reservoir parameters. For the most recent interwell circulation confirmatory testing (July 2023), a priori numerical model predictions did bound the observed behavior (Xinj et al., 2023), but key deviations from expected behavior prompted the FORGE team to reevaluate our conceptual model of the reservoir. In early October 2023, key members of the development, testing, and monitoring teams met for 2 days to review newly collected data and discuss ‘interesting’ or ‘key’ observations. From these discussions, 15 Key Observations were documented, with several significant ones being that the discrete fracture network developed from the 16A stimulation data may not be appropriate and that the early time pressure data obtained during the summer 2023 reservoir testing were best described using radial solutions. In July 2023, two campaigns of interwell confirmatory testing were conducted, the first set of tests occurred on July 4-5 and the second set on July 18-19. The second set of circulation tests conducted at the Utah FORGE site between the injection well 16A(78)-32 and production well 16B(78)-32 on July 18 and 19, 2023 are used to calibrate material properties in a thermal-hydraulic-mechanical (THM) simulation of the discrete fracture network connecting the wells. The spatially and temporally varying reservoir properties are calibrated to match the time dependent pressure and production profiles from the circulation tests. In future work, this calibrated model will be coupled to the native state THM model of the FORGE reservoir to predict surface deformation and strains resulting from pumping schedules.

58 GEOSCIENCES↗

Numerically Testing Conceptual Models of the Utah FORGE Reservoir Using July 2024 Circulation Test Data

Over the past several years, many new data sets have become available regarding the characterization of the Utah FORGE reservoir. These include, but are not limited to, the stimulation of Well 16A, the drilling and completion of Well 16B, and interwell circulation confirmatory testing. As part of the characterization efforts, conceptual models of the reservoir are re-examined as new data become available. As part of the planning for FORGE activities, numerical models are often used to predict the reservoir response to the planned testing. Stochastic methods are often employed to bound uncertainty and allow for evaluation of comprehensive ranges of key reservoir parameters. For the most recent interwell circulation confirmatory testing (July 2023), a priori numerical model predictions did bound the observed behavior (Xinj et al., 2023), but key deviations from expected behavior prompted the FORGE team to reevaluate our conceptual model of the reservoir. In early October 2023, key members of the development, testing, and monitoring teams met for 2 days to review newly collected data and discuss ‘interesting’ or ‘key’ observations. From these discussions, 15 Key Observations were documented, with several significant ones being that the discrete fracture network developed from the 16A stimulation data may not be appropriate and that the early time pressure data obtained during the summer 2023 reservoir testing were best described using radial solutions. In July 2023, two campaigns of interwell confirmatory testing were conducted, the first set of tests occurred on July 4-5 and the second set on July 18-19. The second set of circulation tests conducted at the Utah FORGE site between the injection well 16A(78)-32 and production well 16B(78)-32 on July 18 and 19, 2023 are used to calibrate material properties in a thermal-hydraulic-mechanical (THM) simulation of the discrete fracture network connecting the wells. The spatially and temporally varying reservoir properties are calibrated to match the time dependent pressure and production profiles from the circulation tests. In future work, this calibrated model will be coupled to the native state THM model of the FORGE reservoir to predict surface deformation and strains resulting from pumping schedules.

15 GEOTHERMAL ENERGY↗