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

5th IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)

作者： Huang, Bonan Liu, Lining Li, Yushuai Zheng, Chaoming Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Liaoning Peoples R China

ISBN: (纸本)9781538660058

This paper is concerned with solving the economic dispatch problem of microgrid via continuous multi agents systems, in which the communication delays and power losses are considered. A fully distributed algorithm is developed to solve this problem, and the effect of time delays on the convergence is analyzed by the frequency domain method. Finally, several simulations are provided to demonstrate the correctness and effectiveness of the theocratical results.

关键词： distributed algorithm Economic dispatch Time delays Power losses Multi-agents system

来源：评论

学校读者我要写书评

暂无评论

distributed Mining of Popular Paths in Road Networks 14

Distributed Mining of Popular Paths in Road Networks

引用

14th Annual International Conference on distributed Computing in Sensor Systems (DCOSS)

作者： Katsikouli, Panagiota Astefanoaei, Maria Sinziana Sarkar, Rik Univ Edinburgh Informat Edinburgh Midlothian Scotland Univ Lyon INRIA INSA Lyon CITI Lyon France

ISBN: (纸本)9781538654705

We consider the problem of finding large scale mobility patterns. A common challenge in mobility tracking systems is that large quantity of data is spread out spatially and temporally across many tracking sensors. We thus devise a spatial sampling and information exchange protocol that provides probabilistic guarantees on detecting prominent patterns. For this purpose, we define a general notion of significant popular paths that can capture many different types of motion. We design a summary sketch for the data at each tracking node, which can be updated efficiently, and then aggregated across devices to reconstruct the prominent paths in the global data. The algorithm is scalable, even with large number of mobile targets. It uses a hierarchic query system that automatically prioritizes important trajectories - those that are long and popular. We show further that this scheme can in fact give good results by sampling relatively few sensors and targets, and works for streaming spatial data. We prove differential privacy guarantees for the randomized algorithm. Extensive experiments on real GPS data show that the method is efficient and accurate, and is useful in predicting motion of travelers even with small samples.

关键词： Trajectories road networks sensor networks distributed algorithm clustering spatial query processing differential privacy

来源：评论

学校读者我要写书评

暂无评论

Building Temperature Control: A distributed Escort Dynamical approach

Building Temperature Control: A Distributed Escort Dynamical...

引用

IEEE International Conference on Power and Energy Systems (ICPES)

作者： M. Sawant J. Moyalan J. Koonamparampath A. Sheikh S. Wagh N. Singh Electrical Engineering Department Veermata Jijabai Technological Institute Mumbai India

ISBN: (数字)9781728126586

ISBN: (纸本)9781728126593

The constrained multi-agent optimization problem of building temperature control (BTC) is addressed in the framework of distributed resource allocation (DRA) using evolutionary game theory (EGT). The relationship between limited resource availability of DRA problem and constant population size requirement is established to devise population dynamic based control law. The BTC plant dynamics interconnected with the control dynamics are evaluated in the context of convergence to the rest point in terms of output consensus for dynamical systems. Furthermore, mitigating the expectation dependency of escort dynamical model of EGT, a DRA protocol is proposed referred to as distributed escort dynamics (DED). It ensures the satisfaction of global resource bound along with the local resource bounds on individual control parameters which is not the case for general dynamics such as replicator dynamics, logit dynamics, etc. referred to as classical models. The control action devised adopting DED approach is shown to provide smooth trajectory tracking along with the low start-up transience when compared with distributed interior point (DIP) method.

关键词： Consensus problems distributed algorithm Escort dynamics Graph theory Resource allocation distributed algorithms Resource utilization Graph theory control dynamics control action management of resources Resource availability Temperature control dynamics Distribute DED AATF Gene BTC gene control law

来源：评论

学校读者我要写书评

暂无评论

distributed Coordinated Control of AC/DC Microgrid Voltage Containing Electric Vehicles 10

Distributed Coordinated Control of AC/DC Microgrid Voltage C...

引用

10th IEEE Annual Energy Conversion Congress and Exposition (ECCE)

作者： Mao, Meiqin Liu, Yufeng Wang, Yangyang Chang, Liuchen Hatziargyriou, Nikos Hefei Univ Technol Res Ctr Photovolta Syst Engn Hefei Anhui Peoples R China Natl Tech Univ Athens Elect & Comp Engn Dept Power Div Athens Greece

ISBN: (纸本)9781479973125

Combining the advantages of DC microgrids (DC-MGs) and AC microgrids (AC-MGs), AC and DC hybrid microgrids (AC&DC-HMGs) have higher energy efficiency than AC-MGs, and overcome the disadvantages of DC-MGs which have many converters. But AC&DC-HMGs with renewable energy generation and electric vehicles (EVs) intensify the uncertainty on both sides of the supply and demand, and present some challenges to the power quality like voltage fluctuations. To address the issue, in this paper, EVs connected in AC&DC-HMGs are considered as distributed controllable active power units, to optimally regulate total active power injection at the key nodes to keep the voltages within the upper and lower limits. The optimal model is proposed with objective aiming at minimization of voltage deviation, and is distributed solved by applying the gossip algorithm. The proposed method is applied to the distributed voltage control of a typical AC&DC-HMG. The simulation results show that optimal charging and discharging control of EVs connected to the key nodes can regulate the voltage of total AC&DC-HMG dynamically to keep them withing limits with less communications.

关键词： AC and DC hybrid microgrids electric vehicles voltage regulation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed estimation of articulation node importance for robustness of multi-robot systems 57

Distributed estimation of articulation node importance for r...

引用

57th Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE)

作者： Murayama, Toni Wakayama Coll Dept Intelligent Mech Engn Natl Coll Technol Wakayama Japan

ISBN: (纸本)9784907764609

This paper shows a definition of importance of an articulation node in a multi-robot network, and proposes a distributed algorithm to estimate the importance value. Articulation nodes are weak spots of a network, since the network will be disconnected when any of them is failed. However, an amount of the damage to the system is depend on the position of the failure node, that is to say, a centrality of the node. Therefore we define an importance of the articulation node to explain such centrality. Since a calculation of the importance requires the network structure, we propose a distributed algorithm to estimate the importance using a Fiedler vector of the network. Theoretical properties of the Fiedler vector are analyzed to design the estimation algorithm. Numerical examples illustrates the theoretically derived properties, and validity of the proposed method.

关键词： multi-robot system distributed algorithm estimation articulation node

来源：评论

学校读者我要写书评

暂无评论

CONSENSUS OPTIMIZATION FOR distributed REGISTRATION

CONSENSUS OPTIMIZATION FOR DISTRIBUTED REGISTRATION

引用

IEEE Global Conference on Signal and Information Processing (GlobalSIP)

作者： Sanyal, Rajat Chaudhury, Kunal N. KPMG Advisory Serv Private Ltd IGH S&O Gurugram India Indian Inst Sci Dept Elect Engn Bengaluru India

ISBN: (纸本)9781728112954

We consider the problem of jointly registering multiple point sets using rigid transforms. We propose a distributed algorithm based on consensus optimization for the least-squares formulation of this problem. In each iteration, the computation is distributed among the point sets and the results are averaged. For each point set, the dominant cost per iteration is the SVD of a square matrix of size d, where d is the ambient dimension. Existing methods for joint registration are either centralized or perform the optimization sequentially. The proposed algorithm is naturally more scalable than these methods. As an application, we integrate the proposed algorithm within a divide-and-conquer approach for sensor network localization. In particular, we are able to localize very large networks, which are beyond the scope of most existing localization methods.

关键词： sensor network localization registration scalability distributed algorithm consensus optimization

来源：评论

学校读者我要写书评

暂无评论

Coordinated consensus for smart grid economic environmental power dispatch with dynamic communication network

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2018年第11期12卷 2603-2613页

作者： Hamdi, Mounira Chaoui, Mondher Idoumghar, Lhassane Kachouri, Abdennaceur Univ Sfax LETI ENIS St Soukra Sfax 3038 Tunisia UHA LMIA EA 3993 F-68093 Mulhouse France

Combined economic environmental dispatch problem (CEEDP) is one of the greatest challenges of the future smart grids. It aims at reducing the total cost during the power production process considering the growing environmental impact due to the emission of gaseous pollutants of fossil fuels. This study develops a robust distributed algorithm based on consensus protocols in multi-agent systems, to solve the smart grid CEEDP with a practical communication network consisting of a dynamic communication network, randomly communication failure, transmission delay and noise in communication channels. The proposed algorithm is fully distributed and cooperative in such a way that it eliminates the need for a central energy-management unit, or a leader. The performance of the fully decentralised consensus protocol was evaluated on the IEEE 30-bus and the IEEE 118-bus test system. A comparison with previous consensus algorithms proves the supremacy of the proposed approach in terms of its robustness under dynamic communication network with randomly link failure.

关键词： smart power grids load dispatching power system economics environmental factors distributed algorithms protocols multi-agent systems telecommunication channels telecommunication networks decentralised control power engineering computing coordinated consensus protocol smart grid dynamic communication network combined economic environmental dispatch problem CEEDP cost reduction power production process gaseous pollutant emission fossil fuel distributed algorithm multiagent system randomly communication failure transmission delay communication channel central energymanagement unit decentralised consensus protocol IEEE 30 bus test system IEEE 118-bus test system

来源：评论

学校读者我要写书评

暂无评论

distributed Construction of d-hop Connected Dominating Sets for Wireless Sensor Networks

Distributed Construction of <i>d</i>-hop Connected Dominatin...

引用

IEEE Global Conference on Communications (GLOBECOM) / Workshop on Wireless Networking and Control for UAV

作者： Skiadopoulos, Konstantinos Giannakis, Konstantinos Oikonomou, Konstantinos Stavrakakis, Ioannis Aissa, Sonia Ionian Univ Dept Informat Corfu Greece Univ Athens Athens Greece Univ Carlos III Madrid Madrid Spain IMDEA Networks Inst Madrid Spain Univ Quebec Inst Natl Rech Sci INRS EMT Montreal PQ Canada

ISBN: (纸本)9781538647271

Several critical operations such as, data collection, routing, service discovery, etc., employ various types of information dissemination in order to be carried out. To avoid costly flooding-based solutions reaching out to all nodes, it is frequently sufficient that only a proper subset of the nodes (or backbone network) be involved, i.e., the one ensuring that every other node will be at most d hops away from a node belonging to the said subset of nodes. Finding this subset is equivalent to the construction of a d-hop Connected Dominating Set (d-CDS). Given the high complexity (non-polynomial) and the requirement of global information for constructing a Minimum d-CDS (dMCDS), in this paper a distributed algorithm that relies on local information (i.e., d hops away) to construct an approximation of the d-MCDS is developed. The proposed algorithm is studied and compared against a centralized one that is an approximate solution for the minimum d-MCDS problem, and a recently proposed distributed one. It is shown that the size of the constructed d-CDS under the proposed algorithm is (i) close and sometimes smaller than that under the recently proposed one;and (ii) close to the centralized one. In addition, the number of transmitted messages is significantly reduced under the proposed algorithm, which is important for preserving energy resources in wireless sensor networks.

关键词： Minimum Connected Dominating Set distributed algorithm Information Dissemination Wireless Sensor Networks

来源：评论

学校读者我要写书评

暂无评论

distributed Nash Equilibrium Seeking algorithms for Two-Layer Constrained Non-Cooperative Games

Distributed Nash Equilibrium Seeking Algorithms for Two-Laye...

引用

第三十八届中国控制会议

作者： Yao Zou Bomin Huang Ziyang Meng Wei Ren School of Automation and Electrical Engineering University of Science and Technology Beijing Department of Precision Instrument Tsinghua University Department of Electrical and Computer Engineering University of California Riverside

This paper studies the Nash equilibrium seeking problem for two-layer constrained non-cooperative games. In particular, the non-cooperative game among upper-layer clusters is played by lower-layer players therein subject to set constraints. In each cluster, a player is appointed as an administrator who is responsible for interacting with other clusters. A KKT condition is first determined to formulate the underlying generalized Nash equilibrium. Based on such a KKT condition, a distributed seeking algorithm using a projection operator is proposed. In particular, under the assumption that each player has access to the administrators in other clusters, the proposed seeking algorithm via intra-cluster interaction guarantees that each player is capable of seeking its corresponding component of the generalized Nash equilibrium. An illustrative example effectively verifies the proposed theoretical results.

关键词： Non-cooperative game Nash equilibrium seeking distributed algorithm distributed observer

来源：评论

学校读者我要写书评

暂无评论

Optimal distributed Submodular Optimization via Sketching 18

Optimal Distributed Submodular Optimization via Sketching

引用

24th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)

作者： Bateni, MohammadHossein Esfandiari, Hossein Mirrokni, Vahab Google New York NY 10011 USA Harvard Univ Cambridge MA 02138 USA

ISBN: (纸本)9781450355520

We present distributed algorithms for several classes of submodular optimization problems such as k-cove r, set cover, facility location, and probabilistic coverage. The new algorithms enjoy almost optimal space complexity, optimal approximation guarantees, optimal communication complexity (and run in only four rounds of computation), addressing major shortcomings of prior work. We first present a distributed algorithm for k-cover using only a(n) space per machine, and then extend it to several submodular optimization problems, improving previous results for all the above problems e.g., our algorithm for faci I ity location problem improves the space of the best known algorithm (Lindgren et al. [26]). Our algorithms are implementable in various distributed frameworks such as MapReduce and RAM models. On the hardness side we demonstrate the limitations of uniform sampling via an information theoretic argument. Furthermore, we perform an extensive empirical study of our algorithms (implemented in MapReduce) on a variety of datasets. We observe that using sketches 30-600 times smaller than the input, one can solve the coverage maximization problem with quality very close to that of the state-of-the-art single-machine algorithm. Finally, we demonstrate an application of our algorithm in largescale feature selection.

关键词： submodular maximization distributed algorithm dominating set set cover

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：