Engineering Papers⌕ Search

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.

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

At least 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

Optimized Trajectories to the Nearest Stars Using Lightweight High-velocity Photon Sails

New means of interstellar travel are now being considered by various research teams, assuming lightweight spaceships to be accelerated via either laser or solar radiation to a significant fraction of the speed of light (c). We recently showed that gravitational assists can be combined with the stellar photon pressure to decelerate an incoming lightsail from Earth and fling it around a star or bring it to rest. Here, we demonstrate that photogravitational assists are more effective when the star is used as a bumper (i.e., the sail passes “in front of” the star) rather than as a catapult (i.e., the sail passes “behind” or “around” the star). This increases the maximum deceleration at α Cen A and B and reduces the travel time of a nominal graphene-class sail (mass-to-surface ratio 8.6×10{sup −4} g m{sup −2}) from 95 to 75 years. The maximum possible velocity reduction upon arrival depends on the required deflection angle from α Cen A to B and therefore on the binary’s orbital phase. Here, we calculate the variation of the minimum travel times from Earth into a bound orbit around Proxima for the next 300 years and then extend our calculations to roughly 22,000 stars within about 300 lt-yr. Although α Cen is the most nearby star system, we find that Sirius A offers the shortest possible travel times into a bound orbit: 69 years assuming 12.5% c can be obtained at departure from the solar system. Sirius A thus offers the opportunity of flyby exploration plus deceleration into a bound orbit of the companion white dwarf after relatively short times of interstellar travel.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Optimizing training trajectories in variational autoencoders via latent Bayesian optimization approach *

Unsupervised and semi-supervised ML methods such as variational autoencoders (VAE) have become widely adopted across multiple areas of physics, chemistry, and materials sciences due to their capability in disentangling representations and ability to find latent manifolds for classification and/or regression of complex experimental data. Like other ML problems, VAEs require hyperparameter tuning, e.g. balancing the Kullback–Leibler and reconstruction terms. However, the training process and resulting manifold topology and connectivity depend not only on hyperparameters, but also their evolution during training. Because of the inefficiency of exhaustive search in a high-dimensional hyperparameter space for the expensive-to-train models, here we have explored a latent Bayesian optimization (zBO) approach for the hyperparameter trajectory optimization for the unsupervised and semi-supervised ML and demonstrated for joint-VAE with rotational invariances. We have demonstrated an application of this method for finding joint discrete and continuous rotationally invariant representations for modified national institute of standards and technology database (MNIST) and experimental data of a plasmonic nanoparticles material system. The performance of the proposed approach has been discussed extensively, where it allows for any high dimensional hyperparameter trajectory optimization of other ML models.

42 ENGINEERING↗
DOE OSTI2015

Minimum time optimal synthesis for two level quantum systems

For the time optimal problem of an invariant system on SU(2), with two independent controls and a bound on the norm of the control, the extremals of the Pontryagin maximum principle are explicit functions of time. We use this fact here to perform the optimal synthesis for these systems, i.e., to find all time optimal trajectories. Although the Lie group SU(2) is three dimensional, time optimal trajectories can be described in the unit disk of the complex plane. We find that a circular trajectory separates optimal trajectories that reach the boundary of the unit disk from the others. Inside this separatrix circle, another trajectory (the critical trajectory) plays an important role in that all optimal trajectories end at an intersection with this curve. The results allow us to find the minimum time needed to achieve a given evolution of a two level quantum system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer

We solve a multi-period portfolio optimization problem using D-Wave Systems' quantum annealer. We derive a formulation of the problem, discuss several possible integer encoding schemes, and present numerical examples that show high success rates. The formulation incorporates transaction costs (including permanent and temporary market impact), and, significantly, the solution does not require the inversion of a covariance matrix. The discrete multi-period portfolio optimization problem we solve is significantly harder than the continuous variable problem. We present insight into how results may be improved using suitable software enhancements and why current quantum annealing technology limits the size of problem that can be successfully solved today. Here, the formulation presented is specifically designed to be scalable, with the expectation that as quantum annealing technology improves, larger problems will be solvable using the same techniques.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Vibrational coherence and energy transfer in two-dimensional spectra with the optimized mean-trajectory approximation

The optimized mean-trajectory (OMT) approximation is a semiclassical method for computing vibrational response functions from action-quantized classical trajectories connected by discrete transitions that represent radiation-matter interactions. Here, we extend the OMT to include additional vibrational coherence and energy transfer processes. This generalized approximation is applied to a pair of anharmonic chromophores coupled to a bath. The resulting 2D spectra are shown to reflect coherence transfer between normal modes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Dynamic analysis of fully constrained Cable-Driven Parallel Robots for automated prefabricated component installation

This paper presents a dynamic analysis and validation framework to assess a fully constrained six-anchor Cable-Driven Parallel Robot (CDPR) for automated installation of prefabricated facade components. Compared with conventional eight-anchor systems, the six-anchor configuration simplifies setup and reduces cost, but it also reduces control authority, shrinks the wrench-feasible workspace, and tightens orientation limits. Consequently, it is unclear a priori whether dynamically feasible trajectories exist to move the end effector from pickup to the facade. A constrained trajectory optimization is formulated to enforce the system dynamics, cable-tension bounds, and pose/velocity limits, and the framework is evaluated in simulation at three levels: (i) an idealized reference model, (ii) a lab-scale prototype model incorporating measured anchor misalignments and identified damping, and (iii) a full-scale three-story building model with load decomposition for structural feasibility checks. Across these scenarios, the analysis shows that optimal, constraint-satisfying trajectories exist that move the end effector from pickup to installation while maintaining a near-plumb, level orientation at the final pose. Collectively, this multi-scale dynamic analysis and validation framework supports the deployment readiness of the six-anchor CDPR and provides a prototype-based sensitivity case study of how measured anchor placement deviations affect feasibility.

CDPR↗
DOE OSTI2026

Data driven drift correction for complex optical systems

To exploit the thousand-fold increase in spectral brightness of modern light sources, increasingly intricate experiments are being conducted that demand extremely precise beam trajectory. Maintaining the optimal trajectory over several hours of an experiment with the needed precision necessitates active drift control. Here, we outline time varying Bayesian optimization (TVBO) as a data driven approach for robust drift correction, and illustrate its application for a split and delay optical system composed of six crystals and twelve input dimensions. Using numerical simulations, we exhibit the application of TVBO for linear drift, non-smooth temporal drift as well as constrained TVBO for multi-objective control settings, representing real-life operating conditions. This approach can be easily adapted to other X-ray beam conditioning and guidance systems, including multi-crystal monochromators and grazing-incidence mirrors, to maintain sub-micrometer and nanoradian beam stability over the course of an experiment spanning several hours.

Bayesian optimization↗
DOE OSTI2020

Deep Learning-Based Queue-Aware Eco-Approach and Departure System for Plug-In Hybrid Electric Buses at Signalized Intersections: A Simulation Study

Eco-Approach and Departure (EAD) has been considered as a promising eco-driving strategy for vehicles traveling in an urban environment, where information such as signal phase and timing (SPaT) and geometric intersection description is well utilized to guide vehicles passing through intersections in the most energy-efficient manner. Previous studies formulated the optimal trajectory planning problem as finding the shortest path on a graphical model. While this method is effective in terms of energy saving, its computation efficiency can be further enhanced by adopting machine learning techniques. In this paper, we propose an innovative deep learning-based queue-aware eco-approach and departure (DLQ-EAD) system for a plug-in hybrid electric bus (PHEB), which is able to provide an online optimal trajectory for the vehicle considering both the downstream traffic condition (i.e. traffic lights, queues) and the vehicle powertrain efficiency. Based on optimal solutions obtained from the graph-based trajectory planning algorithm (GTPA), a deep neural network (DNN) is developed to learn the optimal vehicle speed for the next time step given its current state. It is demonstrated that the trained DNN can provide energy-efficient trajectories with high computational efficiency and high flexibility adopting to dynamic changes in the surrounding environment. To address the impact of downstream traffic, a queue prediction model is further developed using data from radars and connected vehicles (CVs), as well as signal timing data from SPaT messages. A comprehensive simulation study in the microscopic traffic modeling software PTV VISSIM shows that the proposed DLQ-EAD can achieve 18.7%-24.0% energy efficiency improvements for a single PHEB on various traffic congestion levels. The proposed queue prediction model can be of practical significance even at low penetration rates of CVs. Specifically, additional energy savings of 2.0%-8.2% can be further achieved with 20% vehicles in the network.

Ye, Fei↗
DOE OSTI2019

Cooperative Game Approach to Optimal Merging Sequence and On-Ramp Merging Control of Connected and Automated Vehicles

Vehicle merging is one of the main causes of reduced traffic efficiency, increased risk of collision, and fuel consumption. Connected and automated vehicles (CAVs) can improve traffic efficiency, increase safety, and reduce the negative environmental impacts through effective communication and control. Therefore, to improve the traffic efficiency and reduce the fuel consumption in on-ramp scenarios, this paper addresses the global and optimal coordination of the CAVs in a merging zone. In this work, a cooperative multi-player game-based optimization framework and an algorithm are presented to coordinate vehicles and achieve minimum values for the global pay-off conditions. Fuel consumption, passenger comfort, and travel time within the merging control zone were used as the pay-off conditions. After analyzing the characteristics of the merging control zone and selecting the appropriate control decision duration, multi-player games were decomposed into multiple two-player games. An optimal merging strategy was, thereby, derived from a pay-off matrix, and minimum payoffs were predicted for a number of different potential strategies. The optimal trajectory corresponding to the predicted minimum payoffs was then utilized as the control law to coordinate the vehicles merging. The proposed control scheme derives an optimal merging sequence and an optimal trajectory for each vehicle. The effectiveness of the proposed model is validated through simulation. Finally, the proposed controller is compared with two alternative methods to demonstrate its potential to reduce fuel consumption and travel time and to improve passenger comfort and traffic efficiency.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Optimizing thermodynamic trajectories using evolutionary and gradient-based reinforcement learning

Here using a model heat engine, we show that neural-network-based reinforcement learning can identify thermodynamic trajectories of maximal efficiency. We consider both gradient and gradient-free reinforcement learning. We use an evolutionary learning algorithm to evolve a population of neural networks, subject to a directive to maximize the efficiency of a trajectory composed of a set of elementary thermodynamic processes; the resulting networks learn to carry out the maximally efficient Carnot, Stirling, or Otto cycles. When given an additional irreversible process, this evolutionary scheme learns a previously unknown thermodynamic cycle. Gradient-based reinforcement learning is able to learn the Stirling cycle, whereas an evolutionary approach achieves the optimal Carnot cycle. Our results show how the reinforcement learning strategies developed for game playing can be applied to solve physical problems conditioned upon path-extensive order parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

SU-D-206-03: Segmentation Assisted Fast Iterative Reconstruction Method for Cone-Beam CT

Purpose: Total Variation (TV) based iterative reconstruction (IR) methods enable accurate CT image reconstruction from low-dose measurements with sparse projection acquisition, due to the sparsifiable feature of most CT images using gradient operator. However, conventional solutions require large amount of iterations to generate a decent reconstructed image. One major reason is that the expected piecewise constant property is not taken into consideration at the optimization starting point. In this work, we propose an iterative reconstruction method for cone-beam CT (CBCT) using image segmentation to guide the optimization path more efficiently on the regularization term at the beginning of the optimization trajectory. Methods: Our method applies general knowledge that one tissue component in the CT image contains relatively uniform distribution of CT number. This general knowledge is incorporated into the proposed reconstruction using image segmentation technique to generate the piecewise constant template on the first-pass low-quality CT image reconstructed using analytical algorithm. The template image is applied as an initial value into the optimization process. Results: The proposed method is evaluated on the Shepp-Logan phantom of low and high noise levels, and a head patient. The number of iterations is reduced by overall 40%. Moreover, our proposed method tends to generate a smoother reconstructed image with the same TV value. Conclusion: We propose a computationally efficient iterative reconstruction method for CBCT imaging. Our method achieves a better optimization trajectory and a faster convergence behavior. It does not rely on prior information and can be readily incorporated into existing iterative reconstruction framework. Our method is thus practical and attractive as a general solution to CBCT iterative reconstruction. This work is supported by the Zhejiang Provincial Natural Science Foundation of China (Grant No. LR16F010001), National High-tech R&D Program for Young Scientists by the Ministry of Science and Technology of China (Grant No. 2015AA020917).

60 APPLIED LIFE SCIENCES↗
DOE OSTI2019

Optimizing thermodynamic trajectories using evolutionary reinforcement learning

Using a model heat engine we show that neural network-based reinforcement learning can identify thermodynamic trajectories of maximal efficiency. We use an evolutionary learning algorithm to evolve a population of neural networks, subject to a directive to maximize the efficiency of a trajectory composed of a set of elementary thermodynamic processes; the resulting networks learn to carry out the maximally-efficient Carnot, Stirling, or Otto cycles. Given additional irreversible processes this evolutionary scheme learns a hitherto unknown thermodynamic cycle. Our results show how the reinforcement learning strategies developed for game playing can be applied to solve physical problems conditioned upon path-extensive order parameters.

97 MATHEMATICS AND COMPUTING↗