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

20th World Congress of the International-Federation-of-Automatic-Control (IFAC)

作者： Aalipour, Farzad Gusrialdi, Azwirman Qu, Zhihua Univ Cent Florida Orlando FL 32816 USA

In this paper, we consider distributed optimal feedback control design problem for a network of heterogeneous systems. The agents are coupled through their linear quadratic cost function and their interaction (communication) topology is given by a strongly connected directed graph. The goal is to design a distributed optimal feedback control which minimizes the total cost function in a distributed manner by only relying on the neighboring information of each agent. Moreover, the design of the optimal feedback control gain is also performed in a distributed manner by only relying on the neighboring information of each agent. To this end, firstly the necessary conditions are derived for the noninferior solution to the overall performance index. Then, by utilizing the idea of finite-time consensus algorithm, it is shown that the optimal feedback gain can also be computed in a distributed manner by the agents. Finally, we demonstrate the effectiveness of the proposed control law via a simulation on a group of heterogeneous dynamical systems. (C) 2017, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Optimal Control distributed algorithm Noninferior solution Multi-agent systems Directed Graph

来源：评论

学校读者我要写书评

暂无评论

Design of FIR Filter Based on distributed algorithm

Design of FIR Filter Based on Distributed Algorithm

引用

2012电子信息与电气工程国际学术会议(EIEE2012)

作者： NIE YANG Dept Physics of Ji ning Teachers College Ji ning , China GE HUA Dept Physics of Ji ning Teachers College Ji ning , China

This article introduces a distributed algorithm to design FIR filters, using System Generator complete high-level the filter design. Experimental results show that distributed algorithms significantly reduce the FPGA ... 详细信息

关键词： distributed algorithm FIR FPGA

来源：评论

学校读者我要写书评

暂无评论

A distributed pricing algorithm for achieving network-wide proportional fairness

引用

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2012年第15期12卷 1338-1350页

作者： Zhou, Hui Fan, Pingyi Xia, Xiang-Gen Letaief, K. B. Tsinghua Univ Dept Elect Engn Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China Univ Delaware Dept Elect & Comp Engn Newark DE USA Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Hong Kong Hong Kong Peoples R China

Proportional fairness (PF) scheduling achieves a balanced tradeoff between throughput and fairness and has attracted great attention recently. However, most previous work on PF only considers the single cell scenario. This paper focuses on the problem of achieving network-wide PF in a generalized multiple base station multiple user network. The problem is formulated as a maximization model and solved using the dual method. By decomposing the dual objective function, we get a distributed pricing based algorithm. Optimality of this algorithm is presented. Although the algorithm is derived using fixed link rate assumption, it can still apply in the presence of time-varying rates. The proposed algorithm is suitable for distributed systems in the sense that it does not need any inter base station communication at all. Simulations illustrate that the proposed distributed network-wide PF scheduling algorithm achieves almost the same performance as the centralized one. Compared with traditional local PF (LPF) scheduling, the network-wide PF scheduling achieves higher throughput, lower throughput oscillation, and greater fairness. Copyright (C) 2010 John Wiley & Sons, Ltd.

关键词： scheduling proportional fairness pricing distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Computation of Mixing Time 17

Distributed Computation of Mixing Time

引用

18th International Conference on distributed Computing and Networking (ICDCN)

作者： Molla, Anisur Rahaman Pandurangan, Gopal Indian Stat Inst ACM Unit Kolkata 700108 India Univ Houston Dept Comp Sci Houston TX 77204 USA Univ Freiburg Dept Comp Sci D-79110 Freiburg Germany

ISBN: (纸本)9781450348393

The mixing time of a graph is an important metric, which is not only useful in analyzing connectivity and expansion properties of the network, but also serves as a key parameter in designing efficient algorithms. We present an efficient distributed algorithm for computing the mixing time of undirected graphs. Our algorithm estimates the mixing time T-s (with respect to a source node s) of any n-node undirected graph in O (T-s, log n) rounds. Our algorithm is based on random walks and require very little memory and use lightweight local computations, and work in the CONGEST model. Hence our algorithm is scalable under bandwidth constraints and can be an helpful building block in the design of topologically aware networks.

关键词： distributed algorithm Random Walk Mixing Time Conductance Spectral Properties

来源：评论

学校读者我要写书评

暂无评论

A distributed Logical Filter for Connected Row Convex Constraints 29

A Distributed Logical Filter for Connected Row Convex Constr...

引用

29th Annual IEEE International Conference on Tools with Artificial Intelligence (ICTAI)

作者： Kumar, T. K. Satish Xu, Hong Tang, Zheng Kumar, Anoop Rogers, Craig Milo Knoblock, Craig A. Univ Southern Calif Informat Sci Inst Marina Del Rey CA 90292 USA

ISBN: (纸本)9781538638767

Filtering denotes any method whereby an agent updates its belief state-its knowledge of the state of the world-from a sequence of actions and observations. Popular filtering techniques like Kalman and particle filters maintain compact representations of the belief state at all times. However, these techniques cannot be applied to situations where the world is described using constraints instead of stochastic models. In such cases, the belief state is a logical formula describing all possible world states. In this paper, we first review a logical filtering algorithm for connected row convex (CRC) constraints. CRC constraints are representationally very powerful;and the filtering algorithm for CRC constraints is a logical equivalent of the Kalman filter. We later study the CRC filtering algorithm in distributed settings where nodes of a network are interested in different subsets of variables from a larger system. We deduce its reducibility to the problem of distributed path consistency (PC) and prove the compactness of the belief state representations maintained at each node at all times.

关键词： Constraint Network distributed algorithm Logical Filter

来源：评论

学校读者我要写书评

暂无评论

distributed Stochastic Subgrandient-based Design for Support Vector Machines 36

Distributed Stochastic Subgrandient-based Design for Support...

引用

第36届中国控制会议

作者： Yinghui Wang Peng Lin Yiguang Hong Key Lab of Systems and Control Academy of Mathematics and Systems Science Chinese Academy of Sciences

ISBN: (纸本)9781538629185

This paper develops a distributed stochastic subgrandient-based support vector machine algorithm when training data to train support vector machines are distributed in the *** this situation,all the data are decentralized stored and unavailable to all agents and each agent has to make its own update based on its computation and communication with *** mild connectivity conditions,we show the convergence of the proposed algorithm even though the network topology is *** rate is also given for the proposed ***,we provide numerical simulations on a real classification training set to illustrate the effectiveness of the fully distributed algorithm.

关键词： distributed algorithm support vector machine stochastic subgradient switching topology

来源：评论

学校读者我要写书评

暂无评论

A Collision-Free Self-Deployment of Mobile Robotic Sensors for Three-Dimensional distributed Blanket Coverage Control

A Collision-Free Self-Deployment of Mobile Robotic Sensors f...

引用

IEEE International Conference on Robotics and Biomimetics (ROBIO)

作者： Yang, Xiaotian Univ New South Wales Sch Elect Engn & Telecommun Sydney NSW Australia

ISBN: (纸本)9781538637425

This paper provides a distributed algorithm for mobile robotic sensors to have a self-deployment in a three-dimensional area to reach the complete blanket coverage. The area with obstacles is arbitrary and unknown. Mobile sensors have limited sensing ranges and communication range. They move in order through a grid pattern to reach a complete coverage. The algorithm sets a reference point. Then the furthest robot moves first to the most distant neighbor in each step without collisions through a grid pattern. Finally, the entire area is covered by a sensor network with the fewest robots and steps. It is proved that the algorithm can converge with probability one. The effectiveness and scalability of the algorithm are shown in simulations of different algorithms in different sizes of areas.

关键词： distributed algorithm coverage control mobile robotic sensors self-deployment

来源：评论

学校读者我要写书评

暂无评论

Consensus Based distributed Finite-Time Economic Dispatch in Smart Grid With Jointly Connected Topology 29

Consensus Based Distributed Finite-Time Economic Dispatch in...

引用

第29届中国控制与决策会议

作者： Gang Chen Zhiyong Li College of Automation Chongqing University

ISBN: (纸本)9781509046584

The plug-and-play function is one of the features of future smart *** economic dispatch algorithm will pave the way for the achievement of this *** existing distributed economic dispatch algorithms only achieve asymptotic or exponential convergence and work under time-invariant communication *** this work,a consensus based distributed economic dispatch algorithm,which achieves finite-time convergence under jointly connected topology condition,is proposed to calculate the optimal active power for each *** virtue of Lyapunov theory,LaSalle's invariance principle and homogeneous property,the convergence and optimality of the proposed algorithm are *** case studies are performed to illustrate the effectiveness of the proposed algorithm.

关键词： Economic Dispatch distributed algorithm Finite-Time Convergence Jointly Connected Topology Smart Grid

来源：评论

学校读者我要写书评

暂无评论

Interference coordination in full-duplex HetNet with large-scale antenna arrays

引用

Frontiers of Information Technology & Electronic Engineering 2017年第6期18卷 830-840页

作者： Zhao-yang ZHANG Wei LYU College of Information Science and Electronic Engineering Zhejiang UniversityHangzhou 310027China

Massive multiple-input multiple-output (MIMO), small cell, and full-duplex are promising techniques for future 5G communication systems, where interference has become the most challenging issue to be *** this paper, we provide an interference coordination framework for a two-tier heterogeneous network(HetNet)that consists of a massive-MIMO enabled macro-cell base station (MBS) and a number of full-duplex small-cell base stations (SBSs). To suppress the interferences and maximize the throughput, the full-duplex mode of each SBS at the wireless backhaul link (i.e., in-band or out-of-band), which has a different impact on the interference pattern, should be carefully selected. To address this problem, we propose two centralized algorithms, a genetic algorithm (GEA)and a greedy algorithm (GRA). To sufficiently reduce the computational overhead of the MBS, a distributed graph coloring algorithm (DGCA) based on price is further proposed. Numerical results demonstrate that the proposed algorithms significantly improve the system throughput.

关键词： Massive MIMO Full-duplex Small cell Wireless backhaul distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Differential inequalities in multi-agent coordination and opinion dynamics modeling

引用

AUTOMATICA 2017年 85卷 202-210页

作者： Proskurnikov, Anton V. Cao, Ming Delft Univ Technol Delft Ctr Syst & Control Delft Netherlands Russian Acad Sci Inst Problems Mech Engn St Petersburg Russia ITMO Univ Chair Math Phys & Informat Theory St Petersburg Russia Univ Groningen Engn & Technol Inst ENTEG Groningen Netherlands

Many distributed algorithms for multi-agent coordination employ the simple averaging dynamics, referred to as the Laplacian flow. Besides the standard consensus protocols, examples include, but are not limited to, algorithms for aggregation and containment control, target surrounding, distributed optimization and models of opinion formation in social groups. In spite of their similarities, each of these algorithms has been studied using separate mathematical techniques. In this paper, we show that stability and convergence of many coordination algorithms involving the Laplacian flow dynamics follow from the general consensus dichotomy property of a special differential inequality. The consensus dichotomy implies that any solution to the differential inequality is either unbounded or converges to a consensus equilibrium. In this paper, we establish the dichotomy criteria for differential inequalities and illustrate their applications to multi-agent coordination and opinion dynamics modeling. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： Multi-agent systems Cooperative control distributed algorithm Complex network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：