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 955 records · Page 53
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Titan Sample Return Mission Using V-Infinity Leveraging

The unique environment of the Saturnian moon Titan provides a particular incentive for a sample return mission in the mid twenty-first century. The thick atmosphere and low gravity provide both useful benefits and harrowing challenges that make optimizing the return trajectory, whether for time of flight or ΔV, especially important for such a long-term mission in order to maximize return. V-infinity leveraging provides a unique capability for finding epoch independent, reduced ΔV return trajectories which can be reliably converged from theoretical results. This paper will demonstrate the ability to use this technique to enable Titan sample missions and examine it relative to other options.

Titan↗
NASA NTRS1977

SUNSPOT: A computer program for producing optimal solar sail planetocentric trajectories

The input, output and subroutines, including listings, for the SUNSPOT code are described. SUNSPOT can calculate time optimal planetocentric trajectories including orbit-to-orbit transfer and orbit to a subescape point. Trajectories about the the four inner planets can be calculated, and shadowing, oblateness, and solar motion may be included. A penalty function may be included to prevent trajectories which intersect the planet's surface.

Sackett, L. L.↗
NASA NTRS1989

Optimization and guidance of flight trajectories in the presence of windshear

Research on the optimization and guidance of flight trajectories in the presence of windshear performed in the period 1984 to 1989 is discussed. The research concerns windshear recovery systems and covers two major areas of investigation: optimal trajectories for takeoff, abort landing, and penetration landing; and guidance schemes for takeoff, abort landing, and penetration landing.

Miele, A.↗
NASA NTRS2018

Multidisciplinary Optimization of Urban-Air-Mobility Class Aircraft Trajectories with Acoustic Constraints

The design and analysis of on-demand mobility class vehicles will require thorough acoustic analysis to ensure that more numerous aircraft can operate in densely populated areas without causing excessive levels of noise. This work is a step towards a comprehensive ODM vehicle analysis capability. The authors use 6DOF equations of motion to model the electric quad-rotor concept developed by NASA's Revolutionary Vertical Lift Technologies program. As a first step towards acoustic analysis, this trajectory is coupled to an acoustic model that tracks the sound pressure level perceived by an acoustic observer on the ground. The results show that the approach is successful in finding trajectories that minimize total propulsive impulse while obeying limits imposed on the sound pressure level. Future work will involve adding acoustic analysis of increasing fidelity and tying the resulting trajectories to the performance of the electric propulsion system.

electric aircraft↗
NASA NTRS1987

Simulation of Airplane and Rocket Trajectories

Simulation and Optimization of Rocket Trajectories program (SORT) contains comprehensive mathematical models for simulating aircraft dynamics, freely falling objects, and many types of ballistic trajectories. Provides high-fidelity, three-degrees-of-freedom simulation for atmospheric and exoatmospheric flight. It numerically models vehicle subsystems and vehicle environment. Used for wide range of simulations. Written in machine-independent FORTRAN 77.

Wahbah, Magdy M.↗
NASA NTRS2013

Abort Options for Human Missions to Earth-Moon Halo Orbits

Abort trajectories are optimized for human halo orbit missions about the translunar libration point (L2), with an emphasis on the use of free return trajectories. Optimal transfers from outbound free returns to L2 halo orbits are numerically optimized in the four-body ephemeris model. Circumlunar free returns are used for direct transfers, and cislunar free returns are used in combination with lunar gravity assists to reduce propulsive requirements. Trends in orbit insertion cost and flight time are documented across the southern L2 halo family as a function of halo orbit position and free return flight time. It is determined that the maximum amplitude southern halo incurs the lowest orbit insertion cost for direct transfers but the maximum cost for lunar gravity assist transfers. The minimum amplitude halo is the most expensive destination for direct transfers but the least expensive for lunar gravity assist transfers. The on-orbit abort costs for three halos are computed as a function of abort time and return time. Finally, an architecture analysis is performed to determine launch and on-orbit vehicle requirements for halo orbit missions.

Jesick, Mark C.↗
NASA NTRS1975

A two-level trajectory decomposition algorithm featuring optimal intermediate target selection

A decomposition algorithm is presented that optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.

Petersen, F. M.↗
NASA NTRS1977

A two-level trajectory decomposition algorithm featuring optimal intermediate target selection

A decomposition algorithm is presented which optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.

Petersen, F. M.↗
NASA NTRS1986

Impact of mismodeled idle engine performance on calculation and tracking of optimal 4-D descent trajectories

Advanced flight management systems are being developed which are capable of calculating optimal 3-D and 4-D flight trajectories for arbitrary fuel and time costs. These systems require mathematical models of airplane performance in order to compute the optimal profiles. Mismodeled idle engine characteristics can result in descent trajectories requiring excessive throttle and/or speedbrake activity in order to achieve the desired end conditions. This paper evaluates the cost and fuel penalties, trajectory variations, and flight control requirements associated with typical idle engine modeling errors for a twin-jet transport airplane. Variations in idle power setting, thrust, fuel flow, and surge bleed operation were evaluated for a cruise/descent flight segment. The results of this analysis provide insight into the penalties associated with uncertainties in idle engine performance and suggest methods of modeling which minimize these penalties.

Williams, D. H.↗
DOE OSTI2018

Releasing Correlated Trajectories: Towards High Utility and Optimal Differential Privacy

A mutual correlation between trajectories of two users is very helpful to real-life applications such as product recommendation and social media. While providing tremendous benefits, the releasing of correlated trajectories may leak sensitive social relations, due to potential links between mutual correlations and social relations. To the best of our knowledge, here we take the first step to propose a mathematically rigorous n-body Laplace framework, satisfying epsilon-differential privacy, which efficiently prevents a social relation inference through the mutual correlation between n-node trajectories of two users. The problem is mathematically formulated by defining a trajectory correlation score to measure the social relation between two users. Then, under the n-body Laplace framework, we propose two Lagrange Multiplier-based Differentially Private (LMDP) approaches to optimize the privacy budgets, for the data utility measured by location distances and the data utility measured by location correlations, i.e., UD-LMDP and UC-LMDP. Also, we present detailed analyses of privacy, data utility, adversary knowledge and the constrained optimizations. Finally, we perform experimental studies with real-life data. Our experimental results show that our proposed approaches achieve better privacy and data utility than the existing approaches.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Trajectory design via unsupervised probabilistic learning on optimal manifolds

Abstract This article illustrates the use of unsupervised probabilistic learning techniques for the analysis of planetary reentry trajectories. A three-degree-of-freedom model was employed to generate optimal trajectories that comprise the training datasets. The algorithm first extracts the intrinsic structure in the data via a diffusion map approach. We find that data resides on manifolds of much lower dimensionality compared to the high-dimensional state space that describes each trajectory. Using the diffusion coordinates on the graph of training samples, the probabilistic framework subsequently augments the original data with samples that are statistically consistent with the original set. The augmented samples are then used to construct conditional statistics that are ultimately assembled in a path planning algorithm. In this framework, the controls are determined stage by stage during the flight to adapt to changing mission objectives in real-time.

42 ENGINEERING↗
NASA NTRS1987

Optimization and guidance of abort landing trajectories in a windshear

The abort landing problem for flight trajectories in the presence of windshear is considered with reference to flight in a vertical plane. The optimal trajectory (OT) problem is a minimax problem or Chebyshev problem of optimal control which can be converted into a Bolza problem through suitable transformations. Numerical results for several combinations of windshear intensities and initial altitudes are presented. A guidance trajectory (GT) law is implemented in feedback control form, subject to prescribed bounds on the angle of attack and its time derivative. Simplified guidance trajectories (SGT) are then considered, leading to a safe target altitude guidance. Conclusions derived for strong-to-severe windshear conditions include GT and SGT preserving the basic properties of OT, and the peak altitude drop of GT and SGT being less than that of the constant pitch trajectory and the maximum angle-of-attack trajectory.

Miele, A.↗