检索结果-内蒙古大学图书馆

discrete-time Zeroing Dynamics With Quadruplicate Error Pattern for time-Varying Linear Inequality

IEEE ACCESS 2021年 9卷 7985-7993页

作者： Cai, Jianhuang Feng, Qingshan Guo, Dongsheng Huaqiao Univ Coll Informat Sci & Engn Xiamen 361021 Peoples R China

Linear inequality (LI) plays an important role in many fields of science and engineering. Recently, a typical neural dynamics called zeroing dynamics (ZD) has been reported for online solution of time-varying LI (TVLI). On the basis of the previous work, the discrete-time form of the ZD with superior computational property is studied in this paper. Specifically, a Taylor-type difference rule is first presented for the first-order derivative approximation. By utilizing such a difference rule to discrete the previous ZD model, the new discrete-time ZD (DTZD) algorithm is thus established and proposed for TVLI solving. Such an algorithm performs better computational performance than the existing DTZD algorithm. Theoretical results show that the proposed DTZD algorithm has a quadruplicate error pattern on solving the TVLI. Comparative numerical results with two illustrative examples further substantiate the efficacy and superiority of the proposed DTZD algorithm over the existing DTZD algorithm.

关键词： Heuristic algorithms Steady-state Numerical models Computational modeling Approximation algorithms Neurons Neural networks Zeroing dynamics (ZD) discrete-time algorithm time-varying linear inequality (TVLI) difference rule numerical validation

来源：评论

学校读者我要写书评

暂无评论

Formation control using range-only measurements

引用

AUTOMATICA 2011年第4期47卷 776-781页

作者： Cao, Ming Yu, Changbin Anderson, Brian D. O. Univ Groningen ITM Fac Math & Nat Sci NL-9700 AB Groningen Netherlands Australian Natl Univ Res Sch Informat Sci & Engn Canberra ACT 0200 Australia Natl ICT Australia Ltd Eveleigh NSW Australia

This paper proposes algorithms to coordinate a formation of mobile agents when the agents are not able to measure the relative positions of their neighbors, but only the distances to their respective neighbors. In this sense, less information is available to agents than is normally assumed in formation stabilization or station keeping problems. To control the shape of the formation, the solution advanced in the paper involves subsets of non-neighbor agents cyclically localizing the relative positions of their respective neighbor agents while these are held stationary, and then moving to reduce the value of a cost function which is nonnegative and assumes the zero value precisely when the formation has correct distances. The movement schedule is obtained by a novel vertex-coloring algorithm whose computation time is linear in the number of agents when implemented on the graphs of minimally rigid formations. Since in some formations, it may be that an agent is never allowed to be stationary (e.g. it is a fixed-wing aircraft), or because formations may be required to move as a whole in a certain direction, the results are extended to allow for cyclic localization of agents in this case. The tool used is the Cayley-Menger determinant. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Multi-agent formation Range-only measurement discrete-time algorithm Vertex coloring Cayley-Menger determinant

来源：评论

学校读者我要写书评

暂无评论

Distributed event-triggered algorithm for unconstrained convex optimisation over weight-balanced directed networks

引用

IET CONTROL THEORY AND APPLICATIONS 2020年第2期14卷 253-261页

作者： Hayashi, Naoki Sugiura, Tomohiro Kajiyama, Yuichi Takai, Shigemasa Osaka Univ Grad Sch Engn 2-1 Yamada Oka Suita Osaka Japan

In this study, the authors propose a distributed discrete-time algorithm for unconstrained optimisation with event-triggered communication over weight-balanced directed networks. They consider a multi-agent system where each agent has a state and an auxiliary variable for the estimates of the optimal solution and the average gradient of the entire cost function. Agents send the states and auxiliary variables to their neighbours when their trigger errors exceed thresholds. They derive a convergence rate of the proposed algorithm which shows faster convergence to the optimal solution compared to the subgradient-based method.

关键词： discrete time systems gradient methods distributed control optimisation convex programming multi-agent systems convergence discrete-time algorithm unconstrained optimisation event-triggered communication weight-balanced directed networks multiagent system optimal solution auxiliary variables trigger errors distributed event-triggered algorithm unconstrained convex optimisation

来源：评论

学校读者我要写书评

暂无评论

A FORBIDDEN MINOR CHARACTERIZATION AND RELIABILITY OF A CLASS OF PARTIAL 4-TREES

引用

NETWORKS 1995年第3期25卷 139-146页

作者： LINGNER, GT POLITOF, T SATYANARAYANA, A CONCORDIA UNIV MONTREALPQCANADA STEVENS INST TECHNOL HOBOKENNJ 07030

This paper characterizes a class G of partial 4-trees in terms of a set of seven forbidden miners. The class G contains several known classes of graphs, including both Delta - Y and Y - Delta graphs. A set of six graph reduction operations is defined, and it is shown that a graph G is an element of G iff G can be reduced to an edgeless graph by a finite sequence of these operations. The all-terminal reliability R(G) of a graph G is the probability that G is connected. The characterization of G is used to develop an O(n log n) algorithm to compute R(G) for all n-point graphs in G. The running time is O(n) for planar graphs in G. (C) 1995 John Wiley and Sons, Inc.

关键词： Linear-time algorithm Terminal reliability Partial 3-trees Free networks Complexity Planar Graphs Tree Compute Complexity finite sequence discrete-time algorithm REGULATORY GUIDE Planar

来源：评论

学校读者我要写书评

暂无评论

Numerical Verification and Robotic Application of New DTZD algorithm for Solving System of time-Varying Nonlinear Equations

Numerical Verification and Robotic Application of New DTZD A...

引用

Chinese Intelligent Automation Conference

作者： Huang, Zhijing Lin, Xinjie Zhang, Yiwen Zhang, Zhixin Guo, Dongsheng Huaqiao Univ Coll Informat Sci & Engn Xiamen 361021 Peoples R China

ISBN: (纸本)9789813290501;9789813290495

Recently, a discrete-time zeroing dynamics (DTZD) in scalar form has been established to solver time-varying nonlinear equations (TVNE). For completeness, the extension study of such scalar-form DTZD algorithm is presented in this paper. Specifically, by following the previous work, a new DTZD algorithm in vector form, which has a cube error mode, is developed in this paper for solving the system of TVNE. Then, numerical results are given to substantiate the efficacy of the new vector-form DTZD algorithm. Furthermore, the application of the new DTZD algorithm to redundant robot manipulator is provided, thereby showing the application potential of the presented algorithm.

关键词： discrete-time algorithm Zeroing dynamics System of time-varying nonlinear equations Numerical verification Robotic application

来源：评论

学校读者我要写书评

暂无评论

A quadratic-time algorithm for smoothing interval functions

引用

Reliable Computing 1996年第3期2卷 255-264页

作者： Kreinovich, Vladik Department of Computer Science University of Texas at El Paso El Paso TX 79968 United States

In many real-life applications, physical considerations lead to the necessity to consider the smoothest of all signals that is consistent with the measurement results. Usually, the corresponding optimization problem is solved in statistical context In this paper, we propose a quadratic-time algorithm for smoothing an interval function. This algorithm, given n+1 intervals x₀,...,x_n with 0 ∈ x₀ and 0 ∈ x_n, returns the vector x_o,...,x_n for which x₀ = x_n = 0, x_i ∈ x_i, and ∑(x_i+1 - x_i)² → min. © V. Kreinovich, K. Villaverde, 1996.

关键词： Chpher(0) Consistent discrete-time algorithm algorithms measurement result Function smoothing

来源：评论

学校读者我要写书评

暂无评论

Design of Defined Controller for Modular Multilevel Converter Based on CPS-SPWM in PSCAD

Design of Defined Controller for Modular Multilevel Converte...

引用

General Meeting of the IEEE-Power-and-Energy-Society

作者： Li, Haifeng Liu, Chongru Li, Gengyin Guo, Qi Lin, Xuehua North China Elect Power Univ State Key Lab Alternate Elect Power Syst Renewabl Beijing Peoples R China China Southern Power Grid Elect Power Res Inst Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781467380409

This paper introduces a convenient and efficient way to model a CPS-SPWM based MMC control system with 4 defined controllers, which are power control block, averaging and balancing control block, carrier and firing pulses block. Equivalent control subroutines are designed in the defined controller, which can change the labor of duplication of large amount of control components to simply change the times of calling those subroutines. Also the control signals, such as capacitor voltages and firing pulses, are designed and processed in array form, which significantly simplifies the control system. Interfaces of the defined controller are introduced for other available additional control strategies. Simulations results in PSCAD/EMTDC show that the defined controllers proposed in this paper are of effectiveness and efficiency.

关键词： modular multilevel converter discrete-time algorithm defined controller CPS-SPWM

来源：评论

学校读者我要写书评

暂无评论

CBNSimulator: a simulator tool for understanding the behaviour of complex biomolecular networks using discrete time simulation 21

CBNSimulator: a simulator tool for understanding the behavio...

引用

21st International Conference on Knowledge - Based and Intelligent Information and Engineering Systems (KES)

作者： Ayadi, Ali de Beuvron, Francois de Bertrand Zanni-Merk, Cecilia Krichen, Saoussen CNRS UMR 7357 ICUBE SDC Team Pole API BP 10413 F-67412 Illkirch Graffenstaden France INSA Rouen Normandie Federat CNRS Norm STIC FR 3638 LITIS Lab Ave Univ F-76801 St Etienne Du Rouvray France Univ Tunis Inst Super Gest Tunis LARODEC Lab Rue Liberte Bardo 2000 Tunisia

Because of the lack of satisfactory solutions to explain biological systems, biologists usually focus on modelling and simulation tools to understand the behaviour of these complex organisms. Indeed, computational modelling and simulation of cells plays a pivotal role in systems biology. In this paper, we tackle the problem of studying the behaviour of human cells by reproducing the behaviour of complex biomolecular networks. To this end, we present in this paper an approach for simulating complex biomolecular networks inspired by the discrete-event simulation model (DEVS), a formalism developed for supporting the modelling of complex systems. In this paper, we propose a simulation tool, named CBNSimulator, based on a logical model of the biomolecular network and taking advantage of the performance of a discrete-time simulation model for understanding the evolution and the behaviour of complex biomolecular networks as a discrete sequence of events in time. The proposed tool has been applied to the case study of a ribosomal protein regulation network, named "the bacteriophage T4 gene 32, and results given by this simulation tool are in agreement with the experts judgement. Moreover, the graphical user interface of CBNSimulator allows biologists to easily reproduce, analyse and understand behaviour of complex biomolecular networks through discrete simulation. (C) 2017 The Authors. Published by Elsevier B.V.

关键词： Complex biomolecular network modelling and simulation DEVS discrete-time algorithm CBNSimulator

来源：评论

学校读者我要写书评

暂无评论

Progressive Decentralized TDMA based MAC: Joint Optimization of Slot Allocation and Frame Lengths

Progressive Decentralized TDMA based MAC: Joint Optimization...

引用

IEEE Military Communications Conference

作者： Chaudhary, Muhammad Hafeez Scheers, Bart Royal Mil Acad Brussels Belgium

ISBN: (纸本)9780769551241

The TDMA based MAC scheduling is considered appropriate for many applications in which deterministic medium access schedule plays a crucial role. The existing plentiful literature on the TDMA based scheduling focus on the conflict-free slot allocation where the scheduling problem is broken into two disjoint problems: first find conflict free slot allocation, minimizing the number of slots used, and subsequently select frame sizes in which to use the assigned slots. In this paper, we show that such a sequential approach could lead to suboptimal performance when analyzed from the perspective of slot or channel reuse, which is the prime objective of the spatial reuse TDMA schemes. To his end, we formulate the channel scheduling as an optimization problem that aims to maximize the slot reuse factor whereby we jointly optimize the slots assignment and the frame lengths. The problem being inherently NP-hard, to solve it we propose a greedy heuristic based algorithm by which nodes complete slot assignment in a progressive decentralized way. We show that under the proposed algorithm, all nodes are guaranteed to find a conflict-free transmission schedule. Besides, we provide upper bound on the convergence time of the algorithm for a single node, and for the whole network. Finally, with simulation examples, we show that the proposed algorithm when compared with other TDMA scheduling schemes could give better performance in terms of slot reuse factor.

关键词： Channel Reuse Distributed TDMA Optimization Slot Reuse Spatial Reuse TDMA TDMA time division multiple access Slot allocation SLOT Reuse reuse discrete-time algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed fixed step-size algorithm for dynamic economic dispatch with power flow limits

引用

Science China(Information Sciences) 2021年第1期64卷 110-122页

作者： Kun WANG Zao FU Qian XU Duxin CHEN Lei WANG Wenwu YU The State Grid Zhejiang Economic Research Institute School of Cyber Science and Engineering Southeast University School of Mathematics Southeast University

In this study, a discrete-time distributed algorithm is proposed for solving the dynamic economic dispatch problem with active power flow limits and transmission line loss. To avoid the communication burden and implement the algorithm in a favorably distributed manner, the splitting method is used to bypass the centralized updating of the algorithm's parameters, which is unavoidable when implementing conventional Lagrangian methods. The use of a fixed step-size and distributed update enhances the applicability of the algorithm. The performance and effectiveness of the proposed distributed algorithm are verified via numerical studies on the IEEE 14-bus system.

关键词： dynamic economic dispatch distributed optimization discrete-time algorithm active power flow limit transmission line loss

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：