A neighboring extremal solution for an optimal switched impulsive control problem

This paper presents a neighboring extremal solution for a class of optimal switched impulsive control problems with perturbations in the initial state, terminal condition and system's parameters. The sequence of mode's switching is pre-specified, and the decision variables, i.e. the switching times and parameters of the system involved, have inequality constraints. It is assumed that the active status of these constraints is unchanged with the perturbations. We derive this solution by expanding the necessary conditions for optimality to first-order and then solving the resulting multiple-point boundary-value problem by the backward sweep technique. Numerical simulations are presented to illustrate this solution method

Optimal control of impulsive switched systems with minimum subsystem durations

This paper presents a new computational approach for solving optimal control problems governed by impulsive switched systems. Such systems consist of multiple subsystems operating in succession, with possible instantaneous state jumps occurring when the system switches from one subsystem to another. The control variables are the subsystem durations and a set of system parameters influencing the state jumps. In contrast with most other papers on the control of impulsive switched systems, we do not require every potential subsystem to be active during the time horizon (it may be optimal to delete certain subsystems, especially when the optimal number of switches is unknown). However, any active subsystem must be active for a minimum non-negligible duration of time. This restriction leads to a disjoint feasible region for the subsystem durations. The problem of choosing the subsystem durations and the system parameters to minimize a given cost function is a non-standard optimal control problem that cannot be solved using conventional techniques. By combining a time-scaling transformation and an exact penalty method, we develop a computational algorithm for solving this problem. We then demonstrate the effectiveness of this algorithm by considering a numerical example on the optimization of shrimp harvesting operations

Control parameterization for optimal control problems with continuous inequality constraints: New convergence results

Control parameterization is a powerful numerical technique for solving optimal control problems with general nonlinear constraints. The main idea of control parameterization is to discretize the control space by approximating the control by a piecewise-constant or piecewise-linear function, thereby yielding an approximate nonlinear programming problem. This approximate problem can then be solved using standard gradient-based optimization techniques. In this paper, we consider the control parameterization method for a class of optimal control problems in which the admissible controls are functions of bounded variation and the state and control are subject to continuous inequality constraints. We show that control parameterization generates a sequence of suboptimal controls whose costs converge to the true optimal cost. This result has previously only been proved for the case when the admissible controls are restricted to piecewise continuous functions

The control parameterization method for nonlinear optimal control: A survey

The control parameterization method is a popular numerical technique for solving optimal control problems. The main idea of control parameterization is to discretize the control space by approximating the control function by a linear combination of basis functions. Under this approximation scheme, the optimal control problem is reduced to an approximate nonlinear optimization problem with a finite number of decision variables. This approximate problem can then be solved using nonlinear programming techniques. The aim of this paper is to introduce the fundamentals of the control parameterization method and survey its various applications to non-standard optimal control problems. Topics discussed include gradient computation, numerical convergence, variable switching times, and methods for handling state constraints. We conclude the paper with some suggestions for future research

Characterizing Triviality of the Exponent Lattice of A Polynomial through Galois and Galois-Like Groups

The problem of computing \emph{the exponent lattice} which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra. As is known, almost all irreducible polynomials with integer coefficients have only trivial exponent lattices. However, the algorithms in the literature have difficulty in proving such triviality for a generic polynomial. In this paper, the relations between the Galois group (respectively, \emph{the Galois-like groups}) and the triviality of the exponent lattice of a polynomial are investigated. The \bbbq\emph{-trivial} pairs, which are at the heart of the relations between the Galois group and the triviality of the exponent lattice of a polynomial, are characterized. An effective algorithm is developed to recognize these pairs. Based on this, a new algorithm is designed to prove the triviality of the exponent lattice of a generic irreducible polynomial, which considerably improves a state-of-the-art algorithm of the same type when the polynomial degree becomes larger. In addition, the concept of the Galois-like groups of a polynomial is introduced. Some properties of the Galois-like groups are proved and, more importantly, a sufficient and necessary condition is given for a polynomial (which is not necessarily irreducible) to have trivial exponent lattice.Comment: 19 pages,2 figure

Cyclotomic integers, fusion categories, and subfactors

Dimensions of objects in fusion categories are cyclotomic integers, hence number theoretic results have implications in the study of fusion categories and finite depth subfactors. We give two such applications. The first application is determining a complete list of numbers in the interval (2, 76/33) which can occur as the Frobenius-Perron dimension of an object in a fusion category. The smallest number on this list is realized in a new fusion category which is constructed in the appendix written by V. Ostrik, while the others are all realized by known examples. The second application proves that in any family of graphs obtained by adding a 2-valent tree to a fixed graph, either only finitely many graphs are principal graphs of subfactors or the family consists of the A_n or D_n Dynkin diagrams. This result is effective, and we apply it to several families arising in the classification of subfactors of index less then 5.Comment: 47 pages, with an appendix by Victor Ostri

A unified parameter identification method for nonlinear time-delay systems

This paper deals with the problem of identifying unknown time-delays and model parameters in a general nonlinear time-delay system. We propose a unified computational approach that involves solving a dynamic optimization problem, whose cost function measures the discrepancy between predicted and observed system output, to determine optimal values for the unknown quantities. Our main contribution is to show that the partial derivatives of this cost function can be computed by solving a set of auxiliary time-delay systems. On this basis, the parameter identification problem can be solved using existing gradient-based optimization techniques. We conclude the paper with two numerical simulations

Using biomarkers to predict TB treatment duration (Predict TB): a prospective, randomized, noninferiority, treatment shortening clinical trial

Background : By the early 1980s, tuberculosis treatment was shortened from 24 to 6 months, maintaining relapse rates of 1-2%. Subsequent trials attempting shorter durations have failed, with 4-month arms consistently having relapse rates of 15-20%. One trial shortened treatment only among those without baseline cavity on chest x-ray and whose month 2 sputum culture converted to negative. The 4-month arm relapse rate decreased to 7% but was still significantly worse than the 6-month arm (1.6%, P<0.01).  We hypothesize that PET/CT characteristics at baseline, PET/CT changes at one month, and markers of residual bacterial load will identify patients with tuberculosis who can be cured with 4 months (16 weeks) of standard treatment.Methods: This is a prospective, multicenter, randomized, phase 2b, noninferiority clinical trial of pulmonary tuberculosis participants. Those eligible start standard of care treatment. PET/CT scans are done at weeks 0, 4, and 16 or 24. Participants who do not meet early treatment completion criteria (baseline radiologic severity, radiologic response at one month, and GeneXpert-detectable bacilli at four months) are placed in Arm A (24 weeks of standard therapy). Those who meet the early treatment completion criteria are randomized at week 16 to continue treatment to week 24 (Arm B) or complete treatment at week 16 (Arm C). The primary endpoint compares the treatment success rate at 18 months between Arms B and C.Discussion: Multiple biomarkers have been assessed to predict TB treatment outcomes. This study uses PET/CT scans and GeneXpert (Xpert) cycle threshold to risk stratify participants. PET/CT scans are not applicable to global public health but could be used in clinical trials to stratify participants and possibly become a surrogate endpoint. If the Predict TB trial is successful, other immunological biomarkers or transcriptional signatures that correlate with treatment outcome may be identified. TRIAL REGISTRATION: NCT02821832

Numerical solution of a pursuit-evasion differential game involving two spacecraft in low earth orbit

This paper considers a spacecraft pursuit-evasion problem taking place in low earth orbit. The problem is formulated as a zero-sum differential game in which there are two players, a pursuing spacecraft that attempts to minimize a payoff, and an evading spacecraft that attempts to maximize the same payoff. We introduce two associated optimal control problems and show that a saddle point for the differential game exists if and only if the two optimal control problems have the same optimal value. Then, on the basis of this result, we propose two computational methods for determining a saddle point solution: a semi-direct control parameterization method (SDCP method), which is based on a piecewise-constant control approximation scheme, and a hybrid method, which combines the new SDCP method with the multiple shooting method. Simulation results show that the proposed SDCP and hybrid methodsare superior to the semi-direct collocation nonlinear programming method (SDCNLP method), which is widely used to solve pursuit-evasion problems in the aerospace field