Plate/shell topological optimization subjected to linear buckling constraints by adopting composite exponential filtering function

In this paper, a model of topology optimization with linear buckling constraints is established based on an independent and continuous mapping method to minimize the plate/shell structure weight. A composite exponential function（CEF） is selected as filtering functions for element weight, the element stiffness matrix and the element geometric stiffness matrix, which recognize the design variables, and to implement the changing process of design variables from“discrete” to “continuous” and back to “discrete”. The buckling constraints are approximated as explicit formulations based on the Taylor expansion and the filtering function. The optimization model is transformed to dual programming and solved by the dual sequence quadratic programming algorithm. Finally, three numerical examples with power function and CEF as filter function are analyzed and discussed to demonstrate the feasibility and efficiency of the proposed method.

Anisotropic Total Variation Regularization Based NAS-RIF Blind Restoration Method for OCT Image

Based on anisotropic total variation regularization(ATVR), a nonnegativity and support constraints recursive inverse filtering(NAS-RIF) blind restoration method is proposed to enhance the quality of optical coherence tomography(OCT) image. First, ATVR is introduced into the cost function of NAS-RIF to improve the noise robustness and retain the details in the image.Since the split Bregman iterative is used to optimize the ATVR based cost function, the ATVR based NAS-RIF blind restoration method is then constructed. Furthermore, combined with the geometric nonlinear diffusion filter and the Poisson-distribution-based minimum error thresholding, the ATVR based NAS-RIF blind restoration method is used to realize the blind OCT image restoration. The experimental results demonstrate that the ATVR based NAS-RIF blind restoration method can successfully retain the details in the OCT images. In addition, the signal-to-noise ratio of the blind restored OCT images can be improved, along with the noise robustness.

Distributed cooperative localization for sparse communication network with multi-locating messages

In cooperative localization with sparse communication networks, an agent maybe only receives part of locating messages from the others. It is difficult for the receiver to utilize the part instead of global knowledge. Under the extended Kalman filtering, the utilization of the locating message is maximized by two aspects： the locating message generating and multi-locating messages fusing. For the former, the covariance upper-bound technique, by introducing amplification coefficients, is employed to remove the dependency of locating messages on the global knowledge. For the latter, an optimization model is setup; the covariance matrix determinant of the receiver＇s state estimate, expressed as a function of the amplification coefficients, is selected as the optimization criterion, under linear constraints on the amplification coefficient characteristics and the communication connectivity. Using the optimization solution, the local optimal state of the receiver agent is obtained by the weighting fusion. Simulation with seven agents is shown to evaluate the effectiveness of the proposed algorithm.

Parallel Construction Heuristic Combined with Constraint Propagation for the Car Sequencing Problem

For the car sequencing（CS） problem, the draw-backs of the ＂sliding windows＂ technique used in the objective function have not been rectified, and no high quality initial solution has been acquired to accelerate the improvement of the solution quality. Firstly, the objective function is improved to solve the double and bias counting of violations broadly discussed. Then, a new method combining heuristic with constraint propagation is proposed which constructs initial solutions under a parallel framework. Based on constraint propagation, three filtering rules are designed to intersecting with three greedy functions, so the variable domain is narrowed in the process of the construction. The parallel framework is served to show its robustness in terms of the quality of the solution since it greatly increases the performance of obtaining the best solution. In the computational experiments, 109 instances of 3 sets from the CSPLib＇ s benchmarks are used to test the performance of the proposed method. Experiment results show that the proposed method outperforms others in acquiring the best-known results for 85 best-known results of 109 are obtained with only one construction. The proposed research provides an avenue to remedy the deficiencies of ＂sliding windows＂ technique and construct high quality initial solutions.

Distance geometric constraint filtering algorithm and its application in UWB location

This paper proposed a novel wireless location algorithm based on distance geometry （DG） constraint filtering for the time of arrival （TOA） of the signal （namely as DG-TOA）. Filtering and processing of the observed data and leading to the mathematical formulas based on DG-TOA algorithm are applied to location, also play crucial rules. Simulation results show that the proposed DG-TOA algorithm can provide more valid observation data and be more precise than least square estimate （LSE） algorithm in dense, multi-route, indoor circumstances with the ranging estimation error.

A New Approach to State Estimation for Uncertain Linear Systems in a Moving Horizon Estimation Setting

This paper addresses the state estimation problem for linear systems with additive uncertainties in both the state and output equations using a moving horizon approach. Based on the full information estimation setting and the game-theoretic approach to the H∞filtering, a new optimization-based estimation scheme for uncertain linear systems is proposed, namely the H∞-full information estimator, H∞-FIE in short. In this formulation, the set of processed data grows with time as more measurements are received preventing recursive formulations as in Kalman filtering. To overcome the latter problem, a moving horizon approximation to the H∞-FIE is also presented, the H∞-MHE in short. This moving horizon approximation is achieved since the arrival cost is suitably defined for the proposed scheme. Sufficient conditions for the stability of the H∞-MHE are derived. Simulation results show the benefits of the proposed scheme when compared with two H∞filters and the well-known Kalman filter.