Robust actuator fault isolation and management in constrained uncertain parabolic PDE systems

This paper presents a methodology for the design of an integrated robust fault detection and isolation (FDI) and fault-tolerant control (FTC) architecture for distributed parameter systems modeled by nonlinear parabolic Partial Differential Equations (PDEs) with time-varying uncertain variables, actuator constraints and faults. The design is based on an approximate finite-dimensional system that captures the dominant dynamics of the PDE system. Initially, an invertible coordinate transformation-obtained through judicious actuator placement-is used to transform the approximate system into a form where the evolution of each state is excited directly by only one actuator. For each state, a robustly stabilizing bounded feedback controller that achieves an arbitrary degree of asymptotic attenuation of the effect of uncertainty is then synthesized and its constrained stability region is explicitly characterized in terms of the constraints, the actuator locations and the size of the uncertainty. A key idea in the controller synthesis is to shape the fault-free closed-loop response of each state in a prescribed fashion that facilitates the derivation of (1) dedicated FDI residuals and thresholds for each actuator, and (2) an explicit characterization of the state-space regions where FDI can be performed under uncertainty and constraints. A switching law is then derived to orchestrate actuator reconfiguration in a way that preserves robust closed-loop stability following FDI. Precise FDI rules and control reconfiguration criteria that account for model reduction errors are derived for the implementation of the FDI-FTC structure on the distributed parameter system. Finally, the results are demonstrated using a tubular reactor example.     

Model predictive control for systems with stochastic multiplicative uncertainty and probabilistic constraints

Robust predictive control handles constrained systems that are subject to stochastic uncertainty but propagating the effects of uncertainty over a prediction horizon can be computationally expensive and conservative. This paper overcomes these issues through an augmented autonomous prediction formulation, and provides a method of handling probabilistic constraints and ensuring closed loop stability through the use of an extension of the concept of invariance, namely invariance with probability p.     

Retrieval of microphysical and optical properties in aerosol plumes with hyperspectral imagery: L-APOM method

This paper presents the retrieval method L-APOM which aims at characterizing the microphysical and optical properties of aerosol plumes from hyperspectral images with high spatial resolution. The inversion process is divided into three steps: estimation of the ground reflectance below the plume, characterization of the standard atmosphere (gases and background aerosols) and estimation of the plume aerosols properties. As using spectral information only is not sufficient to insure uniqueness of solutions, original constraints are added by assuming slow spatial variations of particles properties within the plume. The whole inversion process is validated on a large set of simulated images and reveals to remain accurate even in the worst cases of noise: relative estimation errors of aerosol properties remain between 10% and 20% in most cases. L-APOM is applied on a real AVIRIS hyperspectral image of a biomass burning plume for which in situ measurements are available. Retrieved properties appear globally consistent with measurements.     

Computing the null space of finite element problems

We present a method for computing the null space of finite element models, including models with equality constraints. The method is purely algebraic; it requires access to the element matrices, but not to the geometry or material properties of the model.Theoretical considerations show that under certain conditions, both the amount of computation and the amount of memory required by our method scale linearly with model size; memory scales linearly but computation scales quadratically with the dimension of the null space. Our experiments confirm this: the method scales extremely well on 3-dimensional model problems. In general, large industrial models do not satisfy all the conditions that the theoretical results assume; however, experimentally the method performs well and outperforms an established method on industrial models, including models with many equality constraints.The accuracy of the computed null vectors is acceptable, but the method is usually less accurate than a more naive (and computationally much more expensive) method.     

Dynamic harmonic fields for surface processing

Harmonic fields have been shown to provide effective guidance for a number of geometry processing problems. In this paper, we propose a method for fast updating of harmonic fields defined on polygonal meshes, enabling real-time insertion and deletion of constraints. Our approach utilizes the penalty method to enforce constraints in harmonic field computation. It maintains the symmetry of the Laplacian system and takes advantage of fast multi-rank updating and downdating of Cholesky factorization, achieving both speed and numerical stability. We demonstrate how the interactivity induced by fast harmonic field update can be utilized in several applications, including harmonic-guided quadrilateral remeshing, vector field design, interactive geometric detail modeling, and handle-driven shape editing and animation transfer with a dynamic handle set.     

Adaptive neural control for an uncertain robotic manipulator with joint space constraints

In this paper, adaptive neural tracking control is proposed for a robotic manipulator with uncertainties in both manipulator dynamics and joint actuator dynamics. The manipulator joints are subject to inequality constraints, i.e., the joint angles are required to remain in some compact sets. Integral barrier Lyapunov functionals (iBLFs) are employed to address the joint space constraints directly without performing an additional mapping to the error space. Neural networks (NNs) are utilised to compensate for the unknown robot dynamics and external force. Adapting parameters are developed to estimate the unknown bounds on NN approximations. By the Lyapunov synthesis, the proposed control can guarantee the semi-global uniform ultimate boundedness of the closed-loop system, and the practical tracking of joint reference trajectory is achieved without the violation of predefined joint space constraints. Simulation results are given to validate the effectiveness of the proposed control scheme.     

Region with velocity constraints: map information and its usage for safe motion planning of a mobile robot in a public environment

Recently, various autonomous mobile robots have been developed for practical use. To support the coexistence of robots and humans in real environments, we propose a concept named ‘Region with Velocity Constraints (RVC),’ which is set around hazardous areas. RVCs are regions where the velocities of the robot are constrained to predefined values. Inside the RVCs, the robot has to reduce its translational velocity to avoid predicted hazards such as collisions with obstacles, and to reduce its rotational velocity to prevent undesirable motions such as sharp turns. We also propose a motion planning method for navigating the mobile robot in an environment with RVCs based on the Navigation Function and Global Dynamic Window Approach. Our method generates a trajectory satisfying both translational and rotational velocity constraints to be compatible with the surroundings. Moreover, to demonstrate the validity of our method, we performed numerical simulations and experiments.     

一种基于同类约束的半监督近邻反射传播聚类方法

以近邻反射传播 (Affinity propagation, AP) 聚类算法为基础, 提出了一种基于同类约束的半监督近邻反射传播聚类方法 (Semi-supervised affinity propagation clustering method with homogeneity constraints, HCSAP).该方法在聚类目标函数中引入同类约束项, 以保证聚类结果与同类集先验信息一致.利用最大和信任传播 (Max-sum belief propagation) 优化过程对目标函数进行求解, 导出同类约束下的吸引度 (Responsibility) 和归属度 (Availability) 的迭代方程.人工数据集和真实数据集上的实验结果表明本文所提方法的有效性.