An official website of the United States government
In this paper, we investigate an optimal harvesting problem of a spatially explicit fishery model that was previously analyzed. On the surface, this problem looks innocent, but if parameters are set to where a singular arc occurs, two complex questions arise. The first question pertains to Fuller's phenomenon (or chattering), a phenomenon in which the optimal control possesses a singular arc that cannot be concatenated with the bang-bang arcs without prompting infinite oscillations over a finite region. 1) How do we numerically assess whether or not a problem chatters in cases when we cannot analytically prove such a phenomenon? The second question focuses on implementation of an optimal control. 2) When an optimal control has regions that are difficult to implement, how can we find alternative strategies that are both suboptimal and realistic to use? Although the former question does not apply to all optimal harvesting problems, most fishery managers should be concerned about the latter. Interestingly, for this specific problem, our techniques for answering the first question results in an answer to the the second. Our methods involve using an extended version of the switch point algorithm (SPA), which handles control problems having initial and terminal conditions on the states. In our numerical experiments, we obtain strong empirical evidence that the harvesting problem chatters, and we find three alternative harvesting strategies with fewer switches that are realistic to implement and near optimal.
more »
« less
Extension of switch point algorithm to boundary-value problems
In an earlier paper (https://doi.org/10.1137/21M1393315), the switch point algorithm was developed for solving optimal control problems whose solutions are either singular or bang-bang or both singular and bang-bang, and which possess a finite number of jump discontinuities in an optimal control at the points in time where the solution structure changes. The class of control problems that were considered had a given initial condition, but no terminal constraint. The theory is now extended to include problems with both initial and terminal constraints, a structure that often arises in boundary-value problems. Substantial changes to the theory are needed to handle this more general setting. Nonetheless, the derivative of the cost with respect to a switch point is again the jump in the Hamiltonian at the switch point.
more »
« less
- Award ID(s):
- 2031213
- PAR ID:
- 10481503
- Publisher / Repository:
- Springer
- Date Published:
- Journal Name:
- Computational Optimization and Applications
- Volume:
- 86
- Issue:
- 3
- ISSN:
- 0926-6003
- Page Range / eLocation ID:
- 1229 to 1246
- Subject(s) / Keyword(s):
- Switch point algorithm Singular control Bang–bang control Boundary-value problems
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
A modified form of Legendre-Gauss orthogonal direct collocation is developed for solving optimal control problems whose solutions are nonsmooth due to control discon- tinuities. This new method adds switch time variables, control variables, and collocation conditions at both endpoints of a mesh interval, whereas these new variables and collocation con- ditions are not included in standard Legendre-Gauss orthogonal collocation. The modified Legendre-Gauss collocation method alters the search space of the resulting nonlinear programming problem and optimizes the switch point of the control solution. The transformed adjoint system of the modified Legendre- Gauss collocation method is then derived and shown to satisfy the necessary conditions for optimality. Finally, an example is provided where the optimal control is bang-bang and contains multiple switches. This method is shown to be capable of solving complex optimal control problems with nonsmooth solutions.more » « less
-
The focus of this paper is on the development of velocity constrained time-optimal control profiles for point-to-point motion of a gantry crane system. Assuming that the velocity of the trolley of the crane can be commanded, an optimal control problem is posed to determine the bang-off-bang control profile to transition the system to the terminal states with no residual vibrations. Both undamped and underdamped systems are considered and the variation of the structure of the optimal control profiles as a function of the final displacement is studied and the collapse and birthing of switches in the control profile are explained. To account for uncertainties in model parameters, a robust controller design is posed and the tradeoff of increase in maneuver time to the reduction of residual vibrations is illustrated.more » « less
-
A numerical optimization study of a minimum-fuel LEO-to-MEO orbital trajectory trans- fer is solved using a bang-bang and singular optimal control (BBSOC) method with multi- domain Legendre-Gauss-Radau quadrature collocation. Modified equinoctial elements are used to avoid singularities that occur in orbital elements. The time, t, state components, (p, f,g,h,k,L,m), and control components, (ur,ut,un,T) are optimized in this one phase prob- lem where seven cases of the initial thrust acceleration values are considered. The structure of the thrust was not assumed, therefore the optimizer determined the number of switch points. The solutions were categorized as partial and multiple revolution optimal trajec- tories. The initial thrust accelerations considered for the partial revolution solutions are s0 = 1.0206 × 100, 5.1029 × 10−1, 1.0206 × 10−1, 5.1029 × 10−2 AU. Furthermore, as the ini- tial thrust acceleration decreased, the final mass decreased while the total time thrusting increased. The initial thrust accelerations considered for the multiple revolution solutions are s0 = 1.0206 × 10−2, 5.1029 × 10−3, 1.0206 × 10−3 AU. Furthermore, as the initial thrust acceleration decreased, the final mass increased while the total time thrusting increased. An in-depth study was completed for the cases of s0 = 1.0206 × 10−1, 1.0206 × 10−3 AU, where the final mass was [0.6683, 0.5991] MU and the total time thrusting was [4.0305, 487.3276] TU.more » « less
-
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
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1007/s10589-023-00530-y
