The cutting-stock problem, which considers how to arrange the component profiles on the material without overlaps, can increase the utility rate of the sheet stock, and is thus a standard constrained optimisation problem. In some applications the components should be placed with specific orientations, but in others the components may be placed with any orientation. This study presents an overla...

In reactor furnace, due to high temperature and high pressure, data can be measured only near the furnace wall. In this paper, the way to estimate temperature distribution in a reactor furnace using measured data near the furnace walls and to control temperature distribution to the desired temperature distribution was studied. In the estimation, SQP method is employed using measured data near t...

Model predictive control (MPC) is applied to the Caltech ducted fan, a thrust-vectored flight experiment. A real-time trajectory generation software based on spline theory and sequential quadratic programming is used to implement the MPC controllers. Timing issues related to the computation and implementation of repeatedly updated optimal trajectories are discussed. Results show computational s...

This paper discusses a design methodology of cooperative trajectory generation for multi-robot systems. The trajectory of achieving cooperative tasks, i.e., with temporal constraints, is constructed hy a nonlinear trajectory generation (NTG) algorithm. Three scenarios of multi-robot tasking are proposed at the cooperative task planning framework. The NTG algorithm is, then, used to generate rea...

We address the slow convergence and poor stability of quasi-newton sequential quadratic programming (SQP) methods that is observed when solving experimental design problems, in particular when they are large. Our findings suggest that this behavior is due to the fact that these problems often have bad absolute condition numbers. To shed light onto the structure of the problem close to the solut...

The problem of finding the nearest positive semidefinite Hankel matrix of a given rank to an arbitrary matrix is considered. The problem is formulated as a nonlinear minimization problem with positive semidefinite Hankel matrix as constraints. Then an algorithm with rapid convergence is obtained by the Sequential Quadratic Programming (SQP) method. A second approach is to formulate the problem ...

Under the Energy Internet concept the distribution and management of resources in the electricity market have been gradually transiting from a centralized pattern to a decentralized pattern. Correspondingly, the methodological model for the analysis of economic behaviors needs to be upgraded too. Based on the idea of non-cooperative game theory, this paper puts forward a tripartite game model f...

This paper discusses a Cooperative Path Planning (CPP) design methodology for multi-vehicle systems and a Nonlinear Trajectory Generation (NTG) algorithm. Three scenarios of multi-vehicle tasking are proposed at the CPP framework. The NTG algorithm is, then, used to generate realtime trajectory for desired vehicle activities. Given system dynamics and constraints, the NTG algorithm first finds ...

In this paper we give a global convergence analysis of a basic version of an SQP algorithm described in 2] for the solution of large scale nonlinear inequality-constrained optimization problems. Several procedures and options have been added to the basic algorithm to improve the practical performance; some of these are also analyzed. The important features of the algorithm include the use of a ...

It was recently shown that, in the solution of smooth constrained optimization problems by sequential quadratic programming (SQP), the Maratos eeect can be prevented by means of a certain nonmonotone (more precisely, three-step or four-step monotone) line search. Using a well known transformation, this scheme can be readily extended to the case of minimax problems. It turns out however that, du...