极值搜索算法,extremum seeking algorithm
1)extremum seeking algorithm极值搜索算法
1.Research and development ofextremum seeking algorithm;极值搜索算法的研究与进展
2.An annealing recurrent neural network forextremum seeking algorithm and its application to unmanned aerial vehicle tight formation flight;退火递归神经网络极值搜索算法及其在无人机紧密编队飞行控制中的应用
3.The paper proposes anextremum seeking algorithm with parameter-varying sliding mode to improve convergence speed and control accuracy of the system, and analyses two parameter-varying methods.针对滑模极值搜索算法中系统在提高控制精度与收敛速度之间存在相互制约的问题, 提出了变参数滑模极值搜索算法,分析了两种变参数的形式,通过仿真对比,说明变参数滑模极值搜索算法能同时兼顾系统的收敛速度和控制精度。
英文短句/例句
1.Integrated design of controller and extremum seeking algorithm with sliding mode滑模极值搜索算法与控制器的一体化设计
2.A Novel Extremum Seeking Algorithm and Its Application to Active Control of Combustion in Aeroengines一种新的极值搜索算法及其在航空发动机燃烧主动控制中的应用
3.Research on Extremum Seeking Algorithm Based on Chaotic Annealing Recurrent Neural Network with Parameter Disturbances and Its Application基于混沌退火的参数扰动递归神经网络极值搜索算法及其应用研究
4.A Breadth-first-search Algorithm for Deriving Minimal Unsatisfiable Subformulae in Satisfiability Modulo Theories求解极小SMT不可满足子式的宽度优先搜索算法
5.By translating a geometric constraint problem into an optimization problem, the global optimum of a multi-variation function was sought for and the local traps were ignored by using chaos method in the algorithm.将约束求解问题转化为优化问题,并对多变量函数求全局极值,用混沌算法跳过局部搜索陷阱.
6.Local Search Algorithm for Solving Maximizing Submodular Set Function;求解下模集函数最大值问题的局部搜索算法
7.Web Search Algorithm Based on Degree and Weighted Ratio基于节点度和边权值比率的网络搜索算法
8.Improved Quantum Algorithm for Finding the Minimum of Database一种改进搜索无序数据库最小值的量子算法
9.The Application of Grover"s Algorithm in Finding Minimum in an Unsorted DatabaseGrover量子算法在搜索无序数据库最小值中的应用
10.algorithm for graph-search control strategy图搜索控制策略的算法
11.Extenics Researches and Applications on the Extrema of AI - Searches;智能搜索的极值的可拓性研究与应用
12.The all-time apparent resistivity bisearch numerical algorithm based on long offset transient electromagnetic method长偏移距瞬变电磁法全区视电阻率的二分搜索数值算法
13.Search Engineer: Researching the Resource Search Arithmetic about FTP and Others Protocol;搜索引擎FTP及其它协议资源的搜索算法研究
14.The Research of Domain-Oriented Search Engine Model Based on Meta-Search Scheduling;基于元搜索调度算法的领域搜索模型研究
15.A Search Algorithm Design Based on the Collection Model Oriented Search Engine一种面向搜索引擎的基于集合模型的搜索算法
16.Local Search Algorithms and Performance Guarantees for Minimizing Supermodular Function Subject to a Cardidity Constraint;求解基约束下上模函数最小值的局部搜索算法及其性能保证
17.Motion Estimation Algorithm by Node Search Based On Deformable Block Matching With Threshold带有阀值的基于节点搜索的可变形块运动估计算法
18.It belongs to heuristic optimization methods.该算法是一种启发式的搜索寻优方法。
相关短句/例句
ESA极值搜索算法
1.An algorithm is proposed to solve the Nash equilibrium solution for an n-person noncooperative dynamic game by an annealing recurrent neural network for extremum seeking algorithm(ESA).针对如何解算n人非合作的动态博弈对策中的纳什均衡解问题,提出一种利用退火回归神经网络极值搜索算法解算纳什均衡解的方法。
2.Since little consideration of the characteristics of the controlled plant is made in the process ofESA design,and design of extremum seeking algorithm(ESA)and controller are separated,the controlled plant is difficult to reach its highest performance,an integrated design ofESA and controller based on synergetic control was proposed.针对在一般极值搜索控制系统设计过程中较少考虑实际被控对象的特性,将控制器设计与极值搜索算法设计单独地进行,从而导致系统的整体性能很难发挥到最佳状态的问题,提出了一种基于协同控制的极值搜索算法与控制器一体化设计的方法。
3)minimum searching method极值搜索法
4)extremum seeking algorithm滑模极值搜索算法
1.Integrated design of controller andextremum seeking algorithm with sliding mode滑模极值搜索算法与控制器的一体化设计
5)The method of searching modulus maximum line模极大值搜索法
6)Peak Searching Algorithm极点搜索算法
延伸阅读
Weierstrass条件(对变分极值的)Weierstrass条件(对变分极值的)eierstrass conditions (for a variational extremun与 ,(,)一丁:(:,、(:),、(。))过:,,‘! L:R xR”xR”~R,在极值曲线x;、(t)上达到一个强局部极小值,其必要条件是不等式 、(r,x。(r),又。(r),亡))o对所有的t,t。蕊t毛t、和所有的省任C”都满足,其中‘·是Weierstrass澎函数(Weierstrass吕J一几mC-tion).这条件可借助于函数 n(t,x,p,u)=(p,u)一L(t,x,u)来表示(见n0HTp“「“H最大值原理(Pont月闷gm~-mum pnnciple)).Weierstrass条件(在极值曲线x。(t)上六)0)等价于函数n(r,x.,(t),尸。(r),u)当“=交.,(r)在u上达到极大值,其中夕。(t)=L、(t,x。,(t),又。(t)).这样,Weierstrass必要条件是floH-Tp。朋最大值原理的特殊情形.Weierstrass充分条件(Weierstrasss川币eientcon-山tion):为了泛函 叭 ,(,)一丁:(:,、(。),*(。))、。,r‘- L:R xR”xR”一,R在向量函数x.,(t)上达到一个强局部极小值,其充分条件是在曲线x。(t)的一个邻域G中存在一个向量值场斜率函数U(t,x)(测地斜率)(见H皿祀rt不变积分(Hilbert invariant integral)),使得 交。(t)=U(t,x。(t))和产(t,x,U(t,x),七))0对所有(t,x)〔G和任何向量亡6R”成立.【补注]对在极值曲线的隅角的必要条件,亦见Wei-erstrass一Erd”.un隅角条件(W匕ierstrass一Erdrnanncomer conditions).weierstrass条件(对变分极值的)[Weierstrass cOI公i-tions(for a varia垃翻目翻drelll.ll:Be滋eP山TPaccayc-月OBH,,KcTpeMyMa」经典变分法中对强极值的必要和(部分地)充分条件(见变分学(variational cakulus)).由K .We卜erstrass于1879年提出.节几ierstrass必要条件(Weierstrass neeessary con-dition):为使泛函