Stability analysis of generalized predictive control based on Kleinman's controllers

Modelpredictivecontrol(MPC)hasbeenwidelystudiedbecauseofitsapplicabil-itytoindustrialprocesses.TheoriginalformulationofMPCdoesnotguaranteeclosed-loopstabilitybecauseitusesfinitehorizonoptimization.Theexplicitrelationshipbetweentheclosed-loopstabilityandthetuningparametersisdifficulttofindevenforunconstrainedlinearsystems,asthesetuningparametersarehiddenintheclosed-loopcharacteristicpolynomial[1].Afterthe1990s,aseriesofnew-styleMPCswithguaran-teedstability,suchasMPCwithterminalequalitycons…     

Mapping Between 2-D Meshes of the Same Size

1IntroductionInrece11tyears,n1a11yparallelalgoritlImshavebeendesignedtosolvedifferentproblemso1lvario1ls11etworktopologics.Bi11arytrees,meshesandhypercubesarethethreeimportal1tl1etworktop()logieswllicllhaterpcoivedintensivestlldy.WiththeadvanceofVLSI,manyllewl1etworkssuchasstargrapl1[1]havebeenorwiIlbeintroduced.Inor相似文献   

An Efficient Computational Method for Solving Nonlinear Matrix Equation and Its Application in Queuing Analysis

1IntroductionTheBMAP(BatchMarkovianArrivalProcess)hasbeenstudiedbyD.M.Lu..nt..il1].ResultsforqueueswithSM(Semi-Markov)serviceshavebeenobtainedbyM.F.Neutsl2l.VaCationqueuesaresurveyedbyb.th[a].AmoregeneralqueueBMAP/SM/1whichcom-binedthesetlireeaspectsisstudiedin[4].Discretequeueisexploredin[5].ThebasisofforegoinganalysesisthatthereexistanembeddedMarkovchainatspecificobservinginstants.HerewegiveanewfastalgorithmforthesolutionofabovegeneralqueueswhichpossesssuchanembeddedMarkovchain.…     

Situated Learning of a Behavior-Based Mobile Robot Path Planner

1TaskDecompositionWebuildourpathplannerbaJsedonBrook'ssubsumptionarchitecturel1].InBrook'sapproach,theoveralltaskisdecomposedilltoseveralconcurrelitbehaviors,eachbehaviorhasitsownaPplicabilityconditionsspecifyingwhenitisappropriate,andapriorityorderingispresdefinedtoresolveconflictsamongbehaviors.Inpathplannillg,thetaskoftherobotistoaPproachatargetwhileavoidingobstacles.Wedecomposethetaskintothreebehaviors.TheyaJreAvoid,SteerandAdvance.Fig.1illustratestheoverallstructureofourpathplanner.…     

An Algorithm for Determining Minimal Reduced-Coverings of Acyclic Database Schemes

1IntroductionItiswell-knownthatacyclicdatabaseschemeshavesomeverydesirablepr0P-erties-Thesepr0pertie8areappliedwidelyinb0thdesignandmanagement0fdatabases[1'3].Atpresent,therearemanyresultsab0utacyclicdatabaseschemesI1-4'7].Animp0rtantbranchoftheseresultsisthepr0blemofminimalcovers.Veryoften,inbothdesignandmanagementofdatabase,0nlyaset0fpartialrelationorsets0fattributeswithsomespecia.lproperties0fadatabaseschemeareconcerned.Applications0fthesesortsleadtothestudy0fmanyproblemsab0ut..lnummumand…     

Wavelet-Based Data Reduction of B-Spline Curves

1 Introduction The problem of reducing the amount of data in the representation of a function or a curve is not new. Many papers have already been published. In these strategies, two trends can be emphasized[1]. The first one deals with polygonal curves for approximating data[2],[3]. Another approach is based on spline curves[4]~[8]. In the first approach, the problem is formulated so that the perpendicular distance of each point on the curve to the fitted line segments is within a predefined…     

On k-Positive Satisfiability Problem

1IntroductionThesatisfiabilityproblem(SAT)isthedecisionproblemwhetheragivenpropositionalformulainconjunctivenormalform(CNF)couldbesatisfiedbyanyassignmenttotheatoms.ItiswellknownthatSATisNP-complete[1].SounderthehypothesisthatP/NP,thereisnopolynomialtimealgorithmforsolvingSAT121.Letk-SATbethesubproblemrestrictingtheclausesnotlongerthank.Thenk-SATisNP-completefork23['],andislineartimesolvablefork<213'4].Thefirstnontrivialupperboundontimecomplexityofk--SAT(k23)wasgivenin[5].Thereaki…     

Exponential stabilization of networked control systems and design of switching controller

1 Introduction Networked control systems (NCS) are feedback control systems whose feedback paths are implemented by a real- time network. This type of systems has advantages of more ?exibility with respect to traditional control systems. It also allows for reduced wiring, as well as a lower installation cost. Examples of such systems can be seen in remote sur- vey [1], telerobotics [2], unmanned aerial vehicles [3] and remote control laboratory [4,5]. Most of the times, sensors will transmit…     

Use of Quality Control Circles-A Fad or Need

1 Background The subject of management fads is well covered in the literature with typical definitions: (1) It is normally a new idea. (2) It is developed in a vague and previously undefined area. (3) It is about what its users are initially enthusiastic about, even though they can quickly lose interest in it [1]. Van der Wiele[2] explores many characteristics of fads, pointing out that; (1) Fads can develop in an area of activity, which is not well defined. (2) Most fads are not really new …     

The essential order of approximation for nearly exponential type neural networks

1 Introduction Artificial neural networks have been extensively applied in various fields of science and engineering. Why is so is mainly because the feedforward neural networks (FNNs) have the universal approximation capability[1-9]. A typical example of…     

K-Dimensional Optimal Parallel Algorithm for the Solution of a General Class of Recurrence Equations

This paper proposes a parallel algorithm,called KDOP (K-Dimensional Optimal Parallel algorithm),to solve a general class of recurrence equations efficiently.The KDOP algorithm partitions the computation into a series of subcomputations,each of which is executed in the fashion that all the processors work simultaneously with each one executing an optimal sequential algorithm to solve a subcomputation task.The algorithm solves the equations in O(N/P) steps in EREW PRAM model (Exclusive Read Exclusive Write Parallel Random Access Machine model) using p≤N^1-∈ processors,where N is the size of the problem,and ∈ is a given constant.This is an optimal algorithm (its sepeedup is O(p)) in the case of p≤N^1-∈.Such an optimal speedup for this problem was previously achieved only in the case of p≤N^0.5.The algorithm can be implemented on machines with multiple processing elements or pipelined vector machines with parallel memory systems.     

基于流水光总线阵列上的快速可扩展并行排序算法

在Y．Pan提出的基于流水光总线阵列模型(LARPBS)上使用N个处理器对N个元素进行排序在最好情况下以O(logN)时间，最坏情况下以O(N)时间完成的并行排序算法的基础上，提出了一种LARPBS模型上的可扩展的快速并行排序算法，对N个元素进行排序，使用p(1≤P≤N)个处理器在最好情况下以O(NlogN／p)时间，最坏情况下以O(N^2／p)时间完成排序。另外还提出了一种LARPBS模型上改进的快速高效并行排序算法，该算法对N个元素进行排序使用N个处理器在最好情况下以O(log√N)时间、最坏情况下以O(√N)时间完成排序。     

Pyramidal thinning algorithm for SIMD parallel machines

We propose a parallel thinning algorithm for binary pictures. Given an N × N binary image including an object, our algorithm computes in O(N²) the skeleton of the object, using a pyramidal decomposition of the picture. The behavior of this algorithm is studied considering a family of digitalization of the same object at a different level of resolution. With the Exclusive Read Exclusive Write (EREW) Parallel Random Access Machine (PRAM), our algorithm runs in O(log N) time using O(N²/logN) processors and it is work-optimal. The same result is obtained with high-connectivity distributed memory SIMD machines having strong hypercube and pyramid. We describe the basic operator, the pyramidal algorithm and some experimental results on the SIMD MasPar parallel machine.     

一种优化的并行汉字／字符串匹配算法

字符串检索指在一个文本Text=t1…tn中找出一个字符串Pat=p1…pm的所有出现。本文给出了在CREW/CRCW PRAM机器模型上并行检索汉字/字符串的算法, 它使用n/m。个处理机, 预处理时间为O(m+|∑|, 并行执行时间为O(m)。     

Multiway merging in parallel

The problem of merging k (k⩾2) sorted lists is considered. We give an optimal parallel algorithm which takes O((n log k/p)+log n) time using p processors on a parallel random access machine that allows concurrent reads and exclusive writes, where n is the total size of the input lists. This algorithm achieves O(log n) time using p=n log k/log n processors. Most of the previous log n research for this problem has been focused on the case when k=2. Very recently, parallel solutions for the case when k=2 have been reported. Our solution is the first logarithmic time optimal parallel algorithm for the problem when k⩾2. It can also be seen as a unified optimal parallel algorithm for sorting and merging. In order to support the algorithm, a new processor assignment strategy is also presented     

背包问题的最优并行算法

利用分治策略,提出一种基于SIMD共享存储计算机模型的并行背包问题求解算法.算法允许使用O(2^n/4)^1-ε个并行处理机单元,0≤ε≤1,O(2^n/2)个存储单元,在O(2^n/4(2^n/4)^ε)时间内求解n维背包问题,算法的成本为O(2^n/2).将提出的算法与已有文献结论进行对比表明,该算法改进了已有文献的相应结果,是求解背包问题的成本最优并行算法.同时还指出了相关文献主要结论的错误.     

块三对角线性方程组的一种有效并行算法

提出了求解系数矩阵为块三对角的线性方程组的一种适合于MIMD分布式存储的并行算法，该算法以系数矩阵分解为基础，充分利用了系数矩阵结构的特殊性，进行了近似处理，使整个计算过程只在相邻处理机间通信两次，具有很高的并行效率，并在理论上给出了该算法成立的充分条件。最后，在HPrx2600集群上进行数值试验，结果表明，加速比呈线性增加，并行效率达到90％以上。     

货郎担问题最优并行启发式算法

本文给出了满足三角不等式的货郎担问题的并行启发式算法，在ＳＩＭＤ ＣＲＥＶ ＰＲＡＭ并行机上该算法使用Ｏ（ｎ＾３／ｌｏｇ＾２ｎ）台处理器需Ｏ熄ｌｏｇ＾２ｎ）时间，这里ｎ是给定城市的个数，因而该并行算法是最优的。     

Fast parallel algorithm for distance transform

We present an O((log log N)/sup 2/) -time algorithm for computing the distance transform of an N /spl times/ N binary image. Our algorithm is designed for the common concurrent read concurrent write parallel random access machine (CRCW PRAM) and requires O(N/sup 2+/spl epsi///log log N) processors, for any /spl epsi/ such that 0 < /spl epsi/ < 1. Our algorithm is based on a novel deterministic sampling scheme and can be used for computing distance transforms for a very general class of distance functions. We also present a scalable version of our algorithm when the number of processors is available p/sup 2+/spl epsi///log log p for some p < N. In this case, our algorithm runs in O((N/sup 2//p/sup 2/)+(N/p) log log p + (log log p)/sup 2/) time. This scalable algorithm is more practical since usually the number of available processors is much less than the size of the image.     

解模糊交货期多机并行调度问题的改进量子遗传算法

在结合遗传算法和量子理论的基础上,提出了一种改进的量子遗传算法（IQGA）求解模糊交货期多机并行调度问题。采用量子比特相位比较法更新量子位,以加快搜索的速度和效率;采用求反解码操作,以扩大种群规模。通过仿真验证,改进的量子遗传算法在求解模糊交货期多机并行调度问题时有较好的寻优能力。