PID Control of Planar Nonlinear Uncertain Systems in the Presence of Actuator Saturation

This paper investigates PID control design for a class of planar nonlinear uncertain systems in the presence of actuator saturation. Based on the bounds on the growth rates of the nonlinear uncertain function in the system model, the system is placed in a linear differential inclusion. Each vertex system of the linear differential inclusion is a linear system subject to actuator saturation. By placing the saturated PID control into a convex hull formed by the PID controller and an auxiliary linear feedback law, we establish conditions under which an ellipsoid is contractively invariant and hence is an estimate of the domain of attraction of the equilibrium point of the closed-loop system. The equilibrium point corresponds to the desired set point for the system output. Thus, the location of the equilibrium point and the size of the domain of attraction determine, respectively, the set point that the output can achieve and the range of initial conditions from which this set point can be reached. Based on these conditions, the feasible set points can be determined and the design of the PID control law that stabilizes the nonlinear uncertain system at a feasible set point with a large domain of attraction can then be formulated and solved as a constrained optimization problem with constraints in the form of linear matrix inequalities (LMIs). Application of the proposed design to a magnetic suspension system illustrates the design process and the performance of the resulting PID control law.      

Efficient Flexible M-Tree Bulk Loading Using FastMap and Space-Filling Curves

Many database applications currently deal with objects in a metric space. Examples of such objects include unstructured multimedia objects and points of interest (POIs) in a road network. The M-tree is a dynamic index structure that facilitates an efficient search for objects in a metric space. Studies have been conducted on the bulk loading of large datasets in an M-tree. However, because previous algorithms involve excessive distance computations and disk accesses, they perform poorly in terms of their index construction and search capability. This study proposes two efficient M-tree bulk loading algorithms. Our algorithms minimize the number of distance computations and disk accesses using FastMap and a space-filling curve, thereby significantly improving the index construction and search performance. Our second algorithm is an extension of the first, and it incorporates a partitioning clustering technique and flexible node architecture to further improve the search performance. Through the use of various synthetic and real-world datasets, the experimental results demonstrated that our algorithms improved the index construction performance by up to three orders of magnitude and the search performance by up to 20.3 times over the previous algorithm.     

Optimal design of nonlinear model predictive controller based on new modified multitracker optimization algorithm

The controller design for the robotic manipulator faces different challenges such as the system's nonlinearities and the uncertainties of the parameters. Furthermore, the tracking of different linear and nonlinear trajectories represents a vital role by the manipulator. This paper suggests an optimal design for the nonlinear model predictive control (NLMPC) based on a new improved intelligent technique and it is named modified multitracker optimization algorithm (MMTOA). The proposed modification of the MTOA is carried out based on opposition-based learning (OBL) and quasi OBL approaches. This modification improves the exploration behavior of the MTOA to prevent it from becoming trapped in a local optimum. The proposed method is applied on the robotic manipulator to track different linear and nonlinear trajectories. The NLMPC parameters are tuned by the MMTOA rather than the trial and error method of the designer. The proposed NLMPC based on MMTOA is compared with the original MTOA, genetic algorithm, and cuckoo search algorithm in literature. The superiority and effectiveness of the proposed controller are confirmed to track different linear and nonlinear trajectories. Furthermore, the robustness of the proposed method is emphasized against the uncertainties of the parameters.     

Robust predictive extended state observer for a class of nonlinear systems with time-varying input delay

ABSTRACT

This paper deals with asymptotic stabilisation of a class of nonlinear input-delayed systems via dynamic output feedback in the presence of disturbances. The proposed strategy has the structure of an observer-based control law, in which the observer estimates and predicts both the plant state and the external disturbance. A nominal delay value is assumed to be known and stability conditions in terms of linear matrix inequalities are derived for fast-varying delay uncertainties. Asymptotic stability is achieved if the disturbance or the time delay is constant. The controller design problem is also addressed and a numerical example with an unstable system is provided to illustrate the usefulness of the proposed strategy.     

Nonlinear dynamic behaviors and control based on simulation of high-purity heat integrated air separation column

In this paper, the dynamic behaviors on the basis of simulation for high-purity heat integrated air separation column (HIASC) are studied. A nonlinear generic model control (GMC) scheme is proposed based on the nonlinear behavior analyses of a HIASC process, and an adaptive generic model control (AGMC) scheme is further presented to correct the model parameters online. Related internal model control (IMC) scheme and multi-loop PID (M-PID) scheme are also developed as the comparative base. The comparative researches are carried out among these linear and nonlinear control schemes in detail. The simulation research results show that the proposed AGMC schemes present advantages in both servo control and regulatory control for the high-purity HIASC.     

Adaptive robust boundary control of shaft vibrations under perturbations with unknown upper bounds

This paper presents robust and adaptive boundary control designs to stabilize the two‐dimensional vibration of hybrid shaft model. The hybrid shaft is mathematically represented by a set of partial differential equations, governing the shaft vibrations, coupled to ordinary differential equations, describing rigid body spinning and dynamic boundary conditions. The control objective is to stabilize the transverse vibrations of the perturbed shaft while regulating the spinning rate. To achieve this, the paper first establishes robust boundary control laws that fulfil the control objective in the presence of modeling uncertainties and external disturbances operating over the shaft domain and boundary. Lyapunov‐based analyses show that the proposed robust control exponentially stabilizes the shaft with vanishing distributive perturbations, while assuring ultimately bounded vibrations in the case of nonvanishing perturbations. Then, adaptive control philosophy is utilized to achieve redesigned robust controllers that only use online adaptation of control gains without acquiring the knowledge of bounds on perturbations, as well as dynamic parameters. An advantage of this design is avoiding an overconservative robust control law, which may induce poor stability and chattering in tackling system perturbations with unknown upper bounds. Simulations through finite element method illustrate the results. Copyright © 2014 John Wiley & Sons, Ltd.     

Simultaneous synthesis of a heat exchanger network with multiple utilities using utility substages

Heat exchanger network synthesis (HENS) has progressed by using mathematical programming-based simultaneous methodology. Although various considerations such as non-isothermal mixing and bypass streams are applied to consider real world alternatives in modeling phase, many challenges are faced because of its properties within non-convex mixed-integer nonlinear programming (MINLP). We propose a modified superstructure, which contains a utility substage for use in considering multiple utilities in a simultaneous MINLP model. To improve model size and convergence, fixed utility locations according to temperature and series connections between utilities are suggested. The numbers of constraints, discrete, and continuous variables show that overall model size decreases compared with previous research. Thus, it is possible to expand the feasible search area for reaching the nearest global solution. The model's effectiveness and applications are exemplified by several literature problems, where it is used to deduce a network superior to that of any other reported methodology.     

Elitist clonal selection algorithm for optimal choice of free knots in B-spline data fitting

Data fitting with B-splines is a challenging problem in reverse engineering for CAD/CAM, virtual reality, data visualization, and many other fields. It is well-known that the fitting improves greatly if knots are considered as free variables. This leads, however, to a very difficult multimodal and multivariate continuous nonlinear optimization problem, the so-called knot adjustment problem. In this context, the present paper introduces an adapted elitist clonal selection algorithm for automatic knot adjustment of B-spline curves. Given a set of noisy data points, our method determines the number and location of knots automatically in order to obtain an extremely accurate fitting of data. In addition, our method minimizes the number of parameters required for this task. Our approach performs very well and in a fully automatic way even for the cases of underlying functions requiring identical multiple knots, such as functions with discontinuities and cusps. To evaluate its performance, it has been applied to three challenging test functions, and results have been compared with those from other alternative methods based on AIS and genetic algorithms. Our experimental results show that our proposal outperforms previous approaches in terms of accuracy and flexibility. Some other issues such as the parameter tuning, the complexity of the algorithm, and the CPU runtime are also discussed.     

A stiffness parameter and truncation error criterion for adaptive path following in structural mechanics

We explore a truncation error criterion to steer adaptive step length refinement and coarsening in incremental-iterative path following procedures, applied to problems in large-deformation structural mechanics. Elaborating on ideas proposed by Bergan and collaborators in the 1970s, we first describe an easily computable scalar stiffness parameter whose sign and rate of change provide reliable information on the local behavior and complexity of the equilibrium path. We then derive a simple scaling law that adaptively adjusts the length of the next step based on the rate of change of the stiffness parameter at previous points on the path. We show that this scaling is equivalent to keeping a local truncation error constant in each step. We demonstrate with numerical examples that our adaptive method follows a path with a significantly reduced number of points compared to an analysis with uniform step length of the same fidelity level. A comparison with Abaqus illustrates that the truncation error criterion effectively concentrates points around the smallest-scale features of the path, which is generally not possible with automatic incrementation solely based on local convergence properties.