Optimal planning and scheduling for a Mars relay communication network
Explore the source record for details and available documents.
SEARCH · Search NASA
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.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
NASA and the international community are investing in the development of a commercial transportation infrastructure that includes the increased use of rotorcraft, specifically helicopters and civil tilt rotors. However, there is significant concern over the impact of noise on the communities surrounding the transportation facilities. One way to address the rotorcraft noise problem is by exploiting powerful search techniques coming from artificial intelligence coupled with simulation and field tests to design low-noise flight profiles which can be tested in simulation or through field tests. This paper investigates the use of simulation based on predictive physical models to facilitate the search for low-noise trajectories using a class of automated search algorithms called local search. A novel feature of this approach is the ability to incorporate constraints directly into the problem formulation that addresses passenger safety and comfort.
A methodology for optimal trajectory planning, useful in the nap-of-the-earth guidance of helicopters, is presented. This approach uses an adjoint-control transformation along with a one-dimensional search scheme for generating the optimal trajectories. In addition to being useful for helicopter nap-of-the-earth guidance, the trajectory planning solution is of interest in several other contexts, such as robotic vehicle guidance and terrain-following guidance for cruise missiles and aircraft. A distinguishing feature of the present research is that the terrain constraint and the threat envelopes are incorporated in the equations of motion. Second-order necessary conditions are examined.
We are developing onboard planning and scheduling technology to enable in situ robotic explorers, such as rovers and aerobots, to more effectively assist scientists in planetary exploration. In our current work, we are focusing on situations in which the robot is exploring large geographical features such as craters, channels or regional boundaries. In to develop valid and high quality plans, the robot must take into account a range of scientific and engineering constraints and preferences. We have developed a system that incorporates multiobjective optimization and planning allowing the robot to generate high quality mission operations plans that respect resource limitations and mission constraints while attempting to maximize science and engineering objectives. An important scientific objective for the exploration of geological features is selecting observations that spatially cover an area of interest. We have developed a metric to enable an in situ explorer to reason about and track the spatial coverage quality of a plan. We describe this technique and show how it is combined in the overall multiobjective optimization and planning algorithm.
A new aircraft arrival planning and optimization algorithm has been incorporated into the Final Approach Spacing Tool (FAST) in the Center-TRACON Automation System (CTAS) developed at NASA-Ames Research Center. FAST simulations have been conducted over three years involving full-proficiency, level five air traffic controllers from around the United States. From these simulations an algorithm, called Spatial Constraint Satisfaction, has been designed, coded, undergone testing, and soon will begin field evaluation at the Dallas-Fort Worth and Denver International airport facilities. The purpose of this new design is an attempt to show that the generation of efficient and conflict free aircraft arrival plans at the runway does not guarantee an operationally acceptable arrival plan upstream from the runway -information encompassing the entire arrival airspace must be used in order to create an acceptable aircraft arrival plan. This new design includes functions available previously but additionally includes necessary representations of controller preferences and workload, operationally required amounts of extra separation, and integrates aircraft conflict resolution. As a result, the Spatial Constraint Satisfaction algorithm produces an optimized aircraft arrival plan that is more acceptable in terms of arrival procedures and air traffic controller workload. This paper discusses the current Air Traffic Control arrival planning procedures, previous work in this field, the design of the Spatial Constraint Satisfaction algorithm, and the results of recent evaluations of the algorithm.
An optimal control formulation of the problem of collision avoidance of mobile robots moving in general terrains containing moving obstacles is presented. A dynamic model of the mobile robot and the dynamic constraints are derived. Collision avoidance is guaranteed if the minimum distance between the robot and the object is nonzero. A nominal trajectory is assumed to be known from off-line planning. The main idea is to change the velocity along the nominal trajectory so that collisions are avoided. Time consistency with the nominal plan is desirable. A numerical solution of the optimization problem is obtained. A perturbation control type of approach is used to update the optimal plan. Simulation results verify the value of the proposed strategy.
Distributed and networked mobile sensor platforms using unmanned aerial and/or ground vehicles to survey areas of interest offer a safer and more efficient method for radiological contamination mapping; however, most applications rely on uniformly sweeping of the area in a raster-type motion without utilizing the information available in a dynamic sense. We have developed a fully autonomous optimal motion planning procedure for networks with two or more mobile sensors. The procedure utilizes well-established concepts of Gaussian processes in combination with control laws based on centroidal Voronoi tessellations to achieve optimal next-iteration sensor movements. A new method of informing optimal motion planning is proposed, whereby the absolute difference between the prior and current full-map prediction, referred to as the prediction-difference map, is used as the spatial density function within each Voronoi cell, providing immediate and iterative feedback for dynamic use of available information. The Gaussian process regression model used to estimate the contamination in unvisited locations also provides prediction uncertainties, and can be used as a quantitative metric to assess the confidence in the calculated contamination map; these estimates and prediction uncertainties are unavailable for standard uniform survey routines as they can only produce maps in the vicinity of observed locations. We present through simulation the achievable performance gains from using this new method by directly comparing to a uniform survey method. Results show that using the prediction-difference maps to inform motion planning procedures offers a faster rate of producing an accurate and convergent map relative to a uniform survey route.
This project developed a scalable, high-resolution model to simulate medium- and heavy-duty (MHD) electric truck charging demand and assess its impact on grid infrastructure. Using generative modeling, simulation, and cost optimization, the project delivered an end-to-end software pipeline and a library of 96 real-world scenarios for the Dallas–Houston megaregion. We demonstrated a modular architecture for transportation and grid modeling, implemented cost-optimized infrastructure planning methods, and quantified grid capital, operational, and environmental costs across a wide range of truck electrification scenarios. The results have been adopted by major utility stakeholders and contributed to regional planning efforts.
The primary motivation for this research emanates from providing a decision support system to the electric bus operators in the municipal and urban localities which will guide the operators to maintain an optimal compromise among the noise level, pollution level, fuel usage etc. This study is backed up by our previous studies on study of battery characteristics, permanent magnet DC motor studies and electric traction motor size studies completed in the first year. The operator of the Hybrid Electric Car must determine optimal power management schedule to meet a given load demand for different weather and road conditions. The decision support system for the bus operator comprises three sub-tasks viz. forecast of the electrical load for the route to be traversed divided into specified time periods (few minutes); deriving an optimal 'plan' or 'preschedule' based on the load forecast for the entire time-horizon (i.e., for all time periods) ahead of time; and finally employing corrective control action to monitor and modify the optimal plan in real-time. A fully connected artificial neural network (ANN) model is developed for forecasting the kW requirement for hybrid electric bus based on inputs like climatic conditions, passenger load, road inclination, etc. The ANN model is trained using back-propagation algorithm employing improved optimization techniques like projected Lagrangian technique. The pre-scheduler is based on a Goal-Programming (GP) optimization model with noise, pollution and fuel usage as the three objectives. GP has the capability of analyzing the trade-off among the conflicting objectives and arriving at the optimal activity levels, e.g., throttle settings. The corrective control action or the third sub-task is formulated as an optimal control model with inputs from the real-time data base as well as the GP model to minimize the error (or deviation) from the optimal plan. These three activities linked with the ANN forecaster proving the output to the GP model which in turn produces the pre-schedule of the optimal control model. Some preliminary results based on a hypothetical test case will be presented for the load forecasting module. The computer codes for the three modules will be made available fe adoption by bus operating agencies. Sample results will be provided using these models. The software will be a useful tool for supporting the control systems for the Electric Bus project of NASA.
Regions worldwide are adopting and exploring low-speed automated electric shuttle (AES) service as an on-demand shared mobility service in dense geofenced urban areas. Building on this concept, the National Renewable Energy Laboratory (NREL) recently developed the Automated Mobility District (AMD) toolkit. The AMD toolkit—comprising of a travel micro-simulation model and an energy estimation model—estimates the mobility and energy impacts of a given shuttle configuration within an AMD. Early-stage AMD deployments need to find optimal operational configurations that include: (a) passenger capacity of an AES, (b) time-dependent routes, and (c) fleet size (AES units) to satisfy the demand for the region. This research extends the AMD toolkit functionality by developing an optimization-based planning module that will assist in the operations of AES units. We developed a constrained mixed-integer program accounting for passenger waiting time, battery range, and passenger capacity of AES units. For scalability, we demonstrated the Tabu search-based solution technique for a real-world network—a proposed AMD deployment in Greenville, South Carolina, USA. Compared to rule-based operations, our developed solution yields higher travel time and energy savings for the network at different demand levels. The sensitivity analyses for waiting time thresholds indicate nonlinearity in the system performance, underscoring the need to meet shared-use mobility user-level expectations. The developed optimization framework can be adapted and extended to accommodate different categories of shared-use on-demand mobility services.
Recombinant protein production (RPP) is central to biotechnology, where recombinant proteins are used as either end products or catalysts in the synthesis of chemicals, fuels, and materials. Among the major cost drivers, culture medium plays a pivotal role in determining protein yield and quality. This review presents a comprehensive perspective on the critical stages of “smart” culture medium optimization: planning, screening, modeling, optimization, and validation. In the planning stage, we examine the nutritional and energetic roles of medium components, including carbon, nitrogen, amino acids, salts, and trace metals, and their impacts on culture parameters such as pH, oxidative state, and osmolality. We highlight the variability in trace metal content due to water sources, culture vessels, and raw materials, which can substantially influence RPP. The screening stage covers Design of Experiments (DoE) approaches, assessing their theoretical basis, implementation, and limitations. For modeling, we describe methods that integrate experimental data to develop predictive models for smart medium formulation. Model-based optimization strategies can then be employed to select optimal media compositions for a given application. The validation stage aims to evaluate model predictions and provide feedback for model training and refinement. Finally, we survey mechanistic and artificial intelligence/machine learning (AI/ML)-driven models as integrated, transformational tools for predictive modeling of bioprocess conditions, nutrient availability, cellular metabolism, and protein quality, with the goal of optimizing culture media to enhance protein yields while reducing costs and environmental impact. We conclude by addressing the challenges of translating laboratory-scale medium optimization to industrial-scale settings and exploring future AI/ML-driven approaches that may overcome current bottlenecks and accelerate medium design for RPP. Overall, this review provides a unified framework for advancing smart medium design in RPP.
We propose a generalized framework which performs an optimal partitioning of a limited budget into various organizational sectors in order to improve the cybersecurity of a smart device or component in the Cyber Physical Energy System (CPS). The framework identifies the adversarial threats and possible attack sequences which can be performed to exploit cyber vulnerabilities of the component. Thereafter, we formulate an Mixed Integer Linear Programming (MILP) optimization problem which aims to evaluate the optimal budget partitions in order to minimize the number of highly likely attack sequences. Though we provide results for using the framework in CPES, the proposed methodology can be extended for multiple domains with a set of known adversarial and mitigation actions.
Increasingly severe droughts are straining municipal water resources and jeopardizing urban water security, but uncertainty in their duration, frequency, and intensity challenges drought planning and response. We develop the Drought Resilient Interscale Portfolio Planning model (DRIPP) to generate optimal planning responses to urban drought. DRIPP is a generalizable multi-scale framework for optimizing dynamic planning strategies of long-term infrastructure deployment and short-term drought response. It integrates climate and hydrological variability with high-fidelity representations of urban water distribution, available technology options, and demand reduction measures to yield robust and cost-effective water supply portfolios that are location-specific. We apply DRIPP in Santa Barbara, California to assess how least cost water supply portfolios vary under different drought scenarios and identify portfolios that are robust across drought scenarios. In Santa Barbara, we find that drought intensity, not duration or frequency, drives cost increases, reliability risk, and regret of overbuilding infrastructure. Under uncertain drought conditions, a diversified technology portfolio that includes both rapidly deployable, decentralized technologies alongside larger centralized technologies minimizes water supply cost while maintaining high robustness to climate uncertainty.
Genetic algorithms (GA) are used to search the synaptic weight space of artificial neural systems (ANS) for weight vectors that optimize some network performance function. GAs do not suffer from some of the architectural constraints involved with other techniques and it is straightforward to incorporate terms into the performance function concerning the metastructure of the ANS. Hence GAs offer a remarkably general approach to calibrating ANS. GAs are applied to the problem of calibrating an ANS that finds optimal paths over a given surface. This problem involves training an ANS on a relatively small set of paths and then examining whether the calibrated ANS is able to find good paths between arbitrary start and end points on the surface.
This study aimed to investigate the effect of body habitus on supraclavicular (SC) dose-volume histogram (DVH) parameters among breast cancer patients according to 3 different techniques. Three SC irradiation plans were generated for 24 postoperative breast cancer patients: (1) direct antero-posterior field only (1fieldP), with dose prescribed to a 3-cm depth; (2) 3-cm depth plan (3cmP) using an antero-posterior field plus a posterior boost with the dose prescription defined to 3 cm; and (3) optimized plan (OptP) similar to 3cmP, with dose prescribed depending on the anatomy. The OptP plans had the least variation in DVH parameters with body habitus; 3cmP plans were the most varied. Conformity index among normal weight patients were 0.73, 0.78, and 0.87 (p = 0.02) and 0.61, 0.6, and 0.82 among overweight-obese patients for 1fieldP, 3cmP, and OptP, respectively (p 95% of the planning target volume among normal weight patients were 72.63%, 78.03%, and 87.18% for 1fieldP, 3cmP, and OptP, respectively (p = 0.02). The corresponding values among overweight-obese patients were 60.5%, 59.62%, and 81.62%, respectively (p = 0.001). Fixed depth dose prescriptions caused greater SC under dose than plans optimized according to patient's anatomy.
Wireless charging technology presents perfect fits for autonomous electric vehicles for realizing a fully automated system (vehicle and charger). This paper presents a planning optimization analysis for a pilot project of in-route wireless charging infrastructure serving fixed-route on-demand shared automated electric shuttles (SAESs) at Greenville, South Carolina, USA. A single-objective non-linear integer planning optimization problem is formulated. A comprehensive cost function representing the inductively charged SAESs is developed, considering road construction, power electronics and materials, traction battery, and installation costs. The optimization problem is solved to determine the best combination of the system key design parameters (number and allocations of wireless chargers, charging power level, track length and on-board battery capacity) that show the most cost-effective solution and allow the SAESs realizing charge sustaining operation. The planning platform incorporates representative simulated traffic data (drive cycles and routes) for four SAESs at Greenville project using the Simulation of Urban Mobility (SUMO) tool. These data are fed to a vehicle powertrain model and a wireless charger power model to predict the battery power, energy and state-of-charge (SOC) profiles, which are provided to the search algorithm to assess the design objectives under specific constraints. The results indicated that implementing wireless charging at a few designated stops for fixed-route SAESs with proper design allows the vehicles realizing charge sustaining operation, infinite range and zero recharge downtime, with a significant reduction in the on-board battery (36 % ) and road coverage (69%), at minimum cost.
Exploring subsurface structures with autonomous robots is of growing interest in the context of planetary caves studies. Communication between robots in these environments is severely degraded which complicates coordination and information distribution. In this paper we focus on planning for mobility and communication in a cave exploration scenario where the situational awareness of a static base station is critical. We propose a notion of information-consistency where a plan itself is part of the information to be shared between robots, and propose a method for generating information-consistent plans. We discuss in detail how the resulting plan can be robustly implemented with minimal communication through local mission executives that run on individual robots. We describe preliminary results on the performance of the planning algorithm and integration of the local mission executives in a high-fidelity simulation environment.