首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 62 毫秒
1.
介绍了一种步进电动机自动加减速控制方案,其核心内容是自动根据步进电动机要运行的总步数自动选择加减速级数及最高一级的速度。在这一点上它具有智能控制的特点。因而具有重要的实用价值。  相似文献   

2.
邓中亮 《自动化仪表》1992,13(12):31-34
介绍了用单片机构成的步进电机控制装置,依据步进电机的运行特性分析了控制程序的设计要求,较详细地介绍了自动加减速控制、正反转控制和多坐标联动控制等方面的问题。  相似文献   

3.
步进电机加减速控制技术研究   总被引:4,自引:0,他引:4  
文章主要介绍了步进电机加减速控制技术,分析了步进电机短距离加减速控制的特殊性,提出了加减速控制方案,同时也分析了整机运行过程中产生的共振现象及其解决方法。  相似文献   

4.
本文介绍采用MCS—51单片微机对横、纵向两部五相十拍的步进电机实现正、反转,加、减速和自动变速的控制应用系统,该系统可作为智能化的步进电机控制器使用。  相似文献   

5.
王睿  吴峻  黄文君 《控制工程》2015,22(2):222-226
针对步进电机在快速加、减速及制动过程中容易出现的失步、过冲等现象,提出基于混合续流的功率器件优化导通驱动方式,能够最大程度减小在加、减速与制动过程中反电势对步进电机动态特性的影响,同时快速跟随细分电流给定波形。在此优化导通方式的基础上设计了一种具有高动态特性的全数字化步进电机驱动器,解决了步进电机在快速启停与加减速过程中出现的过冲和失步现象。实验结果表明,设计的驱动器具有很高的动态特性,符合设计要求。  相似文献   

6.
步进电机在光电跟踪照射系统中的优化控制   总被引:1,自引:0,他引:1  
通过对步进电机加减速曲线的理论分析和相关实验研究,利用高低速的时钟切换提高控制精度,采用定时步进法,定时器变频中断来实现步进电机不失步升降速,提出一种基于微控制器的简化后的指数型加减速曲线控制方法。该方案既可以提高加减速快速性,又可以保证系统的定位精度,并在光电跟踪照射系统中表现出了良好的性能。系统具有体积小、成本低、控制灵活的特点。  相似文献   

7.
本文研究步进电机在外部按键的操控下进行正反转、加减速和停机等控制,通过1602LCD液晶屏显示步进电机当前的运行状态;分析了步进电机控制系统的硬件组成电路和软件程序的实现方法,对步进电机在各行业中的控制应用具有较高的参考价值。  相似文献   

8.
加减速算法在步进电机开环控制系统中发挥着关键作用,传统梯形、抛物线形加减速算法由于在加减速过程的起点或者终点存在加速度突变,易给电机运行带来冲击。针对上述问题,设计了一种基于正弦函数的新型S形加减速算法,此算法更加符合电机转矩特性,并依据两相混合式步进电动机的数学模型以及细分驱动原理,在MATLAB仿真环境下搭建了步进电机开环控制模型。仿真结果表明,该算法能够保证电机运行过程中加速度的连续变化,减轻了步进电动机柔性冲击,提高了电机的控制精度和运行稳定性。  相似文献   

9.
《软件》2019,(12):201-205
随着技术的进步与科技的发展,步进电机广泛的运用于工业生产,对步进电机的速度控制和位置控制也愈加严格。仔细分析S型曲线控制,将S型运动曲线分为加加速段、匀加速段、减加速段、匀速段、加减速段、匀减速段、和减减速段。为了优化步进电机开环控制系统,通过对步进电机的速度控制的研究,运用PID控制和模糊PID控制两种控制方法对步进电机速度进行控制,对二者的控制效果分别讨论,选择更优的控制方法,使步进电机速度曲线实现S型曲线,提高步进电机的精确性和可靠性。  相似文献   

10.
在机器人电机控制过程中,发现带载情况下如果电机起步速度过快会导致电机堵转问题,很需要一种可以实现电机匀加速的精确控制方法。本文借助于STM32F103,通过其I/O口输出矩形波脉冲序列的方式控制步进电机驱动器或伺服驱动器,从而实现对步进电机的位置和速度控制。通过修改定时器值实现梯形加减速轨迹,使步进电机运行具有较好加减速性能。另外,由于STM32F103芯片具有多路定时器,可以通过配置多路定时器输出多路不同频率的脉冲信号,实现对机器人多轴(多个电机)的控制。该方法对于机器人嵌入式步进电机控制器的开发具有很好的参考价值。  相似文献   

11.
Disruptions like the breakdown of machines or delays in the delivery of materials cause generated production plans to be useless, at least in some parts. A new planning approach for coping with this uncertainty caused by disruptions is presented. Planning steps that are described by properties, preconditions and consequences are used for material requirements planning and scheduling. If their preconditions are satisfied in a certain state of environment, planning steps will be applicable. The consequences of planning steps change the state of environment. Each customer order establishes a goal of a new planning problem to be achieved by applying planning steps. Plan execution concerns all planning steps applicable in a certain state of environment. In choosing among applicable planning steps and among available resources the flexibility of plan execution is preserved.  相似文献   

12.
Random walk is one of the widely used techniques for information discovery in unstructured networks like Ad hoc Wireless Networks (AWNs) and Wireless Sensor Networks (WSNs). In a random walk, instead of taking all steps uniform randomly, our idea is to modify the random walk to take some level biased steps to improve its energy efficiency and latency which are important design parameters of protocols for WSNs. The level of a node is defined as the minimum number of hops in which it can reach the sink node. We propose three protocols viz., Several Short Random Walks (SSRW) search, Random Walk with Level Biased Jumps (RWLBJ) search, and Level Biased Random Walk (LBRW) search. The proposed protocols use a combination of random and level biased steps to search for the target information. As we move from SSRW to LBRW, the percentage of biased steps increases and the percentage of random steps decreases i.e., SSRW uses fewer biased steps compared to the other proposals, LBRW uses only biased steps, and the usage of biased steps in RWLBJ is somewhere in between. We show by extensive simulations and testbed experiments that SSRW, RWLBJ, and LBRW are better choices compared to that of a pure Random walk in terms of the energy consumption and latency of search, and we also show that among the proposed protocols, LBRW and RWLBJ are the best.  相似文献   

13.
一种快速分类搜索运动估计新方法   总被引:5,自引:1,他引:5       下载免费PDF全文
在视频编码中 ,基于块的运动估计算法被广泛应用 .在保证估计质量的前提下 ,为了降低运动估计算法的搜索次数 ,提出了一种对于不同类型的块采用不同的搜索范围和搜索步骤的分类快速搜索 (CFS)运动估计新算法 .该算法首先对块进行分类 ,然后确定其搜索范围和搜索步骤 ,在应用分类搜索法时 ,根据运动矢量的中心偏置特性 ,将第 1步和第 2步的搜索窗采用 5× 5的窗口 ,第 3步采用 3× 3的窗口 .结果表明 ,该分类快速搜索新算法在运动矢量的估计质量上 ,明显优于传统三步搜索法 ,且搜索次数与传统三步搜索法相比 ,降低了 2 3% ,与全搜索法相比 ,降低了 91% .实验结果证明 ,该算法尤其适用于快速运动、复杂运动序列的运动估计 .与传统的全搜索法和三步搜索法相比 ,其更适合于用硬件实现 .  相似文献   

14.
武鹏  李美安 《计算机应用》2013,33(2):323-360
在大规模完全分布式系统的互斥问题上,快速生成请求集是必要的。在基于松弛差集的相关原理上,引入了二次松弛差集的概念。经分析相关概念及定理,将原本“求差”的过程变为“求和”的过程;进而利用 “求和”步骤间的递推关系,大大减少了求和步骤,使整个算法的时间复杂度控制在O(n)。与时间复杂度同为O(n^2)的其他经典算法相比,生成的请求集长度仍保持在2n^(1/2)的数量级。  相似文献   

15.
Key time steps selection is essential for effective and efficient scientific visualization of large‐scale time‐varying datasets. We present a novel approach that can decide the number of most representative time steps while selecting them to minimize the difference in the amount of information from the original data. We use linear interpolation to reconstruct the data of intermediate time steps between selected time steps. We propose an evaluation of selected time steps by computing the difference in the amount of information (called information difference) using variation of information (VI) from information theory, which compares the interpolated time steps against the original data. In the one‐time preprocessing phase, a dynamic programming is applied to extract the subset of time steps that minimize the information difference. In the run‐time phase, a novel chart is used to present the dynamic programming results, which serves as a storyboard of the data to guide the user to select the best time steps very efficiently. We extend our preprocessing approach to a novel out‐of‐core approximate algorithm to achieve optimal I/O cost, which also greatly reduces the in‐core computing time and exhibits a nice trade‐off between computing speed and accuracy. As shown in the experiments, our approximate method outperforms the previous globally optimal DTW approach [ TLS12 ] on out‐of‐core data by significantly improving the running time while keeping similar qualities, and is our major contribution.  相似文献   

16.
《Software, IEEE》2006,23(2):19-21
Project teams can take several small, easy steps to improve requirements to the point where they're good enough. But every project is different. Your team might need to take steps that wouldn't be right in other situations. The author lists 10 basic steps to improve requirements.  相似文献   

17.
We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of both number of communication steps and number of processes for two--step consensus. The protocol can be used to build a replicated state machine that requires only three communication steps per request in the common case. Further, we show a parameterized version of the protocol that is safe despite f Byzantine failures and, in the common case, guarantees two-step execution despite some number t of failures (tle f). We show that this parameterized two-step consensus protocol is also optimal in terms of both number of communication steps and number of processes.  相似文献   

18.
松涛水利工程管理局在松涛灌区(东干)渠道上建立的5座梯级电站由于地理位置分散,渠道调节性能差,发电效益不高,综合利用部门之间的矛盾突出。为此,对松涛灌区渠道梯级电站进行优化调度研究,以现代控制论、动态规划法为基础,根据动态规划理论,求解适合渠道梯级电站优化运行方式,并开展渠道梯级电站联合优化调度应用的探索,实践证明,松涛灌区梯级电站优化调度后效益显著。  相似文献   

19.
We develop a methodology for the design of hot-potato algorithms for routing permutations. The basic idea is to convert existing store-and-forward routing algorithms to hot-potato algorithms. Using it, we obtain the following complexity bounds for permutation routing: n×n Mesh: 7n+o(n) steps; 2n hypercube: O(n2) steps; n×n Torus: 4n+o(n) steps. The algorithm for the two-dimensional grid is the first to be both deterministic and asymptotically optimal. The algorithm for the 2n-nodes Boolean cube is the first deterministic algorithm that achieves a complexity of o(2n) steps  相似文献   

20.
本文探讨如何在"编译原理"教学过程中形象地演示复杂的算法过程,提出了一个演示算法步骤的方案,展示算法步骤的进行以及步骤进行时的数据联动,对于不同的动作、不同意义的数据,用图形元素和颜色加以区分,并以LR分析算法为例说明了如何分解复杂步骤,如何用图形和颜色展示移进、归约、接受、出错等分析动作以及相关数据的变化。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号