一种多维连续型动态规划的新算法

在求解一维连续型动态规划问题的自创算法一离散近似迭代法的基础上,结合双收敛方法,对多维连续型动态规划问题进行计算．该算法的基本思路为：在给定其他状态向量序列的基础上,每次对一个状态变量序列进行离散近似迭代,并找出该状态变量的最优序列,直到所有状态向量序列都检查完,当模型为非凸非凹动态规划时,证明了该算法的收敛性;当模型为凸动态规划时,证明了该算法的线性收敛性,最后,通过具体算例验证了该模型和算法的有效性．     

随机拓扑结构下多智能体系统的平均一致性*

利用马尔可夫收敛准则、图的Laplace矩阵谱特性和欧氏度量的极值,对一类具有随机拓扑结构的离散时间多智能体系统平均一致性问题进行了深入讨论。引入完好概率矩阵的概念,建立随机拓扑结构下离散时间系统的一致性算法,应用马尔可夫过程收敛相关结论及伴随算子,从欧氏度量极值的角度证明了系统可达到渐近平均一致,并得出了所需满足的条件,该条件放宽了对系统连通性的要求。最后,采用六个智能体组成的多智能体系统进行计算机仿真,对理论的正确性进行了验证。     

伪多跳中继分布式一致性算法

为了提高分布式一致性问题的收敛速度, 减少节点间的通信成本, 本文提出一种分布式一致性算法. 新算法采用单跳通信, 利用非邻接节点的前状态信息进行节点状态更新. 本文证明了在无向通信拓扑下新算法的一致性收敛, 并分析计算了新算法的通信量以及收敛速度的变化. 通过理论分析和仿真验证, 结果表明新算法具有收敛速度快, 通信方式简单, 通信量少, 存在通信延时情况下通信数据不容易丢失等优点.     

线性广义系统的最优和鲁棒满阶平滑器

对于线性离散随机广义系统,利用增广状态方法将平滑器问题转化为增广状态的滤波器问题.基于极大似然线性估计准则,提出了最优的满阶平滑器,其中增广状态滤波器的误差方差阵满足广义Riccati方程.当线性离散广义系统的过程噪声和观测噪声的方差不确定时,基于极大极小鲁棒设计原理和最优满阶平滑算法,得到了鲁棒满阶平滑器.应用动态误差方差分析方法证明了其鲁棒性,即鲁棒平滑误差方差阵存在一个上界方差矩阵.数值仿真例子验证了其有效性和正确性.     

二元进化策略的全局收敛与早熟收敛

离散状态马尔科夫链理论已经广泛应用于进化算法的收敛性和时间复杂度分析中,而连续状态马尔科夫过程理论由于需要用到比较高深的数学工具,应用还不多.引入连续状态马尔科夫过程理论,以测度论为工具,借助公理化的条件数学期望理论推导出关键的转移概率的计算公式,分析了以(1+1)ES为代表的连续型进化算法的收敛性,从理论上证明若采用常变异算子,包括正态分布、柯西分布在内的一大类常用变异分布可使(1+1)ES依概率收敛到全局最优解的ε-邻域;构造了一个带适应值平台的函数,从理论上证明某些自适应变异算子即使以正态分布、柯西分布为变异分布也会导致(1+1)ES陷入早熟收敛.通过仿真实验验证了理论分析.结果表明自适应调整机制并非总是有效的.     

离散时滞系统的最优滑模控制

针对离散线性时滞系统,设计了最优滑模面和最优离散变结构控制律.在设计最优滑模面的过程中,利用逐次逼近算法,将既含有时滞项又含有超前项的两点边值问题转化为不含时滞项和超前项的线性两点边值问题,并证明了其解序列一致收敛于原系统的最优滑模.进一步给出了原系统的变结构控制律.     

基于连续时间的二阶多智能体分布式资源分配算法

针对二阶多智能体系统中的分布式资源分配问题, 本文设计两种连续时间算法. 基于KKT (Karush?Kuhn?Tucker, 卡罗需?库恩?塔克)优化条件, 第一种控制算法利用节点局部不等式及其梯度信息来约束节点状态. 与上述梯度方法不同, 第二种控制算法包括一致性梯度下降法和固定时间收敛映射算子, 其中固定时间收敛映射算子确保算法的节点状态在固定时间收敛到局部约束集, 一致性梯度下降法目的是确保节点迭代到资源分配问题最优解. 两种控制算法都对状态无初始值约束, 且控制参数都是常数. 利用凸优化理论和固定时间李雅普诺夫方法, 分别分析了上述控制策略在有向平衡网络条件下的渐近和指数收敛性. 最后通过数值仿真验证了所设计算法在一维和高维资源分配问题的有效性.     

离散高阶分布式一致性算法

为了提高分布式一致性算法的收敛速度, 提出了一种离散高阶分布式一致性算法。该算法通过单跳通信, 利用二跳邻接节点的前多步信息来加速分布式一致性算法的收敛速度。对无向通信拓扑下该算法的收敛性能和收敛速度, 以及带通信延时的该算法的收敛性能进行了分析和仿真比较, 结果显示, 该算法在满足条件下能收敛到初始状态的平均值, 与同样利用二跳邻接节点信息的算法相比, 具有通信量小, 收敛速度更快的特点, 但是能容忍的通信延时变小。     

改进的模糊推理规则图像边缘检测算法

图像边缘检测是数字图像处理领域的关键技术,边缘检测的结果决定了图像后续处理的质量。模糊推理规则边缘检测算法具有较强的边缘检测能力,并且具备一定的抗噪效果。但是,这种算法只在高斯噪声较小时有效,当高斯噪声较大时它的边缘检测效果甚至比Canny等算子的效果还差。针对模糊推理规则算法在强高斯噪声时效果较差的问题,提出一种改进的模糊边缘检测算法。该算法能够根据图像含噪情况调整边缘检测方案：当噪声较弱时,使用模糊推理规则边缘检测算法;当噪声较强时,为提高算法抑制噪声的能力,使用改进的模糊推理规则边缘检测算法。实验结果表明,该方法具有更好的抗噪性能和边缘检测能力。     

基于Priwitt算子的偏微分方程图像去噪模型

利用归一化的Priwitt微分算子作为权重,提出了两种融合Gauss曲率和平均曲率扩散的偏微分方程去噪模型,使得它们在去除噪声的同时能保持图像的重要特征。首先,对噪声图像进行Gauss滤波并计算滤波后图像的Priwitt微分算子;然后,新模型根据归一化的Priwitt微分算子自适应地平衡于高斯曲率扩散去噪与平均曲率扩散去噪之间,从而去除图像的噪声。利用偏微分方程有限差分法给出了新模型的离散迭代格式,并进行了数值实验。实验结果表明,新模型不仅迭代收敛的速度快,而且在均方误差和峰值信噪比两个评价指标上均优于单一曲率扩散去噪模型,并更好地保持了图像的细节特征。     

Analytic numerical solution of coupled semi-infinite diffusion problems

In this paper, we consider coupled semi-infinite diffusion problems of the form u_t(x, t)− A² u_xx(x,t) = 0, x> 0, t> 0, subject to u(0,t)=B and u(x,0)=0, where A is a matrix in , and u(x,t), and B are vectors in . Using the Fourier sine transform, an explicit exact solution of the problem is proposed. Given an admissible error and a domain D(x₀,t₀)={(x,t);0≤x≤x₀, t≥t₀ > 0, an analytic approximate solution is constructed so that the error with respect to the exact solution is uniformly upper bounded by in D(x₀, t₀).     

Nonlinear robust stabilization of multi-parameter families of systems

We show that given any family of asymptotically stabilizable LTI systems depending continuously on a parameter that lies in some subset [a₁,b₁]××[a_p,b_p] of , there exists a C⁰ time-varying state feedback law v(t,x) (resp. a C⁰ time-invariant feedback law v(x)) which robustly globally exponentially stabilizes (resp. which robustly stabilizes, not asymptotically) the family. Further, if these systems are obtained by linearizing some nonlinear systems, then v(t,x) locally exponentially stabilizes these nonlinear systems. Finally, v(t,x) globally exponentially stabilizes any time-varying system which switches “slowly enough” between the given LTI systems.     

基于θ算子的变精度直觉模糊粗糙集*

在模糊近似空间中,结合直觉模糊集的隶属度、非隶属度与模糊蕴涵算子,提出基于θ算子和θ^算子的直觉模糊集及其隶属度和非隶属度的概念,并证明它们一系列性质.然后,结合直觉模糊集与变精度粗糙集,定义基于θ算子的变精度直觉模糊粗糙集,提出求解变精度粗糙集阈值参数β的方法,使用算例分析该方法.     

Analytic-numerical solutions with a priori error bounds for time-dependent mixed partial differential problems

The aim of this paper is double. First, we point out that the hypothesis D(t₁)D(t₂) = D(t₂)D(t₁) imposed in [1] can be removed. Second, a constructive method for obtaining analytic-numerical solutions with a prefixed accuracy in a bounded domain Ω(t₀,t₁) = [0,p] × [t₀,t₁], for mixed problems of the type u_t(x,t) − D(t)u_xx(x,t) = 0, 0 < x < p, t> 0, subject to u(0,t) = u(p,t) = 0 and u(x,0) = F(x) is proposed. Here, u(x,t) and F(x) are r-component vectors, D(t) is a C^{r × r} valued analytic function and there exists a positive number δ such that every eigenvalue z of (1/2) (D(t) + D(t)^H) is bigger than δ. An illustrative example is included.     

Input constrained funnel control with applications to chemical reactor models

Error feedback control (in the presence of input constraints) is considered for a class of exothermic chemical reactor models. The primary control objective is regulation of a setpoint temperature T^* with prescribed accuracy: given λ>0 (arbitrarily small), ensure that, for every admissible system and reference setpoint, the regulation error e=T−T^* is ultimately smaller than λ (that is, ||e(t)||<λ for all t sufficiently large). The second objective is guaranteed transient performance: the evolution of the regulation error should be contained in a prescribed performance funnel F around the setpoint temperature T^*. A simple error feedback control with input constraints of the form

Full-size image

, u^* an offset, is introduced which achieves the objective in the presence of disturbances corrupting the measurement. The gain k(t) is a function of the error e(t)=T(t)−T^* and its distance to the funnel boundary. The input constraints have to satisfy certain feasibility assumptions in terms of the model data and the operating point T^*.     

Tight bounds on the complexity index of one-point iterations

We study the minimal complexity index of one-point iterations without memory for the solution of a system of N nonlinear equations F(x)=0. We present an iteration ^* with maximal order of convergence and with linear combinatory complexity. We show the complexity index of ^* is close to the lower bound on the minimal complexity index.     

Optimal and nearly optimal algorithms for approximating polynomial zeros

We substantially improve the known algorithms for approximating all the complex zeros of an n^th degree polynomial p(x). Our new algorithms save both Boolean and arithmetic sequential time, versus the previous best algorithms of Schönhage [1], Pan [2], and Neff and Reif [3]. In parallel (NC) implementation, we dramatically decrease the number of processors, versus the parallel algorithm of Neff [4], which was the only NC algorithm known for this problem so far. Specifically, under the simple normalization assumption that the variable x has been scaled so as to confine the zeros of p(x) to the unit disc x : |x| ≤ 1, our algorithms (which promise to be practically effective) approximate all the zeros of p(x) within the absolute error bound 2^−b, by using order of n arithmetic operations and order of (b + n)n² Boolean (bitwise) operations (in both cases up to within polylogarithmic factors). The algorithms allow their optimal (work preserving) NC parallelization, so that they can be implemented by using polylogarithmic time and the orders of n arithmetic processors or (b + n)n² Boolean processors. All the cited bounds on the computational complexity are within polylogarithmic factors from the optimum (in terms of n and b) under both arithmetic and Boolean models of computation (in the Boolean case, under the additional (realistic) assumption that n = O(b)).     

Nonnegative solutions of singular boundary value problems with sign changing nonlinearities

The paper presents sufficient conditions for the existence of positive solutions of the equation x″(t) + q(t)f(t,x(t),x′(t)) = 0 with the Dirichlet conditions x(0) = 0, x(1) = 0 and of the equation (p(t)x′(t))′ + p(t)q(t)f(t,x(t),p(t)x′(t)) = 0 with the boundary conditions lim_t→o⁺ p(t)x′(t) = 0, x(1) = 0. Our nonlinearity f is allowed to change sign and f may be singular at x = 0. The proofs are based on a combination of the regularity and sequential techniques and the method of lower and upper functions.     

A method for adaptive estimation of ARMA processes

When the noise process in adaptive identification of linear stochastic systems is correlated, and can be represented by a moving average model, extended least squares algorithms are commonly used, and converge under a strictly positive real (SPR) condition on the noise model. In this paper, we present an adaptive algorithm for the estimation of autoregressive moving average (ARMA) processes, and show that it is convergent without any SPR condition, and has a convergence rate of O({loglog t)/t}^1/2).     

Inferring evolutionary trees with strong combinatorial evidence

We consider the problem of inferring the evolutionary tree of a set of n species. We propose a quartet reconstruction method which specifically produces trees whose edges have strong combinatorial evidence. Let Q be a set of resolved quartets defined on the studied species, the method computes the unique maximum subset Q^* of Q which is equivalent to a tree and outputs the corresponding tree as an estimate of the species’ phylogeny. We use a characterization of the subset Q^* due to Bandelt and Dress (Adv. Appl. Math. 7 (1986) 309–343) to provide an O(n⁴) incremental algorithm for this variant of the NP-hard quartet consistency problem. Moreover, when chosing the resolution of the quartets by the four-point method (FPM) and considering the Cavender–Farris model of evolution, we show that the convergence rate of the Q^* method is at worst polynomial when the maximum evolutive distance between two species is bounded. We complete these theoretical results by an experimental study on real and simulated data sets. The results show that (i) as expected, the strong combinatorial constraints it imposes on each edge leads the Q^* method to propose very few incorrect edges; (ii) more surprisingly; the method infers trees with a relatively high degree of resolution.