SEARCH · Engineering Papers

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.

SourceResearch connectionFrom yearThrough year

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

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

DOE OSTI2021

C3PU:Real-Time Predictive Charge Control Software for Battery Management Systems (Code for Charge Control and Predictive Unit) [SWR-21-48]

C3PU sets up a model predictive control formulation for the optimal charging control of battery packs and can be deployed for real-time operation on an embedded microprocessor. C3PU uses electrochemical and thermal models of battery packs to predict the charging trajectories of the battery pack over a time horizon under different operating conditions. It then selects the optimal charging trajectory such that a pre-defined objective is minimized, which in the present state of the code is to minimize the charging duration of the battery pack. The optimal charging trajectory is obtained by solving an underlying mathematical problem. However, C3PU is flexible to incorporate other charging objectives. The underlying battery models can be swapped as well, as long as they follow certain mathematical properties. Mathematically, optimal control problems (in this case, optimally controlling the charging current of the battery pack) are computationally expensive. C3PU implements advanced numerical techniques, namely pseudo-spectral optimization, to reduce the computational burden of the underlying problem to solve. This allows for the problem to be solved in real-time in an embedded system. Once the optimal charging trajectory is computed over a time horizon, C3PU can package such data and send it out via appropriate communication protocols.

Mishra, Partha↗

DOE OSTI2022

Autonomous Eco-Driving with Traffic Light and Lead Vehicle Constraints: An Application of Best Constrained Interpolation

Eco-Driving is a critical technology for improving automotive transportation efficiency. It is achieved by modifying the driving trajectory over a particular route to minimize required propulsion energy. Eco-Driving can be approached as an optimal control problem subject to driving constraints such as traffic lights and positions of other vehicles. Best interpolation in a strip is a problem in approximation theory and optimal control. The solution to this problem is a cubic spline. In this research, we demonstrate the connection between Eco-Driving and best interpolation in the strip. By exploiting this connection, we are able to generate optimal Eco-Driving trajectories that could be driven with an autonomous system. Using the simulation tool FASTSim, we can evaluate the trajectories using conventional, hybrid electric, and fully electric vehicle models. Our results quantify the energy efficiency improvements that can be achieved with the proposed approach.

Mahmoud, Yara Hazem↗

DOE OSTI2022

Autonomous Eco-Driving with Traffic Light and Lead Vehicle Constraints: An Application of Best Constrained Interpolation

Mahmoud, Yara Hazem↗

DOE OSTI2020

Leveraging Multiple Connected Traffic Light Signals in an Energy-Efficient Speed Planner

Connecting automated vehicles to traffic lights can lead to significant energy savings by enabling them to pass through intersections in an energy-efficient way without unnecessary stops. A cellular-based communication system connecting multiple traffic lights can help realize the full potential of energy-efficient driving at intersections. Thus, we propose a hierarchical speed planner that can leverage information from multiple connected traffic lights. The proposed speed planner consists of two modules: a green window selector and a reference trajectory generator. The green window selector, based on Dijkstra’s algorithm, finds a series of "green windows" for connected traffic lights that builds an energy-optimal path for vehicles to follow. The reference trajectory generator finds optimal entering times, based on the selected green window at each intersection, and then computes reference trajectories. Deriving and using analytical optimal entering speeds as a function of entering times allows us to guarantee the computational simplicity suitable for real-time implementation. We also demonstrate how to balance energy and traffic flow perspectives in the reference trajectory generator. Lastly, a high-fidelity simulation framework is used to evaluate the proposed speed planner and quantify the extent to which it can save energy in various real-world urban route scenarios.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2022

Trust-Region Approximation of Extreme Trajectories in Power System Dynamics

In this work we present a novel technique, based on a trust-region optimization algorithm and second-order trajectory sensitivities, to compute the extreme trajectories of power system dynamic simulations given a bounded set that represents parametric uncertainty. Furthermore, we show how this method, while remaining computationally efficient compared with sampling-based techniques, overcomes the limitations of previous sensitivity-based techniques to approximate the bounds of the trajectories when the local approximation loses validity because of the nonlinearity. We present several numerical experiments that showcase the accuracy and scalability of the technique, including a demonstration on the IEEE New England test system.

42 ENGINEERING↗

DOE OSTI2026

Score-based deterministic density sampling

We propose a deterministic sampling framework using Score-Based Transport Modeling for sampling an unnormalized target density π given only its score ∇ log π. Our method approximates the Wasserstein gradient flow on KL($f_t$∥π) by learning the time-varying score ∇ log $f_t$ on the fly using score matching. While having the same marginal distribution as Langevin dynamics, our method produces smooth deterministic trajectories, resulting in monotone noise-free convergence. We prove that our method dissipates relative entropy at the same rate as the exact gradient flow, provided sufficient training. Numerical experiments validate our theoretical findings: our method converges at the optimal rate, has smooth trajectories, and is often more sample efficient than its stochastic counterpart. Experiments on high-dimensional image data show that our method produces high-quality generations in as few as 15 steps and exhibits natural exploratory behavior. The memory and runtime scale linearly in the sample size.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Active learning path-dependent properties using a cloud-based materials acceleration platform

Solid state materials are central to many modern technologies in which a given material may be exposed to a variety of environments. The material properties often vary with the sequence of environments in an irreversible manner, resulting in a quintessential path-dependency in experimental observables. While sequential learning techniques have been effectively deployed for accelerating learning of state properties of materials, they often use a consistent environment path in all experiments. To elevate such techniques for making optimal decisions in experimental investigations of path-dependent properties, we introduce an iterated expected information gain acquisition function that optimizes over entire experimental trajectories. This approach is implemented within a cloud-based Materials Acceleration Platform architecture utilizing an event-driven stateful broker coupled with remote HELAO (Hierarchical Experimental Laboratory Automation and Orchestration) instances and an AI science manager. The platform's efficacy was demonstrated through a case study optimizing multi-step spectro-electrochemical experiments to identify optically stable potential windows in (Co–Ni–Sb)O z metal oxides. The system successfully integrated AI-driven experiment design, remote laboratory automation, and cloud-based data infrastructure, validating the platform's capability for managing complex, adaptive, path-dependent workflows in materials discovery.

Guevarra, Dan [California Institute of Technology ↗

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 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 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 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 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 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↗

DOE OSTI2020

Closed-form solutions towards real-time energy-optimal and collision-free speed planning with limited information

Under real-world driving conditions, available information is limited due to communication range, and connected and automated vehicles (CAVs) must plan and follow energy-optimal and collision-free speed trajectory with a high updating rate. To this end, this paper presents a holistic design of a speed planning algorithm using analytical closed-form optimal solutions. Using the simplest vehicle model, we derive closed-form solutions as a function of boundary conditions, and summarize them without and with state constraints imposed by speed limits and vehicle in front. Then, we introduce multiple modes (e.g., eco-approach to traffic signal) to properly respond dynamically changing situations, and present how to set boundary conditions for each mode, while guaranteeing nature of globally optimal solutions. Finally, we perform a large-scale simulation study to identify and quantify the energy impacts of CAVs for real-world driving routes. A simple but effective algorithm based on closed-form solutions shows a significant energy saving potential in comparison with human-driven vehicle and adaptive cruise controlled vehicle with connectivity.

Han, Jihun↗

DOE OSTI2021

A Miniature Multilevel Structures for Lossless Ion Manipulations Ion Mobility Spectrometer with Wide Mobility Range Separation Capabilities

Here, ion mobility spectrometry employing structures for lossless ion manipulations (SLIM-IMS) is an attractive gas-phase separation technique due to its ability to achieve unprecedented effective ion path lengths (>1 km) and IMS resolving powers in a small footprint. The emergence of multilevel SLIM technology, where ions are transferred between vertically stacked SLIM electrode surfaces, has subsequently allowed for ultralong single pass path lengths (>40 m) to be achieved, enabling ultrahigh resolution IMS measurements to be performed over the entire mobility range in a single experiment. The implementation of multiple SLIM levels requires very little additional space for the SLIM system, and we developed a miniature SLIM module (miniSLIM) based on multilevel SLIM technology and report the performance here. The module is 11.1 cm x 6.7 cm x 1.4 cm (L x W x H) and consists of three SLIM levels totaling 1-meter path length. Ion trajectory simulations were used to optimize the SLIM board spacings and SLIM board thicknesses of the miniSLIM IMS system. Methods of efficiently transferring ions between SLIM levels were examined and a new approach using asymmetric traveling waves (TWs) was developed and implemented in the miniSLIM. We experimentally characterized the performance of the --meter multilevel miniSLIM IMS-MS relative to a drift tube IM--MS using an Agilent tuning mixture and tetraalkylammonium cations. The 1-meter miniSLIM achieved a resolving power of up to 131 (CCS/ΔCCS), ~1.5x higher than achievable with a 78 cm path length drift tube IMS, and successfully transmitted the entire ion mobility range in a single separation. We also demonstrated the miniSLIM’s performance as a standalone IMS system (i.e., without MS), showing baseline separation between Agilent tuning mixture cations with the full mobility range observed, and a standard peptide mixture with different charge states readily differentiated. Overall the miniSLIM provides a compact alternative to high performance IMS instruments possessing similar path lengths.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗