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

Robust Hybrid Cooperative Positioning Via a Modified distributed Projection-Based Method

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2020年第5期19卷 3003-3018页

作者： Liu, Tianwei Li, Guangxia Li, Li Li, Siming Tian, Shiwei Army Engn Univ PLA Coll Commun Engn Nanjing 210000 Peoples R China

Cooperative positioning is attracting an increasing amount of attention due to its ability to enhance the accuracy and availability of positioning performance. Current algorithms for cooperative positioning are sensitive to the initial guess as a result of their nonconvex objective functions, which is especially true in hybrid wireless networks. Perfect a priori information about the locations is needed, which is rather problematic in many scenarios. With strong convergence, the iterative parallel projection method (IPPM) is extended to hybrid wireless networks (H-IPPM) in this paper. Motivated by the fact that normal weighted methods cannot achieve the optimal solution, the position uncertainty is modeled, and two distributed weighted parallel projection algorithms, namely, an inexact weighted algorithm called the HBFW-IPPM and an exact weighted algorithm called the HCPW-IPPM, are developed when considering both the range measurement errors and position uncertainty. Experiments in a realistic outdoor scenario are conducted. The results indicate that the exact weighted algorithm HCPW-IPPM shows superior and robust performance in both warm-start and cold-start conditions, and this is true even when non-line of sight (NLOS) measurements and weight estimation errors are taken into account.

关键词： Cooperative positioning weighted parallel projection position uncertainty distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed resource allocation: an indirect dual ascent method with an exponential convergence rate

引用

NONLINEAR DYNAMICS 2020年第3期102卷 1685-1699页

作者： Lin, Wen-Ting Wang, Yan-Wu Li, Chaojie Yu, Xinghuo Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Key Lab Image Proc & Intelligent Control Minist Educ Wuhan Peoples R China UNSW Sch Elect Engn & Telecommun Kingston NSW 2052 Australia RMIT Univ Sch Engn Melbourne Vic 3000 Australia

In this paper, an indirect dual ascent method with an exponential convergence rate is proposed for a general resource allocation problem with convex objectives and weighted constraints. By introducing the indirect dual variables, the dual dynamics can be executed in a decentralized manner by all nodes over the network. In contrast to the conventional methods, consensus on all the dual variables is not required. This further leads to the fast convergence, reduced communication burden and better privacy preserving. Moreover, the exponential convergence rate of the proposed algorithm is established through the Lyapunov method and the singular perturbation theory. Application of the dynamic power dispatch problem in smart grid verifies the effectiveness and performance of the proposed algorithm.

关键词： Resource allocation Dual ascent dynamics distributed algorithm Exponential convergence

来源：评论

学校读者我要写书评

暂无评论

USCDRP: unequal secure cluster-based distributed routing protocol for wireless sensor networks

引用

JOURNAL OF SUPERCOMPUTING 2020年第2期76卷 989-1004页

作者： Vijayalakshmi, V. Senthilkumar, A. MGR Coll Dept Comp Sci Hosur India Arignar Anna Govt Arts Coll Dept Comp Sci Namakkal India

In the last decade, parallel computing techniques become more popular and offer various architectures to perform diverse processes in an individual computing node or a collection of strongly linked nodes with homogeneous hardware. In this paper, we propose a distributed secure unequal cluster-based multipath routing protocol (USCDRP) for improving the energy efficiency and also to enhance the security as well as reliability. The presented USCDRP is the enhanced work of SCMRP, which provides the security to a particular extent. The presented method offers reliability, energy efficiency and maximum lifetime. Besides, an independent clustering method is provided to eliminate the orphan nodes and cluster maintenance strategy to enhance the network lifetime. A detailed experimental analysis ensured the superiority of the USCDRP over the compared methods concerning throughput, energy efficiency and network lifetime analysis. The simulation outcome indicated that all the nodes in WSN become dead node, and the network becomes inactive in the round number of 2021 by Sec-LEACH, 2412 by SCMRP and 3245 by USCDRP.

关键词： Parallel Computing Urban big data distributed algorithm Hot spot problem Clustering Security Multihop communication

来源：评论

学校读者我要写书评

暂无评论

Swarm-based painting of an area cluttered with obstacles

引用

INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND distributed SYSTEMS 2021年第4期36卷 359-379页

作者： Das, Deepanwita Mukhopadhyaya, Srabani Nandi, Debashis Natl Inst Technol Durgapur Dept Comp Sci & Engn Durgapur 713209 W Bengal India Birla Inst Technol Mesra Lalpur Extens Ctr Ranchi Bihar India

This article studies the problem of painting of a rectangular region cluttered with horizontal obstacles, by a swarm of mobile robots. Initially, the robots are deployed randomly within the target area. From the initial configuration, the robots are assembled on the left boundary of the region. Upon assembling on the left boundary, the robots first explore the entire area collectively to make a virtual partition of it and then collectively paint the target region in a subsequent phase. The proposed algorithm assumes that robots work in look-compute-move model. The robots follow a completely distributed algorithm to paint the region. The robots are either synchronous or semi-synchronous. The outcome of the proposed algorithm is a complete painting of an area without any repetition and collision. [GRAPHICS] .

关键词： distributed algorithm assembling coverage presence of obstacles robot swarm

来源：评论

学校读者我要写书评

暂无评论

Zero-carbon-driven multi-energy coordinated sharing model for building cluster

引用

JOURNAL OF CLEANER PRODUCTION 2023年 430卷

作者： Gao, Hongjun Wang, Leilei He, Shuaijia Liu, Junyong Sichuan Univ Coll Elect Engn Chengdu 610065 Peoples R China

The energy sharing among different intelligent buildings can improve renewable energy consumption and reduce carbon emission. However, the evaluation of the low carbon value of energy sharing is insufficient. Considering the different percentage of generated power of energy production units on the energy supply side during different periods, this study is the first to use time-of-use carbon emission evaluation factor to calculate the carbon emissions generated by buildings purchasing energy from upper-level networks. Then, an incentive-based carbon reward and punishment model is proposed based on the evaluation model. Meanwhile, operation decision models for different types of intelligent buildings are proposed. The optimal strategies for peer-to-peer energy sharing for intelligent buildings are obtained by the distributed algorithm. Results show that (1) The time-of-use carbon emission evaluation factor can facilitate the change of equipment output and energy consumption plans in buildings, and further improve the benefits of multi-energy sharing. (2) The proposed incentive-based carbon reward and punishment method shows greater advantages in reducing carbon emissions of high carbon emission buildings compared to the traditional carbon reward and punishment method. Although the benefits of some low carbon emission buildings with the proposed method may be sacrificed, CO2 emissions reduce by 7% for the entire building cluster.

关键词： Intelligent buildings Multi -energy sharing Time -of -use carbon emission evaluation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

The agreement power of disagreement

引用

THEORETICAL COMPUTER SCIENCE 2023年 954卷

作者： Bramas, Quentin Lamani, Anissa Tixeuil, Sebastien Strasbourg Univ ICUBE CNRS Strasbourg France Sorbonne Univ Inst Univ France CNRS LIP6 Paris France

We consider the rendezvous problem of two autonomous robots with very weak capacities. This problem is notoriously impossible to solve in the semi-synchronous execution model when robots are deterministic, oblivious, and their ego-centered coordinate system is fully symmetric. We show that if the robots disagree on the unit distance of their coordinate system, it becomes possible to solve rendezvous and agree on a final common location, without additional assumptions. We also generalize our scheme to solve gathering (that is, rendezvous of n >= 2 robots) in the same setting, possibly starting from a bivalent configuration. (c) 2023 Published by Elsevier B.V.

关键词： Mobile robots Rendezvous Gathering distributed algorithm Bivalent configuration

来源：评论

学校读者我要写书评

暂无评论

Finite time convergence of pinning synchronization with a single nonlinear controller

引用

NEURAL NETWORKS 2021年 143卷 246-249页

作者： Chen, Tianping Lu, Wenlian Liu, Xiwei Fudan Univ Sch Comp Sci Math Shanghai 200433 Peoples R China Fudan Univ Ctr Computat Syst Biol Shanghai Peoples R China Tongji Univ Dept Comp Sci & Technol Shanghai Peoples R China Minist Educ Key Lab Embedded Syst & Serv Comp Shanghai 200092 Peoples R China

In this paper, we discuss distributive synchronization of complex networks in finite time, with a single nonlinear pinning controller. The results apply to heterogeneous dynamic networks, too. Different from many models, which assume the coupling matrix being symmetric (or the connecting graph is undirected), here, the coupling matrix is asymmetric (or the connecting graph is directed). (C) 2021 Elsevier Ltd. All rights reserved.

关键词： Finite time convergence distributed algorithm Pinning controller Synchronization

来源：评论

学校读者我要写书评

暂无评论

Communication costs in a geometric communication network *,**,***

引用

THEORETICAL COMPUTER SCIENCE 2023年 977卷

作者： Shanjani, Sima Hajiaghaei King, Valerie Univ Victoria Dept Comp Sci Victoria BC Canada

We represent a communication network as a graph in which each node has only local information about the graph, except for an upper bound on the number of nodes, and nodes communicate by passing messages along its edges. Here, we consider a geometric communication network where the nodes also occupy points in space and the distance between points is the Euclidean distance. Our goal is to understand the communication cost needed to solve several fundamental geometry problems, including Farthest Pair, Convex Hull, Closest Pair, and approximations of these problems, in the asynchronous CONGEST KT1 model, where each node knows its ID and those of its neighbors. This extends the 2011 result of Rajsbaum and Urrutia for finding a convex hull of a planar geometric communication network to networks of arbitrary topology. We define a new model where each node has a position on the plane and nodes can communicate to each other if and only if there is an edge between them. We motivate the model and study a number of geometric problems in this model. We prove lower bounds on the communication complexity of the problems in this new model and present approximation algorithms for them. We prove lower bounds on the number of expected bits required for any randomized algorithm to solve the problems. (c) 2023 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons .org /licenses /by /4 .0/).

关键词： distributed algorithm CONGEST Communication complexity Farthest pair Convex hull Closest pair

来源：评论

学校读者我要写书评

暂无评论

distributed energy trading for an integrated energy system and electric vehicle charging stations: A Nash bargaining game approach

引用

RENEWABLE ENERGY 2020年 155卷 513-530页

作者： Wang, Yifei Wang, Xiuli Shao, Chengcheng Gong, Naiwei Xi An Jiao Tong Univ Sch Elect Engn Xian Peoples R China

The increasing concerns of energy utilization and climate change have promoted the permeation of various smart energy subsystems on the distribution level, such as integrated energy systems (IESs) and electric vehicle charging stations (EVCSs). These subsystems typically act separately during operation and their transaction values have not yet been well investigated. In this paper, we propose an energy trading model based on the Nash bargaining game to study cooperative benefits between an IES and several EVCSs. The proposed model not only considers individual interests, but also enables the players to fairly benefit from cooperation. In particular, the uncertainties of the market prices, renewable energies and integrated demand response are considered. To ensure that the entire game is computationally tractable, the original problem is decomposed into a major energy trading problem and an additional payment bargaining problem. Furthermore, a distributed algorithm based on modified Benders decomposition is used to overcoming the players' privacies. The results show the considerable benefits where the costs of the IES may be reduced by 3.89% and the profits associated with the EVCSs may be increased by at least 7.8%. The proposed algorithm is proven to be able to find the optimal global solutions efficiently and accurately. (C) 2020 Elsevier Ltd. All rights reserved.

关键词： Integrated energy systems Electric vehicle charging stations Nash bargaining theory distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A Provably Communication-Efficient Asynchronous distributed Inference Method for Convex and Nonconvex Problems

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2020年 68卷 3325-3340页

作者： Ren, Jineng Haupt, Jarvis Univ Minnesota Dept Elect & Comp Engn Minneapolis MN 55455 USA

This paper proposes and analyzes a communication-efficient distributed optimization framework for general nonconvex nonsmooth signal processing and machine learning problems under an asynchronous protocol. At each iteration, worker machines compute gradients of a known empirical loss function using their own local data, and a master machine solves a related minimization problem to update the current estimate. We prove that for nonconvex nonsmooth problems, the proposed algorithm converges to a stationary point with a sublinear rate over the number of communication rounds, coinciding with the best theoretical rate that can be achieved for this class of problems. Linear convergence to a global minimum is established without any statistical assumptions on the local data for problems characterized by composite loss functions whose smooth part is strongly convex. Extensive numerical experiments verify that the performance of the proposed approach indeed improves - sometimes significantly - over other state-of-the-art algorithms in terms of total communication efficiency.

关键词： Signal processing algorithms Convergence Optimization distributed algorithms Machine learning Principal component analysis Network topology Communication-efficiency asynchronous distributed algorithm convergence nonconvex strongly convex

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：