首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3篇
  完全免费   5篇
  自动化技术   8篇
  2018年   1篇
  2017年   2篇
  2015年   1篇
  2013年   1篇
  2008年   1篇
  2005年   1篇
  1998年   1篇
排序方式: 共有8条查询结果,搜索用时 15 毫秒
1
1.
分数倍抽样率转换器的时变网络结构及其FPGA实现   总被引:4,自引:0,他引:4  
提出了分数倍抽样率转换器的高效时变网络结构的设计方法,并用现场可编程门阵列(FPGA)实现.通过对分数倍抽样率转换器的多相结构与时变网络结构的比较,指出在实现分数倍抽样率转换器时,时变网络结构克服了分数延迟的问题,结构简单;整个设计采用并行工作方式以提高系统的运算速度;采用低抽样率下进行滤波运算,从而大大降低了运算量.以I/D=256/1 023倍抽样率转换器为例,用FPGA XC2V250-5来实现时变网络结构的设计,芯片利用率为61%,最高工作频率可达92.225 MHz.  相似文献
2.
In this paper, two computationally efficient algorithms are presented for determining the least possible time paths for all origins to a single destination in networks where the arc weights are discrete random variables whose probability distribution functions vary with time. The first algorithm determines the least possible time path from each node for each departure time interval, the least possible travel time and a lower bound on the associated probability of the occurrence of this travel time. The second algorithm determines up to k least possible time paths, the associated travel times and the corresponding probabilities of occurrence of the travel times (or a lower bound on this probability). No such efficient algorithms for determining least time paths in stochastic, time-varying networks exist in the literature.  相似文献
3.
考虑实际生活中道路路况影响运输成本及油耗率与运载量相关的因素,处理跨多时段的问题,建立时变路网条件下的车辆路径问题数学模型。通过聚类算法和节约算法构造初始解,提高求解速度;自适应地改变启发式因子和期望启发式因子,提高算法全局收敛能力;结合油耗率,将油耗率转化成信息素挥发因子,自适应更新信息素,保证其收敛速度;通过3-opt策略,提高算法的局部搜索能力。基于以上方法构造自适应蚁群算法,对8个客户规模的实例进行仿真表明提出的算法在收敛速度和寻优结果两方面略优于自适应遗传算法和蚁群算法,且因为考虑了不同运载量的油耗,为准确估计运输成本提供了方法。  相似文献
4.
为解决食品冷链配送系统优化问题,针对易腐品特性,结合配送网络时变特征进行行程时间分析,根据服务时间窗设计满意度函数,建立时变条件下的仿真模型;采用"预优化阶段+实时优化阶段"两阶段求解策略,利用分解法进行问题分解,设计最小包络聚类分析方法与混合遗传算法求解。仿真计算验证了模型和算法的有效性与研究的实用价值。  相似文献
5.
交通网络是随机时变网络,用周期性时间窗模拟各路口信号灯控制,建立交通网络中路口相位差协调控制模型。时间窗的设定使只有规定行驶方向的车辆可以通行路口,其他车辆不可通行。为得到车辆在路口前等待状况,定义时间窗函数,该函数采用协调交通网络路口信号相位差的方法求得随机时变网络的最短期望路径。结合改进的SDOT算法和穷举法及遗传算法设计一种混合算法。对一个四路口小型交通网络进行了仿真研究,结果验证了求解算法的有效性。  相似文献
6.
This paper addresses a distributed consensus optimisation problem over networks with time-varying topologies based on Zero-Gradient-Sum (ZGS) algorithm. First, the exponential convergence of the algorithm is guaranteed under a new condition on network topologies, called cooperatively connected. This condition does not require the topology constantly connected or jointly connected but only requires the integral of the Laplacian matrix of the network topology over a period of time is connected. Hence, it is suitable for more general time-varying topologies. Second, by establishing a key mathematical lemma, we develop a convergence analysis technique which is based on the difference of the Lyapunov function rather than its differentiation. Finally, a simulation example is also provided to verify the results obtained in this paper.  相似文献
7.
This paper studies state synchronization of homogeneous time‐varying networks with diffusive full‐state coupling or partial‐state coupling. In the case of full‐state coupling, linear agents as well as a class of nonlinear time‐varying agents are considered. In the case of partial‐state coupling, we only consider linear agents, but, in contrast with the literature, we do not require the agents in the network to be minimum phase or at most weakly unstable. In both cases, the network is time‐varying in the sense that the network graph switches within an infinite set of graphs with arbitrarily small dwell time. A purely decentralized linear static protocol is designed for agents in the network with full‐state coupling. For partial‐state coupling, a linear dynamic protocol is designed for agents in the network while using additional communication among controller variables using the same network. In both cases, the design is based on a high‐gain methodology. Copyright © 2017 John Wiley & Sons, Ltd.  相似文献
8.
This paper deals with the constrained estimation problem for a class of time‐varying complex networks with hybrid incomplete information including randomly occurring uncertainties, randomly occurring nonlinearities, and fading measurements over a finite horizon. Communication links among nodes have uncertain coupling strengths, which can be transformed into a norm‐bounded inner coupling matrix based on the interval matrix approach. The proposed performance requirements not only quantify the degree of the estimation error with regard to unknown‐but‐bounded disturbances but also confine the estimation error in a constrained set. By exploiting the intensive stochastic analysis and the set‐membership method, sufficient conditions are developed under which networks fulfill the performance and the bounded constraint, respectively. Then, a new criterion is derived to ensure the prescribed requirements in terms of recursive linear matrix inequalities suitable for online computation. Finally, a simulation example is provided to show the effectiveness of the developed results.  相似文献
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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