Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems – Part 2: Constrained optimization

This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation.     

Control theory for stochastic distributed parameter systems,an engineering perspective

The main purpose of this paper is to survey some recent progresses on control theory for stochastic distributed parameter systems, i.e., systems governed by stochastic differential equations in infinite dimensions, typically by stochastic partial differential equations. We will explain the new phenomenon and difficulties in the study of controllability and optimal control problems for one dimensional stochastic parabolic equations and stochastic hyperbolic equations. In particular, we shall see that both the formulation of corresponding stochastic control problems and the tools to solve them may differ considerably from their deterministic/finite-dimensional counterparts. More importantly, one has to develop new tools, say, the stochastic transposition method introduced in our previous works, to solve some problems in this field.     

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.     

A Global Maximum Error Controller Based Nonlinearity Aware TPWL Method for Reducing Nonlinear Systems

Abstract

Model order reduction is a common practice to reduce large order systems so that their simulation and control become easy. Nonlinearity aware trajectory piecewise linear is a variation of trajectory piecewise linearization technique of order reduction that is used to reduce nonlinear systems. With this scheme, the reduced approximation of the system is generated by weighted sum of the linearized and reduced sub-models obtained at certain linearization points on the system trajectory. This scheme uses dynamically inspired weight assignment that makes the approximation nonlinearity aware. Just as weight assignment, the process of linearization points selection is also important for generating faithful approximations. This article uses a global maximum error controller based linearization points selection scheme according to which a state is chosen as a linearization point if the error between a current reduced model and the full order nonlinear system reaches a maximum value. A combination that not only selects linearization points based on an error controller but also assigns dynamic inspired weights is shown in this article. The proposed scheme generates approximations with higher accuracies. This is demonstrated by applying the proposed method to some benchmark nonlinear circuits including RC ladder network and inverter chain circuit and comparing the results with the conventional schemes.     

Anti‐Sway Crane Control Considering Wind Disturbance and Container Mass

A method for estimating the sway angle using an observer has already been proposed. The state observer estimates the sway angle accurately and must use the detected sway angle value. However, the estimated sway angle has an error owing to rope length error, friction force, and wind. Moreover, the container mass cannot be determined, and therefore the observer parameter is not suitable. We already proposed robust antisway control for overcoming rope length error without adding a new sensor. Further, we designed a friction disturbance observer to cancel out the influence of the friction force. In this paper, we first propose a container mass estimation method when a crane system performs rolling up control. The observer parameter can be selected using the estimated mass value. Second, in crane parallel shift control, we propose a robust antisway control even when there is a wind disturbance. We design a wind disturbance observer and propose a wind disturbance estimator to separate the friction observer output from the wind disturbance observer output. We confirm through experiments that the proposed method can reduce vibration.     

毒品滥用流行病模型的稳定性分析

现有毒品滥用流行病模型假设吸毒者康复后对毒品拥有永久"免疫"力，而忽视了其再次成为毒品易感者的可能性。针对这一问题，通过考虑社区治疗和隔离治疗两种措施，分析了毒品滥用人群的演化过程，提出了基于暂时"免疫"力的毒品滥用流行病模型，并计算了模型的基本再生数，讨论了模型平衡点的存在性和稳定性。当基本再生数小于1时，模型存在一个局部渐进稳定的无毒平衡点；当基本再生数大于1时，模型存在唯一的地方病平衡点，并利用几何方法证明了地方病平衡点的全局稳定性；当基本再生数等于1时，如果满足一定条件，模型出现后向分支现象。数值模拟验证了上述所有结果。研究结果表明提高隔离治疗率、改善社区治疗效果和降低接触传染率可以有效抑制毒品滥用的流行。     

Classic and inverse compositional Gauss-Newton in global DIC

Today, effective implementations of digital image correlation (DIC) are based on iterative algorithms with constant linear operators. A relevant idea of the classic finite element (or, more generally, global) DIC solver consists in replacing the gradient of the deformed state image with that of the reference image, so as to obtain a constant operator. Different arguments (small strains, small deformations, equality of the two gradients close to the solution, etc) have been given in the literature to justify this approximation, but none of them are fully accurate. Indeed, the convergence of the optimization algorithm has to be investigated from its ability to produce descent directions. Through such a study, this paper attempts to explain why this approximation works and what is its domain of validity. Then, an inverse compositional Gauss-Newton implementation of finite element DIC is proposed as a cost-effective and mathematically sound alternative to this approximation.     

On global Hessenberg based methods for solving Sylvester matrix equations

In the first part of this paper, we investigate the use of Hessenberg-based methods for solving the Sylvester matrix equation $AX+XB=C$. To achieve this goal, the Sylvester form of the global generalized Hessenberg process is presented. Using this process, different methods based on a Petrov–Galerkin or on a minimal norm condition are derived. In the second part, we focus on the SGl-CMRH method which is based on the Sylvester form of the Hessenberg process with pivoting strategy combined with a minimal norm condition. In order to accelerate the SGl-CMRH method, a preconditioned framework of this method is also considered. It includes both fixed and flexible variants of the SGl-CMRH method. Moreover, the connection between the flexible preconditioned SGl-CMRH method and the fixed one is studied and some upper bounds for the residual norm are obtained. In particular, application of the obtained theoretical results is investigated for the special case of solving linear systems of equations with several right-hand sides. Finally, some numerical experiments are given in order to evaluate the effectiveness of the proposed methods.     

Maximum Data Generation Rate Routing Protocol Based on Data Flow Controlling Technology for Rechargeable Wireless Sensor Networks

For rechargeable wireless sensor networks, limited energy storage capacity, dynamic energy supply, low and dynamic duty cycles cause that it is unpractical to maintain a fixed routing path for packets delivery permanently from a source to destination in a distributed scenario. Therefore, before data delivery, a sensor has to update its waking schedule continuously and share them to its neighbors, which lead to high energy expenditure for reestablishing path links frequently and low efficiency of energy utilization for collecting packets. In this work, we propose the maximum data generation rate routing protocol based on data flow controlling technology. For a sensor, it does not share its waking schedule to its neighbors and cache any waking schedules of other sensors. Hence, the energy consumption for time synchronization, location information and waking schedule shared will be reduced significantly. The saving energy can be used for improving data collection rate. Simulation shows our scheme is efficient to improve packets generation rate in rechargeable wireless sensor networks.     

M-estimator based Chinese Remainder Theorem with few remainders using a Kroenecker product based mapping vector

The Chinese Remainder Theorem (CRT) explains how to estimate an integer-valued number from the knowledge of the remainders obtained by dividing such unknown integer by co-prime integers. As an algebraic theorem, CRT is the basis for several techniques concerning data processing. For instance, considering a single-tone signal whose frequency value is above the sampling rate, the respective peak in the DFT informs the impinging frequency value modulo the sampling rate. CRT is nevertheless sensitive to errors in the remainders, and many efforts have been developed in order to improve its robustness. In this paper, we propose a technique to estimate real-valued numbers by means of CRT, employing for this goal a Kroenecker based M-Estimation (ME), specially suitable for CRT systems with low number of remainders. Since ME schemes are in general computationally expensive, we propose a mapping vector obtained via Kroenecker products which considerably reduces the computational complexity. Furthermore, our proposed technique enhances the probability of estimating an unknown number accurately even when the errors in the remainders surpass 1/4 of the greatest common divisor of all moduli. We also provide a version of the mapping vectors based on tensorial n-mode products, delivering in the end the same information of the original method. Our approach outperforms the state-of-the-art CRT methods not only in terms of percentage of successful estimations but also in terms of smaller average error.