The problem of guidance and control of an air-to-surface low-altitude skid-to-turn vehicle is considered. The objective is to steer the vehicle to a ground target from an initial state such that the vehicle remains at a constant low altitude for as long as possible and performs a bunt maneuver (negative sensed-acceleration load) rapidly at the end of the trajectory in order to attain terminal target conditions. The vehicle is modeled as a point mass in motion over a flat Earth, and the vehicle is controlled using thrust magnitude, angle of attack, and sideslip angle. The guidance and control problem is posed as a decreasing-horizon optimal control problem and is re-solved numerically at constant guidance cycles. The work described in this paper is the second part of a two-part sequence on trajectory optimization and guidance of a skid-to-turn vehicle. In both cases, the objective is to minimize the time taken by the vehicle to complete a bunt maneuver subject to the following constraints: dynamic, boundary, state, path, and interior-point event constraints. In the second part of this two-part study, a numerical guidance law is employed to re-solve the optimal control problem on a shrinking horizon. An assessment is made as to the time required to re-solve the optimal control problem both in the absence and presence of a time delay, where the time delay is the amount of time required to solve the numerical approximation of the optimal control problem at the start of each guidance cycle. The results of this study identify that in the absence and presence of a time delay, the size of the mesh on subsequent guidance cycles decreases, the time required to solve the reduced-horizon optimal control problem is small compared to the guidance cycle duration time, and the terminal conditions are met with sufficient accuracy. Thus, the results show that the guidance law presented in this paper has the potential to solve optimal control problems in real-time.
more »
« less
Performance Optimization and Guidance of a Low-Altitude Skid-to-Turn Vehicle. Part I: Performance Optimization
The problem of air-to-surface trajectory optimization for a low-altitude skid-to-turn vehicle is considered. The objective is for the vehicle to move level at a low altitude for as long as possible and perform a rapid bunt (negative sensed-acceleration load) maneuver near the final time in order to attain terminal target conditions. The vehicle is modeled as a point mass in motion over a flat Earth, and the vehicle is controlled using thrust magnitude, angle of attack, and sideslip angle. The trajectory
optimization problem is posed as a two-phase optimal control problem using a weighted objective function. The work described in this paper is the first part of a two-part sequence on trajectory optimization and guidance of a skid-to-turn vehicle. In both cases, the objective is to minimize the time taken by the vehicle to complete a bunt maneuver subject to the following constraints: dynamic, boundary, state, path, and interior-point event constraints. In the first part of this two-part study, the performance of thevehicle is assessed. In particular, the key features of the optimal reference trajectories and controls are provided. The results of this study identify that as greater weight is placed on minimizing the height of the bunt maneuver or as the maximum altitude constraint is raised, the time of the bunt maneuver decreases and the time of the problem solution increases. Also, the results of this study identify that as the allowable crossrange of the vehicle is reduced, the time and height of the bunt maneuver increases and the time of the problem solution decrease
more »
« less
- NSF-PAR ID:
- 10094023
- Date Published:
- Journal Name:
- 2019 AIAA Guidance, Navigation, and Control Conference, San Diego
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
This paper develops a control co-design (CCD) framework to simultaneously optimize the spacecraft’s trajectory and onboard system (rocket engine) and quantify its benefit. An open-loop optimal control problem (two-finite burn Mars missions) is used as the benchmark, and the engine design considers the combustion equilibrium and nozzle geometry. The objective function is the fuel burn. The design variables are the trajectory control parameters (such as burn times, burn directions, and time of flight), initial fuel mass, and engine design parameters (such as throat area, mixture ratio, and chamber pressure). The constraints include the final velocities and positions of spacecraft. Single-point optimizations are conducted for three departure dates in May, July, and September 2020. A multipoint optimization is also performed to balance the engine performance for these dates with 49 design variables and 20 constraints. It is found that the CCD optimizations exhibit 22–28% more fuel burn reduction than the trajectory-only optimization with fixed engine parameters and 16–20% more fuel burn reduction than the decoupled trajectory-engine optimization. The proposed CCD optimization framework can be extended to more spacecraft trajectory control parameters and onboard systems and has the potential to design more efficient spacecraft missions.more » « less
-
This paper addresses trajectory optimization for hypersonic vehicles under atmospheric and aerodynamic uncertainties using techniques from desensitized optimal control (DOC), wherein open-loop optimal controls are obtained by minimizing the sum of the standard objective function and a first-order penalty on trajectory variations due to parametric uncertainty. The proposed approach is demonstrated via numerical simulations of a minimum-final-time Earth reentry trajectory for an X-33 vehicle with an uncertain atmospheric scale height and drag coefficient. Monte Carlo simulations indicate that dispersions in the final position footprint and the final energy can be significantly reduced without closed-loop control and with little tradeoff in the performance metric set for the trajectory.more » « less
-
null (Ed.)Accurate, precise, and timely estimation of crop yield is key to a grower’s ability to proactively manage crop growth and predict harvest logistics. Such yield predictions typically are based on multi-parametric models and in-situ sampling. Here we investigate the extension of a greenhouse study, to low-altitude unmanned aerial systems (UAS). Our principal objective was to investigate snap bean crop (Phaseolus vulgaris) yield using imaging spectroscopy (hyperspectral imaging) in the visible to near-infrared (VNIR; 400–1000 nm) region via UAS. We aimed to solve the problem of crop yield modelling by identifying spectral features explaining yield and evaluating the best time period for accurate yield prediction, early in time. We introduced a Python library, named Jostar, for spectral feature selection. Embedded in Jostar, we proposed a new ranking method for selected features that reaches an agreement between multiple optimization models. Moreover, we implemented a well-known denoising algorithm for the spectral data used in this study. This study benefited from two years of remotely sensed data, captured at multiple instances over the summers of 2019 and 2020, with 24 plots and 18 plots, respectively. Two harvest stage models, early and late harvest, were assessed at two different locations in upstate New York, USA. Six varieties of snap bean were quantified using two components of yield, pod weight and seed length. We used two different vegetation detection algorithms. the Red-Edge Normalized Difference Vegetation Index (RENDVI) and Spectral Angle Mapper (SAM), to subset the fields into vegetation vs. non-vegetation pixels. Partial least squares regression (PLSR) was used as the regression model. Among nine different optimization models embedded in Jostar, we selected the Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing (SA), and Particle Swarm Optimization (PSO) and their resulting joint ranking. The findings show that pod weight can be explained with a high coefficient of determination (R2 = 0.78–0.93) and low root-mean-square error (RMSE = 940–1369 kg/ha) for two years of data. Seed length yield assessment resulted in higher accuracies (R2 = 0.83–0.98) and lower errors (RMSE = 4.245–6.018 mm). Among optimization models used, ACO and SA outperformed others and the SAM vegetation detection approach showed improved results when compared to the RENDVI approach when dense canopies were being examined. Wavelengths at 450, 500, 520, 650, 700, and 760 nm, were identified in almost all data sets and harvest stage models used. The period between 44–55 days after planting (DAP) the optimal time period for yield assessment. Future work should involve transferring the learned concepts to a multispectral system, for eventual operational use; further attention should also be paid to seed length as a ground truth data collection technique, since this yield indicator is far more rapid and straightforward.more » « less
-
null (Ed.)We consider the communication complexity of a number of distributed optimization problems. We start with the problem of solving a linear system. Suppose there is a coordinator together with s servers P1, …, Ps, the i-th of which holds a subset A(i) x = b(i) of ni constraints of a linear system in d variables, and the coordinator would like to output an x ϵ ℝd for which A(i) x = b(i) for i = 1, …, s. We assume each coefficient of each constraint is specified using L bits. We first resolve the randomized and deterministic communication complexity in the point-to-point model of communication, showing it is (d2 L + sd) and (sd2L), respectively. We obtain similar results for the blackboard communication model. As a result of independent interest, we show the probability a random matrix with integer entries in {–2L, …, 2L} is invertible is 1–2−Θ(dL), whereas previously only 1 – 2−Θ(d) was known. When there is no solution to the linear system, a natural alternative is to find the solution minimizing the ℓp loss, which is the ℓp regression problem. While this problem has been studied, we give improved upper or lower bounds for every value of p ≥ 1. One takeaway message is that sampling and sketching techniques, which are commonly used in earlier work on distributed optimization, are neither optimal in the dependence on d nor on the dependence on the approximation ε, thus motivating new techniques from optimization to solve these problems. Towards this end, we consider the communication complexity of optimization tasks which generalize linear systems, such as linear, semi-definite, and convex programming. For linear programming, we first resolve the communication complexity when d is constant, showing it is (sL) in the point-to-point model. For general d and in the point-to-point model, we show an Õ(sd3L) upper bound and an (d2 L + sd) lower bound. In fact, we show if one perturbs the coefficients randomly by numbers as small as 2−Θ(L), then the upper bound is Õ(sd2L) + poly(dL), and so this bound holds for almost all linear programs. Our study motivates understanding the bit complexity of linear programming, which is related to the running time in the unit cost RAM model with words of O(log(nd)) bits, and we give the fastest known algorithms for linear programming in this model. Read More: https://epubs.siam.org/doi/10.1137/1.9781611975994.106more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.2514/6.2019-0354
