基于DSP的单脉冲焊及双脉冲焊全数字控制系统的研究

设计并实现了脉冲焊电流和弧长的全数字控制，取得了良好的控制性能：电流波形的灵活精确控制和弧长的高速稳定调节。采用变参数数字PI调节器，取得了良好的脉冲电流波控效果，同时在孤长调节中不再应用PI或PID控制器，实现了在全范围内对孤长的快速、稳定调节，满足自动焊、无人干涉焊接的需要。实验结果表明，设计的脉冲焊全数字控制系统取得了一致性好的理想电流波形，在焊矩高度等扰动发生时。孤长可以实现快速、稳定地调节。同时将上述设计应用于双脉冲焊焊铝的设计中，实验证明同样获得了好的控制效果和工艺效果。     

鲁棒的光滑支持向量机

光滑支持向量机(Smooth Support Vector Machine,SSVM)是传统支持向量机的一种改进模型,它利用光滑方法将传统支持向量机的二次规划问题转化成无约束优化问题,并使用Newton-Armijo算法求解该无约束优化问题。在光滑支持向量机的基础上提出了鲁棒的光滑支持向量机(Robust Smooth Support Vector Machine,RSSVM),其利用M-estimator代替SSVM中基于L2范数的正则化项,并利用半二次最小化优化方法求解相应的最优化问题。实验结果表明所提方法可以有效地提高SSVM的抗噪声能力。     

金属带材压力加工中复杂张力控制系统的应用浅析

在轧机作业中,张力控制系统是最重要的结构设备之一。张力控制系统的工作质量金属在很大程度上与带材轧制的平整度、卷紧度、表面光洁度和成品率有直接关系,这对产品的生产具有非常重要的意义。从3个方面着重对金属带材压力加工中复杂张力控制系统的应用途径进行了深入分析,以期为广大同行业者提供参考。     

模糊PID和Hopfield神经网络在矿井通风系统中的应用

针对传统的PID控制或者单一的模糊控制无法准确控制矿井通风系统风量的问题,提出了一种采用模糊PID调节器和Hopfield神经网络调节器对矿井通风机的转速、风门、风量进行控制的方法。该方法利用模糊控制器对PID参数进行实时修正,并结合Hopfield神经网络的联想记忆功能和反馈调节特性,实现矿井通风机风量的快速、稳定输出。仿真与实验结果表明,模糊PID调节器和Hopfield神经网络调节器可以准确控制矿井通风机的转速和风量,实现通风系统的稳定输出。     

基于DSP的数字励磁调节器研究

目前广泛使用的同步发电机数字励磁调节器使用简单的单片机控制,采用PID（比例-积分-微分控制）＋PSS（电力系统稳定器）控制策略,励磁调节器体积大,模块间干扰大,速度低,可靠性差,很难保证产品质量达到标准要求。为了弥补这个不足,采用PID（比例-积分-微分控制）＋PSS（电力系统稳定器）＋NOEC（非线性最优励磁控制）综合控制策略,把DSP（TMS320F2812）用于同步发电机数字励磁调节器中,具有通用性强、结构简单的特点,同时可以实现优良的控制效果。     

Null controllability with vanishing energy for discrete-time systems

In this paper null controllability with vanishing energy for discrete-time systems is considered. As in the case of continuous time systems necessary and sufficient conditions in terms of an algebraic Riccati equation are given. Then necessary and sufficient conditions involving the eigenvalues of the state matrix are given. Reachability and controllability with vanishing energy are also considered and necessary and sufficient conditions for them are given. Finally applications to sampled-data systems, systems with impulse control and periodic systems are discussed.     

Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game

This work considers non-terminating scheduling problems in which a system of multiple resources serves clients having variable needs. The system has m identical resources and n clients; in each time slot each resource may serve at most one client; in each such slot t each client γ has a rate, a real number ρ _γ (t), that specifies his needs in this slot. The rates satisfy the restriction ∑ _γ ρ _γ (t)≤m for any slot t. Except of this restriction, the rates can vary in arbitrary fashion. (This contrasts most prior works in this area in which the rates of the clients are constant.) The schedule is required to be smooth as follows: a schedule is Δ -smooth if for all time intervals I the absolute difference between the amount of service received by each client γ to his nominal needs of ∑ _t∈I ρ _γ (t) is less than Δ. Our objective are online schedulers that produce Δ-smooth schedules where Δ is a small constant which is independent of m and n. Our paper constructs such schedulers; these are the first online Δ-smooth schedulers, with a constant Δ, for clients with arbitrarily variable rates in a single or multiple resource system. Furthermore, the paper also considers a non-concurrent environment in which there is an additional restriction that each client is served at most once in each time slot; it presents the first online smooth schedulers for variable rates under this restriction. The above non-concurrent restriction is crucial in some applications (e.g., CPU scheduling). It has been pointed out that this restriction “adds a surprising amount of difficulty” to the scheduling problem. However, this observation was never formalized and, of course, was never proved. Our paper formalizes and proves some aspects of this observation. Another contribution of this paper is the introduction of a complete information, two player game called the analog-digital confinement game. In such a game pebbles are located on the real line; the two players, the analog player and the digital player, take alternating turns and each one, in his turn, moves some of the pebbles; the digital player moves the pebbles backwards by discrete distances while the analog player moves the pebbles forward by analog distances; the aim of the analog player is to cause one pebble (or more) to escape a pre-defined real interval while the aim of the digital player is to confine the pebbles into the interval. We demonstrate that this game is a convenient framework to study the general question of how to approximate an analog process by a digital one. All the above scheduling results are established via this game. In this derivation, the pebbles represent the clients, the analog player generates the needs of the clients and the digital player generates the schedule. Dedicated to the memory of Professor Shimon Even for his inspiration and encouragement     

模糊遗传算法在电极调节系统中的应用

分析了电弧炉电极调节系统的特点,并在此基础上设计了模糊PID控制器。为了避免模糊控制器设计的盲目性,提高模糊控制器性能,引入了遗传算法,对模糊PID的隶属函数进行优化,改善了控制效果。     

换热站自动监控系统的设计

针对换热站运行中存在的弊端,提出并设计了一种监控系统,实时检测温度、压力、流量等参数,对用户室内温度进行自动控制,既保证了室内温度的舒适性,又避免了能源的巨大浪费。