Search NASA⌕ Search

SEARCH · Search NASA

Results for “Trajectory Optimization”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Joint Optimization for Transport and Bucket Loading Phases of Automated Wheel Loaders

This article investigates optimization of fuel-efficiency and productivity for automated wheel loaders. A control-oriented model for both the transport phase and bucket loading phase is proposed. Here, the vehicle model includes an automatic gear shift schedule that can be incorporated into the optimization problem. Based on the model, the multistage optimization problem is formulated to simultaneously consider all phases of a short cycle with physical constraints. Cycle time and fuel efficiency are used as the weighted performance indexes in a multiobjective cost function. Bucket fill factor is included as a constraint during the bucket loading phase. A nonlinear programming problem is created with collocation using MATLAB and CasADi. The optimization solver IPOPT solves the problem to obtain the optimal state and control trajectories, which can be used as a reference for automated wheel loaders or even as a driver advisory for human-driven wheel loaders.

42 ENGINEERING↗
DOE OSTI2019

Dual heuristic dynamic programing control of grid-connected synchronverters

A new approach to control a grid-connected synchronverter by using a dual heuristic dynamic programing (DHP) design is presented. The disadvantages of conventional synchronverter controller such as the challenges to cope with nonlinearity, uncertainties, and non-inductive grids are discussed. To deal with the aforementioned challenges a neural network–based adaptive critic design is introduced to optimize the associated cost function. The characteristic of the neural networks facilitates the performance under uncertainties and unknown parameters (e.g. different power angles). The proposed DHP design includes three neural networks: system NN, action NN, and critic NN. The simulation results compare the performance of the proposed DHP with a traditional PI-based design and with a neural network predictive controller. It is shown a well-trained DHP design performs in a trajectory, which is more optimal compared to the other two controllers.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Online Optimization as a Feedback Controller: Stability and Tracking

This paper develops and analyzes feedback-based online optimization methods to regulate the output of a linear time-invariant (LTI) dynamical system to the optimal solution of a time-varying convex optimization problem. The design of the algorithm is based on continuous-time primal-dual dynamics, properly modified to incorporate feedback from the LTI dynamical system, applied to a proximal augmented Lagrangian function. The resultant closed-loop algorithm tracks the solution of the time-varying optimization problem without requiring knowledge of (time-varying) disturbances in the dynamical system. The analysis leverages integral quadratic constraints to provide linear matrix inequality (LMI) conditions that guarantee global exponential stability and bounded tracking error. Analytical results show that, under a sufficient time-scale separation between the dynamics of the LTI dynamical system and the algorithm, the LMI conditions can be always satisfied. The paper further proposes a modified algorithm that can track an approximate solution trajectory of the constrained optimization problem under less restrictive assumptions. As an illustrative example, the proposed algorithms are showcased for power transmission systems, to compress the time scales between secondary and tertiary control, and allow to simultaneously power re-balancing and tracking of DC optimal power flow points.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2018

Optimal subhourly electricity resource dispatch under multiple price signals with high renewable generation availability

This article proposes a system-wide optimal resource dispatch strategy that enables a shift from a primarily energy cost-based approach, to a strategy using simultaneous price signals for energy, power and ramping behavior. A formal method to compute the optimal sub-hourly power trajectory is derived for a system when the price of energy and ramping are both significant. Optimal control functions are obtained in both time and frequency domains, and a discrete-time solution suitable for periodic feedback control systems is presented. The method is applied to North America Western Interconnection for the planning year 2024, and it is shown that an optimal dispatch strategy that simultaneously considers both the cost of energy and the cost of ramping leads to significant cost savings in systems with high levels of renewable generation: the savings exceed 25% of the total system operating cost for a 50% renewables scenario.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2013

Singular linear-quadratic control problem for systems with linear delay

A singular linear-quadratic optimization problem on the trajectories of non-autonomous linear differential equations with linear delay is considered. The peculiarity of this problem is the fact that this problem has no solution in the class of integrable controls. To ensure the existence of solutions is required to expand the class of controls including controls with impulse components. Dynamical systems with linear delay are used to describe the motion of pantograph from the current collector with electric traction, biology, etc. It should be noted that for practical problems fact singularity criterion of quality is quite commonly occurring, and therefore the study of these problems is surely important. For the problem under discussion optimal programming control contained impulse components at the initial and final moments of time is constructed under certain assumptions on the functional and the right side of the control system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Quantum simulations of nuclear resonances with variational methods

Background: The many-body nature of nuclear physics problems poses significant computational challenges. These challenges become even more pronounced when studying the resonance states of nuclear systems, which are governed by the non-Hermitian Hamiltonian. Quantum computing, particularly for quantum many-body systems, offers a promising alternative, especially within the constraints of current noisy intermediate-scale quantum (NISQ) devices. Purpose: This work aims to simulate nuclear resonances using quantum algorithms by developing a variational framework compatible with non-Hermitian Hamiltonians and implementing it fully on a quantum simulator. Methods: We employ the complex scaling technique to extract resonance positions classically and adapt it for quantum simulations using a two-step algorithm. First, we transform the non-Hermitian Hamiltonian into a Hermitian form by using the energy variance as a cost function within a variational framework. Second, we perform 𝜃-trajectory calculations to determine optimal resonance positions in the complex energy plane. To address resource constraints on NISQ devices, we utilize Gray code (GC) encoding to reduce qubit requirements. Results: We first validate our approach using a schematic potential model that mimics a nuclear potential, successfully reproducing known resonance energies with high fidelity. We then extend the method to a more realistic 𝛼−𝛼 nuclear potential and compute the 𝐷- and 𝐺-wave resonance energies with a basis size of 𝑁=16, using only four qubits. The quantum simulation results closely match the classical values, demonstrating the feasibility of our approach. Conclusions: This study demonstrates, for the first time, that the complete 𝜃-trajectory method can be implemented on a quantum computer without relying on any classical input beyond the Hamiltonian. The results establish a scalable and efficient quantum framework for simulating resonance phenomena in nuclear systems. This work represents a significant step toward quantum simulations of open quantum systems and lays the foundation for future investigations into resonance structures in nuclear, atomic, and molecular physics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2017

Estimating traffic volumes for signalized intersections using connected vehicle data

Recently connected vehicle (CV) technology has received significant attention thanks to active pilot deployments supported by the US Department of Transportation (USDOT). At signalized intersections, CVs may serve as mobile sensors, providing opportunities of reducing dependencies on conventional vehicle detectors for signal operation. However, most of the existing studies mainly focus on scenarios that penetration rates of CVs reach certain level, e.g., 25%, which may not be feasible in the near future. How to utilize data from a small number of CVs to improve traffic signal operation remains an open question. In this work, we develop an approach to estimate traffic volume, a key input to many signal optimization algorithms, using GPS trajectory data from CV or navigation devices under low market penetration rates. To estimate traffic volumes, we model in this paper vehicle arrivals at signalized intersections as a time-dependent Poisson process, which can account for signal coordination. The estimation problem is formulated as a maximum likelihood problem given multiple observed trajectories from CVs approaching to the intersection. An expectation maximization (EM) procedure is derived to solve the estimation problem. Two case studies were conducted to validate our estimation algorithm. One uses the CV data from the Safety Pilot Model Deployment (SPMD) project, in which around 2800 CVs were deployed in the City of Ann Arbor, MI. The other uses vehicle trajectory data from users of a commercial navigation service in China. Mean absolute percentage error (MAPE) of the estimation is found to be 9–12%, based on benchmark data manually collected and data from loop detectors. Finally, considering the existing scale of CV deployments, the proposed approach could be of significant help to traffic management agencies for evaluating and operating traffic signals, paving the way of using CVs for detector-free signal operation in the future.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Direct observation of coherence transfer and rotational-to-vibrational energy exchange in optically centrifuged CO2 super-rotors

Abstract Optical centrifuges are laser-based molecular traps that can rotationally accelerate molecules to energies rivalling or exceeding molecular bond energies. Here we report time and frequency-resolved ultrafast coherent Raman measurements of optically centrifuged CO 2 at 380 Torr spun to energies beyond its bond dissociation energy of 5.5 eV ( J max = 364, E rot = 6.14 eV, E rot / k B = 71, 200 K). The entire rotational ladder from J = 24 to J = 364 was resolved simultaneously which enabled a more accurate measurement of the centrifugal distortion constants for CO 2 . Remarkably, coherence transfer was directly observed, and time-resolved, during the field-free relaxation of the trap as rotational energy flowed into bending-mode vibrational excitation. Vibrationally excited CO 2 ( ν 2 > 3) was observed in the time-resolved spectra to populate after 3 mean collision times as a result of rotational-to-vibrational (R-V) energy transfer. Trajectory simulations show an optimal range of J for R-V energy transfer. Dephasing rates for molecules rotating up to 5.5 times during one collision were quantified. Very slow decays of the vibrational hot band rotational coherences suggest that they are sustained by coherence transfer and line mixing.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Deep kernel methods learn better: from cards to process optimization

Abstract The ability of deep learning methods to perform classification and regression tasks relies heavily on their capacity to uncover manifolds in high-dimensional data spaces and project them into low-dimensional representation spaces. In this study, we investigate the structure and character of the manifolds generated by classical variational autoencoder (VAE) approaches and deep kernel learning (DKL). In the former case, the structure of the latent space is determined by the properties of the input data alone, while in the latter, the latent manifold forms as a result of an active learning process that balances the data distribution and target functionalities. We show that DKL with active learning can produce a more compact and smooth latent space which is more conducive to optimization compared to previously reported methods, such as the VAE. We demonstrate this behavior using a simple cards dataset and extend it to the optimization of domain-generated trajectories in physical systems. Our findings suggest that latent manifolds constructed through active learning have a more beneficial structure for optimization problems, especially in feature-rich target-poor scenarios that are common in domain sciences, such as materials synthesis, energy storage, and molecular discovery. The Jupyter Notebooks that encapsulate the complete analysis accompany the article.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

WE-AB-209-10: Optimizing the Delivery of Sequential Fluence Maps for Efficient VMAT Delivery

Purpose: To develop an optimization model and solution approach for computing MLC leaf trajectories and dose rates for high quality matching of a set of optimized fluence maps to be delivered sequentially around a patient in a VMAT treatment. Methods: We formulate the fluence map matching problem as a nonlinear optimization problem where time is discretized but dose rates and leaf positions are continuous variables. For a given allotted time, which is allocated across the fluence maps based on the complexity of each fluence map, the optimization problem searches for the best leaf trajectories and dose rates such that the original fluence maps are closely recreated. Constraints include maximum leaf speed, maximum dose rate, and leaf collision avoidance, as well as the constraint that the ending leaf positions for one map are the starting leaf positions for the next map. The resulting model is non-convex but smooth, and therefore we solve it by local searches from a variety of starting positions. We improve solution time by a custom decomposition approach which allows us to decouple the rows of the fluence maps and solve each leaf pair individually. This decomposition also makes the problem easily parallelized. Results: We demonstrate method on a prostate case and a head-and-neck case and show that one can recreate fluence maps to high degree of fidelity in modest total delivery time (minutes). Conclusion: We present a VMAT sequencing method that reproduces optimal fluence maps by searching over a vast number of possible leaf trajectories. By varying the total allotted time given, this approach is the first of its kind to allow users to produce VMAT solutions that span the range of wide-field coarse VMAT deliveries to narrow-field high-MU sliding window-like approaches.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

MO-FG-CAMPUS-TeP2-05: Optimizing Stereotactic Radiosurgery Treatment of Multiple Brain Metastasis Lesions with Individualized Rotational Arc Trajectories

Purpose: Radiosurgery of multiple (n>4) brain metastasis lesions requires 3–4 noncoplanar VMAT arcs with excessively high monitor units and long delivery time. We investigated whether an improved optimization technique would decrease the needed arc numbers and increase the delivery efficiency, while improving or maintaining the plan quality. Methods: The proposed 4pi arc space optimization algorithm consists of two steps: automatic couch angle selection followed by aperture generation for each arc with optimized control points distribution. We use a greedy algorithm to select the couch angles. Starting from a single coplanar arc plan we search through the candidate noncoplanar arcs to pick a single noncoplanar arc that will bring the best plan quality when added into the existing treatment plan. Each time, only one additional noncoplanar arc is considered making the calculation time tractable. This process repeats itself until desired number of arc is reached. The technique is first evaluated in coplanar arc delivery scheme with testing cases and then applied to noncoplanar treatments of a case with 12 brain metastasis lesions. Results: Clinically acceptable plans are created within minutes. For the coplanar testing cases the algorithm yields singlearc plans with better dose distributions than that of two-arc VMAT, simultaneously with a 12–17% reduction in the delivery time and a 14–21% reduction in MUs. For the treatment of 12 brain mets while Paddick conformity indexes of the two plans were comparable the SCG-optimization with 2 arcs (1 noncoplanar and 1 coplanar) significantly improved the conventional VMAT with 3 arcs (2 noncoplanar and 1 coplanar). Specifically V16 V10 and V5 of the brain were reduced by 11%, 11% and 12% respectively. The beam delivery time was shortened by approximately 30%. Conclusion: The proposed 4pi arc space optimization technique promises to significantly reduce the brain toxicity while greatly improving the treatment efficiency.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2020

Wind Farm Simulation and Layout Optimization in Complex Terrain: Preprint

This work reports on incorporating complex terrain into wind farm simulations for the purpose of layout optimization. Adding complex terrain boundary conditions to NREL's medium fidelity computational fluid dynamics model, WindSE, produces significant separation, flow curvature, and speedup effects that would otherwise be difficult to capture with lower-fidelity models or a flat-terrain assumption. These flow features, in turn, can significantly impact the optimal turbine array layout. We demonstrate the impact of complex terrain on flow in both an idealized and real-world setting, and discuss modifications to the code that enable gradient-based optimization using terrain-aware adjoint gradients. Through several optimization case studies, we show that the layout optimization process takes advantage of speedup effects on terrain high points, and leverages flow curvature effects that modify wake trajectories. This yields substantial power improvements over gridded layouts, and hints at future research directions in simulation and optimization for wake trajectories in complex terrain.

17 WIND ENERGY↗
DOE OSTI2023

Stress‐constrained topology optimization of structures subjected to nonproportional loading

Abstract This work considers the topology optimization of hyperelastic structures for maximum stiffness (minimum compliance) subject to constraints on their volume and maximum stress. In contrast to almost all previous works, we subject the structures to nonproportional loading, wherein the maximum stress does not necessarily occur at the final load step. As such, the stress is constrained at each load step. The augmented Lagrangian method is used to formulate the optimization problem with its many constraints. In numerical examples, we investigate different load trajectories for the same terminal load and compare the optimized designs and their performances. The results show the importance of considering the entire load trajectory as the load history significantly influences the optimized designs.

42 ENGINEERING↗
DOE OSTI2015

TU-CD-304-02: Planning and Delivery of Fully Dynamic Trajectory Modulated Arc Therapy On Pituitary Adenoma: Dosimetric Advantages Over Conventional Volumetric Modulated Arc Therapy

Purpose: To assess the potential benefit of trajectory modulated arc therapy (TMAT) for treatments of small benign intracranial tumor, pituitary adenoma. Methods: A TMAT planning platform that incorporates complex source motion trajectory involving synchronized gantry rotation with translational and rotational couch movement was used for the study. The platform couples an interactive trajectory generation tool with a VMAT algorithm that performs multi-resolution, progressive sampling MLC optimization on a user-designed trajectory. A continuous couch rotation of 160° angular span with ±20° mini gantry arcs was used to emulate a non-coplanar horizontal arc-like trajectory. Compared to conventional non-coplanar gantry arcs (60°-100° gantry rotation with couch kicks), TMAT limited the unnecessary low to medium dose spread in the anterior and posterior directions, where primary OARs (e.g., brainstem, optic chiasm, optic nerves, and lens) are in close proximity to the targeted pituitary tumor volume. For 5 standard fractionation pituitary adenoma cases (50.4Gy/28fractions), TMAT and non-coplanar VMAT plans were generated and compared under equivalent objectives/constraints. TMAT delivery was implemented and demonstrated on Varian TrueBeam via XML scripts. Results: Both techniques showed good target coverage while OARs were able to meet the constraints on QUANTEC guidelines. Notably, TMAT decreased the dose deposition in the anterior-to-posterior direction surrounding PTV. TMAT significantly reduced the mean doses on brainstem, optic nerves, eyes and lens by 47.29%±13.17%, 28.51%±8.68%, 80.82%±8.71% and 65.38%±19.99% compared with VMAT, all p≤0.01. Percentage reductions of maximum point dose in eyes and lens were 75.68%±10.30% and 70.72%±18.62% respectively for TMAT versus VMAT, all p≤0.01. A representative isocentric TMAT pituitary plan was delivered via an XML script with 200 control points and 282 MUs. Conclusion: Deliverable TMAT plans were achieved in developer mode in TrueBeam. TMAT was shown to be superior for pituitary adenoma irradiation in terms of OARs sparing.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2014

SPS Beam Steering for LHC Extraction

The CERN Super Proton Synchrotron accelerates beams for the Large Hadron Collider to 450 GeV. In addition it produces beams for fixed target facilities which adds complexity to the SPS operation. During the run 2012-2013 drifts of the extracted beam trajectories have been observed and lengthy optimizations in the transfer lines were performed to reduce particle losses in the LHC. The observed trajectory drifts are consistent with the measured SPS orbit drifts at extraction. While extensive studies are going on to understand, and possibly suppress, the source of such SPS orbit drifts the feasibility of an automatic beam steering towards a “golden” orbit at the extraction septa, by means of the interlocked correctors, is also being investigated. The challenges and constraints related to the implementation of such a correction in the SPS are described. Simulation results are presented and a possible operational steering strategy is proposed.

43 PARTICLE ACCELERATORS↗
DOE OSTI2022

A single-cell Arabidopsis root atlas reveals developmental trajectories in wild-type and cell identity mutants

In all multicellular organisms, transcriptional networks orchestrate organ development. The Arabidopsis root, with its simple structure and indeterminate growth, is an ideal model to investigate the spatiotemporal transcriptional signatures underlying developmental trajectories. To map gene expression dynamics across root cell types and developmental time, we built a comprehensive, organ-scale atlas at single cell resolution. In addition to estimating developmental progressions in pseudotime, we employed the mathematical concept of optimal transport to infer developmental trajectories and identify their underlying regulators. To demonstrate the utility of the atlas to interpret new datasets, we profiled mutants for two key transcriptional regulators at single cell resolution, shortroot and scarecrow. We report transcriptomic and in vivo evidence for tissue trans-differentiation underlying a mixed cell identity phenotype in scarecrow. Our results support the atlas as a rich community resource for unraveling the transcriptional programs that specify and maintain cell identity to regulate spatiotemporal organ development.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

Evolutionary strategy for inverse charge measurements of dielectric particles

Here, we report a computational strategy to obtain the charges of individual dielectric particles from experimental observation of their interactions as a function of time. This strategy uses evolutionary optimization to minimize the difference between trajectories extracted from the experiment and simulated trajectories based on many-particle force fields. The force fields include both Coulombic interactions and dielectric polarization effects that arise due to particle-particle charge mismatch and particle-environment dielectric contrast. The strategy was applied to systems of free falling charged granular particles in a vacuum, where electrostatic interactions are the only driving forces that influence the particles' motion. We show that when the particles' initial positions and velocities are known, the optimizer requires only an initial and final particle configuration of a short trajectory in order to accurately infer the particles' charges; when the initial velocities are unknown and only the initial positions are given, the optimizer can learn from multiple frames along the trajectory to determine the particles' initial velocities and charges. While the results presented here offer a proof-of-concept demonstration of the proposed ideas, the proposed strategy could be extended to more complex systems of electrostatically charged granular matter.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Dynamic Interference Management for UAV-Assisted Wireless Networks

Here, we investigate a transmission mechanism aiming to improve the data rate between a base station (BS) and a user equipment (UE) through deploying multiple relaying UAVs. We consider the effect of interference incurred by another established communication network, which makes our problem challenging and different from the state of the art. We aim to design the 3D trajectories and power allocation for the UAVs to maximize the data flow of the network while keeping the interference on the existing communication network below a threshold. We utilize the mobility feature of the UAVs to evade the (un)-intended interference caused by (un)-intentional interferers. To this end, we propose an alternating-maximization approach to jointly obtain the 3D trajectories and the UAVs transmission powers. We handle the 3D trajectory design by resorting to spectral graph the power allocation through convex optimization techniques. We also approach the problem from the intentional interferer’s perspective where smart jammers chase the UAVs to effectively degrade the data flow of the network. We also extend our work to the case for multiple UEs. Finally, we demonstrate the efficacy of our proposed method through extensive simulations.

42 ENGINEERING↗