Applying Linear Programming to Optimize Fire Station Location
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.
Abstract not provided.
Linear shaped charges are used to focus energy into rapidly creating a deep linear incision. The general design of a shaped charge involves detonating a confined mass of high explosive (HE) with a metal-lined concave cavity on one side to produce a high velocity jet for the purpose of striking and penetrating a given material target. This jetting effect occurs due to the interaction of the detonation wave with the cavity geometry, which produces an unstable fluid phenomenon known as the Richtmyer–Meshkov instability and results in the rapid growth of a long narrow jet. We apply machine learning and optimization methods to hydrodynamics simulations of linear shaped charges to improve the simulated jet characteristics. The designs that we propose and investigate in this work generally involve modifying the behavior of the detonation waves prior to interaction with the liner material. These designs include the placement of multiple detonators and the use of metal inclusions within the HE. In conclusion, we are able to produce a linear shaped-charge design with a higher penetration depth than the baseline case that we consider and accomplish this using the same amount of or less HE.
Sufficient conditions for strong stability of a class of linear time-optimal control problems with general convex terminal set are derived. Strong stability in turn guarantees qualified optimality conditions. The theory is based on a characterization of weak invariance of the target set under the controlled equation. An appropriate strengthening of the resulting Hamiltonian condition ensures strong stability and yields a priori bounds on the size of multipliers, independent of, e.g. , the initial point or the running cost. In particular, the results are applied to the control of the heat equation into an L 2 -ball around a desired state.
Linear functional differential equations trajectory optimization, proving maximal principle
The Principal results of a recent theory of fuel optimal space trajectories for linear differential equations are presented. Both impulsive and bounded-thrust problems are treated. A new form of the Lawden Primer vector is found that is identical for both problems. For this reason, starting iteratives from the solution of the impulsive problem are highly effective in the solution of the two-point boundary-value problem associated with bounded thrust. These results were applied to the problem of fuel optimal maneuvers of a spacecraft near a satellite in circular orbit using the Clohessy-Wiltshire equations. For this case two-point boundary-value problems were solved using a microcomputer, and optimal trajectory shapes displayed. The results of this theory can also be applied if the satellite is in an arbitrary Keplerian orbit through the use of the Tschauner-Hempel equations. A new form of the solution of these equations has been found that is identical for elliptical, parabolic, and hyperbolic orbits except in the way that a certain integral is evaluated. For elliptical orbits this integral is evaluated through the use of the eccentric anomaly. An analogous evaluation is performed for hyperbolic orbits.
Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂(𝜅log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837𝜅 at 𝜖 = 10 −10 for Hermitian matrices.
A methodology grounded in model reduction is presented for accelerating the gradient-based solution of a family of linear or nonlinear constrained optimization problems where the constraints include at least one linear Partial Differential Equation (PDE). A key component of this methodology is the construction, during an offline phase, of a database of pointwise, linear, Projection-based Reduced-Order Models (PROM)s associated with a design parameter space and the linear PDE(s). A parameter sampling procedure based on an appropriate saturation assumption is proposed to maximize the efficiency of such a database of PROMs. A real-time method is also presented for interpolating at any queried but unsampled parameter vector in the design parameter space the relevant sensitivities of a PROM. The practical feasibility, computational advantages, and performance of the proposed methodology are demonstrated for several realistic, nonlinear, aerodynamic shape optimization problems governed by linear aeroelastic constraints.
A two-time scale approximation for the linear quadratic optimal output feedback regulator program is examined. Necessary conditions for optimality, as well as an algorithm for computing locally near-optimal gains are derived. If it is assumed that the slow and fast subsystem initial conditions are uniformly distributed, optimal gains for the two-time-scale problem provide a second-order approximation to optimal closed-loop performance in the unperturbed system. This is verified with a numerical example.
Optimal digital controller based on linear approximation of acoustical test facility, for determining effects of supersonic rocket engine noise on vehicle surface
Linear feedback control system with quadratic penalty function, deriving lower bound on optimal performance for suboptimality evaluation
The non-linear dynamic characteristics and optimal control of a giant magnetostrictive film (GMF) subjected to in-plane stochastic excitation were studied. Non-linear differential items were introduced to interpret the hysteretic phenomena of the GMF, and the non-linear dynamic model of the GMF subjected to in-plane stochastic excitation was developed. The stochastic stability was analysed, and the probability density function was obtained. The condition of stochastic Hopf bifurcation and noise-induced chaotic response were determined, and the fractal boundary of the system's safe basin was provided. The reliability function was solved from the backward Kolmogorov equation, and an optimal control strategy was proposed in the stochastic dynamic programming method. Numerical simulation shows that the system stability varies with the parameters, and stochastic Hopf bifurcation and chaos appear in the process; the area of the safe basin decreases when the noise intensifies, and the boundary of the safe basin becomes fractal; the system reliability improved through stochastic optimal control. Finally, the theoretical and numerical results were proved by experiments. The results are helpful in the engineering applications of GMF.
Accelerated gradient method for numerical solution of parameter optimization problems with nonlinear constraints
Matrix method for optimal feedback control of linear systems
Analytical method based on Volterra factorization leads to new approximations for optimal control gains in finite-time linear-quadratic control problem of system having infinite number of dimensions. Circumvents need to analyze and solve Riccati equations and provides more transparent connection between dynamics of system and optimal gain.
This study demonstrates a robust trajectory optimization approach for rendezvous and proximity operations with angles-only navigation measurements. Often, sensors that directly measure relative range and velocity require communication or coordination between the chaser and target vehicle and can have limiting pointing accuracy, mass, or power requirements compared to angle measurement sensors. Thus, the capability to perform a rendezvous with only angle measurements can be advantageous for vehicle design and to improve robustness to failures. However, the well studied limitation of angles-only navigation in measuring range results in large uncertainties in the navigation system that must be reduced with chaser vehicle thrust maneuvers to induce observability in range for the navigation filter. This analysis presents a trajectory optimization problem for a lunar ascent rendezvous during a crewed lunar mission in a Near-Rectilinear Halo Orbit (NRHO) that is limited to only angle measurements. The objective of this study is to show that an angles-only rendezvous is feasible in an NRHO and to present the sensitivity to an assortment of constraints generated from a systematic optimization process using linear covariance analysis and particle swarm optimization. Linearized NRHO dynamics and linearized relative targeting are applied to use linear covariance analysis to determine the expected delta-v and trajectory dispersions due to initial state uncertainty, sensor errors, maneuver execution errors, and unmodeled dynamics. The delta-v and trajectory dispersions are passed into a particle swarm optimization algorithm to find the optimized maneuver profile that minimizes fuel use while satisfying constraints such as free drift and underburn to 3-sigma certainty. The trajectory constraints including time available, desired final uncertainty, and initial uncertainty are varied to ascertain sensitivity and desirable engineering trades.
A linearized theory wing design and optimization procedure which allows physical realism and practical considerations to be imposed as constraints on the optimum (least drag due to lift) solution is discussed and examples of application are presented. In addition to the usual constraints on lift and pitching moment, constraints are imposed on wing surface ordinates and wing upper surface pressure levels and gradients. The design procedure also provides the capability of including directly in the optimization process the effects of other aircraft components such as a fuselage, canards, and nacelles.
Over the period of this award we developed an algorithmic framework for constraint reduction in linear programming (LP) and convex quadratic programming (QP), proved convergence of our algorithms, and applied them to a variety of applications, including entropy-based moment closure in gas dynamics.