Search NASA⌕ Search

SEARCH · Search NASA

Results for “conic constraints”

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 19 records

Network-Level Optimization for Unbalanced Power Distribution System: Approximation and Relaxation

The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Distributionally Robust Partially Observable Markov Decision Process with Moment-Based Ambiguity

In this paper, we consider a distributionally robust partially observable Markov decision process (DR-POMDP), where the distribution of the transition-observation probabilities is unknown at the beginning of each decision period, but their realizations can be inferred using side information at the end of each period after an action being taken. We build an ambiguity set of the joint distribution using bounded moments via conic constraints and seek an optimal policy to maximize the worst-case (minimum) reward for any distribution in the set. We show that the value function of DR-POMDP is piecewise linear convex with respect to the belief state and propose a heuristic search value iteration method for obtaining lower and upper bounds of the value function. We conduct numerical studies and demonstrate the computational performance of our approach via testing instances of a dynamic epidemic control problem. Our results show that DR-POMDP can produce more robust policies under misspecified distributions of transition-observation probabilities as compared to POMDP but has less costly solutions than robust POMDP. The DR-POMDP policies are also insensitive to varying parameter in the ambiguity set and to noise added to the true transition-observation probability values obtained at the end of each decision period.

97 MATHEMATICS AND COMPUTING↗

Analytical and experimental studies of natural vibrations modes of ring-stiffened truncated-cone shells with variable theoretical ring fixity

Experimental and analytical investigations of the vibratory behavior of ring-stiffened truncated-cone shells are described. Vibration tests were conducted on 60 deg conical shells having up to four ring stiffeners and for free-free and clamped-free edge constraints and 9 deg conical shells, for two thicknesses, each with two angle rings and for free-free, free-clamped, and clamped-clamped edge constraints. The analytical method is based on linear thin shell theory, employing the Rayleigh-Ritz method. Discrete rings are represented as composed of one or more segments, each of which is a short truncated-cone shell of uniform thickness. Equations of constraint are used to join a ring and shell along a circumferential line connection. Excellent agreement was obtained for comparisons of experimental and calculated frequencies.

Naumann, E. C.↗

Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls

Here, this paper studies two-stage distributionally robust conic linear programming under constraint uncertainty over type-1 Wasserstein balls. We present optimality conditions for the dual of the worst-case expectation problem, which characterizes worst-case uncertain parameters for its inner maximization problem. This condition offers an alternative proof, a counterexample, and an extension to previous works. Additionally, the condition highlights the potential advantage of a specific distance metric for out-of-sample performance, as exemplified in a numerical study on a facility location problem with demand uncertainty. Furthermore, cutting-plane-based algorithms, equipped with a unified scenario generation framework, are proposed for addressing both unbounded support and second-stage dual feasible regions, with a finite convergence proof under less stringent assumptions.

Wasserstein↗

M51's spiral structure

The M51 system (NGC 5194/5195) provides an excellent problem both in spiral structure and in galaxy interactions. The authors present an analytic study of a computer experiment on the excitation mechanisms for M51's spiral arms and whether or not a halo is important for these mechanisms. This work extends previous numerical studies of the M51 system by including self-gravitation in a two component disk: gas and stars, and a dark halo. The analytic study provides two new observational constraints: the time (approx. 70 to 84 million years ago) and position angle of perigalacticon (300 degrees). By using these constraints and a simple conic approximation, the search for the companion's possible orbit is greatly simplified. This requires fewer N-body simulations than a fully self-gravitating orbit search.

Howard, S.↗

IMPLEMENTATION OF THE GRADUATED CYLINDRICAL SHELL MODEL FOR THE THREE-DIMENSIONAL RECONSTRUCTION OF CORONAL MASS EJECTIONS

The graduated cylindrical shell (GCS) model developed by Thernisien et al. has been used with the goal of studying the three-dimensional morphology, position, and kinematics of coronal mass ejections observed by coronagraphs. These studies focused more on the results rather than the details of the model itself. As more researchers begin to use the model, it becomes necessary to provide a deeper discussion on how it is derived, which is the purpose of this paper. The model is built using the following features and constraints: (1) the legs are conical, (2) the front is pseudo-circular, (3) the cross section is circular, and (4) it expands in a self-similar way. We derive the equation of the model from these constraints. We also show that the ice-cream cone model is a limit of the GCS when the two legs overlap completely. Finally, we provide formulae for the calculation of various geometrical dimensions, such as angular width and aspect ratio, as well as the pseudo-code that is used for its computer implementation.

79 ASTRONOMY AND ASTROPHYSICS↗

Polyhedral approximation in mixed-integer convex optimization

Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. Here, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based on constructing polyhedral outer approximations of the convex constraints, resulting in a global solution by solving a finite number of mixed-integer linear and continuous convex subproblems. The key advance we present is to strengthen the polyhedral approximations by constructing them in a higher-dimensional space. In order to automate this extended formulation we rely on the algebraic modeling technique of disciplined convex programming (DCP), and for generality and ease of implementation we use conic representations of the convex constraints. Although our framework requires a manual translation of existing models into DCP form, after performing this transformation on the MINLPLIB2 benchmark library we were able to solve a number of unsolved instances and on many other instances achieve superior performance compared with state-of-the-art solvers like Bonmin, SCIP, and Artelys Knitro.

97 MATHEMATICS AND COMPUTING↗

Best-Fit Conic Approximation of Spacecraft Trajectory

A computer program calculates a best conic fit of a given spacecraft trajectory. Spacecraft trajectories are often propagated as conics onboard. The conic-section parameters as a result of the best-conic-fit are uplinked to computers aboard the spacecraft for use in updating predictions of the spacecraft trajectory for operational purposes. In the initial application for which this program was written, there is a requirement to fit a single conic section (necessitated by onboard memory constraints) accurate within 200 microradians to a sequence of positions measured over a 4.7-hour interval. The present program supplants a prior one that could not cover the interval with fewer than four successive conic sections. The present program is based on formulating the best-fit conic problem as a parameter-optimization problem and solving the problem numerically, on the ground, by use of a modified steepest-descent algorithm. For the purpose of this algorithm, optimization is defined as minimization of the maximum directional propagation error across the fit interval. In the specific initial application, the program generates a single 4.7-hour conic, the directional propagation of which is accurate to within 34 microradians easily exceeding the mission constraints by a wide margin.

Singh, Gurkipal↗

Community Microgrid Scheduling Considering Network Operational Constraints and Building Thermal Dynamics

Here, this paper proposes a Mixed Integer Conic Programming (MICP) model for community microgrids considering the network operational constraints and building thermal dynamics. The proposed optimization model optimizes not only the operating cost, including fuel cost, purchasing cost, battery degradation cost, voluntary load shedding cost and the cost associated with customer discomfort due to room temperature deviation from the set point, but also several performance indices, including voltage deviation, network power loss and power factor at the Point of Common Coupling (PCC). In particular, the detailed thermal dynamic model of buildings is integrated into the distribution optimal power flow (D-OPF) model for the optimal operation of community microgrids. The heating, ventilation and air-conditioning (HVAC) systems can be scheduled intelligently to reduce the electricity cost while maintaining the indoor temperature in the comfort range set by customers. Numerical simulation results show the effectiveness of the proposed model and significant saving in electricity cost could be achieved with network operational constraints satisfied.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Geometric, Kinematic and Radiometric Aspects of Image-Based Measurements

This paper discusses theoretical foundations of quantitative image-based measurements for extracting and reconstructing geometric, kinematic and dynamic properties of observed objects. New results are obtained by using a combination of methods in perspective geometry, differential geometry. radiometry, kinematics and dynamics. Specific topics include perspective projection transformation. perspective developable conical surface, perspective projection under surface constraint, perspective invariants, the point correspondence problem. motion fields of curves and surfaces. and motion equations of image intensity. The methods given in this paper arc useful for determining morphology and motion fields of deformable bodies such as elastic bodies. viscoelastic mediums and fluids.

Liu, Tianshu↗

SU-C-204-04: Patient Specific Proton Stopping Powers Estimation by Combining Proton Radiography and Prior-Knowledge X-Ray CT Information

Purpose: The material relative stopping power (RSP) uncertainty is the highest contributor to the range uncertainty in proton therapy. The purpose of this work is to develop a robust and systematic method that yields accurate, patient specific, RSP by combining 1) pre-treatment x-ray CT and 2) daily proton radiograph of the patient. Methods: The method is formulated as a linear least-square optimization problem (min||Ax-B||2). The parameter A represents the pathlength crossed by the proton in each material. The RSPs for the materials (water equivalent thickness (WET)/physical thickness) are denoted by x. B is the proton radiograph expressed as WET crossed. The problem is minimized using a convex-conic optimization algorithm with xi<xi+1 constraint. The Gammex RMI-465 phantom, with 13 material inserts, is used to investigate the optimal RSPs. The proton radiograph (B) is produced using Geant4 simulation. The matrix A is computed by calculating proton trajectories through the CT with the cubic-spline approach. Geant4 RSPs are used as reference and the clinical HU-RSP calibration curve is used as comparison. The convergence is investigated as a function of the number of angles and protons used. The radiographs angle which yield the most accurate RSPs are investigated. Results: Optimization with 9 angles and 104 protons/angle yields precise RSP (<0.75%) for all materials, except plastic lung (1.5%). Average deviation relative to Geant4 RSP is 0.5% and 3.5% using HU-RSP. Using more than two angles or more than 4×103 proton does not further increase the RSP estimate accuracy. The insert distance to the beam initial plane is related to the RSP error for this insert material. Specific filters are applied on the proton angle and energy loss to remove nuclear interaction artefacts. Conclusion: The proposed formulation of the problem with prior knowledge x-ray CT demonstrates serious potential to increase the accuracy of present RSP estimates.

60 APPLIED LIFE SCIENCES↗

Galileo Jupiter encounter and satellite tour trajectory design

The trajectory design process for the Galilean satellite probe, expected to be launched in January 1982, is examined and its interplanetary path, emphasizing arrival dates and the Mars flyby, is presented. The Galileo spacecraft is of dual spin design, combining features of Pioneer, a spinning craft, and Voyager which was 3-axis stabilized. The design of the initial orbit from Orbiter deflection through Jupiter to the beginning of the satellite tour is discussed as well as the use of an Io gravity assist flyby to achieve Jupiter orbit insertion, and the effects of solar perturbation on the initial orbit. Detail is given to the entire satellite tour trajectory design process, starting from the requirements and constraints placed on the tour through the conic design to the final numerically integrated trajectories.

Diehl, R. E.↗

Keplerian Analysis for Versatile Evaluation of Arbitrary Trajectories

Designing interplanetary missions is an iterative process, with a tight coupling between mission analysis and vehicle design. The ability to simultaneously process both analyses early on can provide significant benefits in both the concept formulation and in overall mission feasibility. To implement such a simultaneous analysis process, there is a need to model interplanetary trajectories rapidly while maintaining an acceptable level of fidelity. Many simple patched conics tools make too many assumptions to satisfactorily address all relevant constraints and objectives, while full-fidelity trajectory design tools often require more time and expertise than is available in early conceptual studies. Hence, some form of middle-ground modeling tool would provide value. This paper introduces the development of such a tool using Python. This tool, Keplerian Analysis for Versatile Evaluation of Arbitrary Trajectories (KAVEAT), implements a patched conics method that enforces continuity of state (time, mass, position, velocity) through all transitions between various spheres of influence on the trajectory. The trajectory is constructed in an object-oriented manner, dynamically assembling unique maneuvers such as departure burns, heliocentric transfers (ballistic or with electric propulsion), and planetary flybys (powered or unpowered). Each maneuver has its own specific set of basic inputs needed to define it. The tool then takes these defined maneuvers, strings them together creating all the interdependencies required, and solves for the ideal trajectory using a gradient-based optimizer.

Katherine T McBrayer↗

Wave function continuity and the diagonal Born-Oppenheimer correction at conical intersections

We demonstrate that though exact in principle, the expansion of the total molecular wave function as a sum over adiabatic Born-Oppenheimer (BO) vibronic states makes inclusion of the second-derivative nonadiabatic energy term near conical intersections practically problematic. In order to construct a well-behaved molecular wave function that has density at a conical intersection, the individual BO vibronic states in the summation must be discontinuous. When the second-derivative nonadiabatic terms are added to the Hamiltonian, singularities in the diagonal BO corrections (DBOCs) of the individual BO states arise from these discontinuities. In contrast to the well-known singularities in the first-derivative couplings at conical intersections, these singularities are non-integrable, resulting in undefined DBOC matrix elements. Though these singularities suggest that the exact molecular wave function may not have density at the conical intersection point, there is no physical basis for this constraint. Instead, the singularities are artifacts of the chosen basis of discontinuous functions. We also demonstrate that continuity of the total molecular wave function does not require continuity of the individual adiabatic nuclear wave functions. We classify nonadiabatic molecular dynamics methods according to the constraints placed on wave function continuity and analyze their formal properties. Based on our analysis, it is recommended that the DBOC be neglected when employing mixed quantum-classical methods and certain approximate quantum dynamical methods in the adiabatic representation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗