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

IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Hyongju Park Seth Hutchinson Department of Mechanical and Science Engineering at the University of Illinois. Electrical and Computer Engineering at the University of Illinois.

ISBN: (纸本)9781467363563

In this paper, we consider the performance of distributed control algorithms for networked robotic systems when one or more robots fail to execute the optimal policy. In particular, we investigate the performance of the circumcenter algorithm with connectivity maintenance [1]-[3] when one or more adversarial agents act maliciously to maximally disrupt convergence of the remaining, cooperative agents. To this end, we formulate a performance objective for each adversary node in terms of the circumradii of its cooperative neighbors in a communication graph which does not require omniscience of adversaries as is often assumed in the literature (e.g., [4], [5]). We provide an optimization algorithm based on finite-horizon dynamic programming, and obtain solutions through numerical simulation. Our results show that in general adversarial nodes are able not only to impede convergence toward consensus, but can also affect global changes in the topology of the communication graph for the cooperative agents.

关键词： circumcenter algorithm communication graph cooperative agents rendezvous Ganglia Converge optimization algorithms Agents optimal strategy Circumcentre Line graph

来源：评论

学校读者我要写书评

暂无评论

Complexity order of multiple resource algorithms

arXiv

引用

arXiv 2024年

作者： Teh, Run Yan Thenabadu, Manushan Drummond, Peter D. Centre for Quantum Science and Technology Theory Swinburne University of Technology Melbourne3122 Australia

Algorithmic efficiency is essential to reducing energy use and time taken for computational problems. Optimizing efficiency is important for tasks involving multiple resources, for example in stochastic calculations where the size of the random ensemble competes with the time-step. We define the complexity order of an algorithm needing multiple resources as the exponent of inverse total error with respect to the total resources used. The optimum order c is predicted for cases involving competing, factorable resources. As an illustration, this is applied to computing averages in a stochastic differential equation, with numerical examples that agree with earlier literature, as well as with the more general analytic theory that is obtained here. Copyright © 2024, The Authors. All rights reserved.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

A preconditioned second-order convex splitting algorithm with a difference of varying convex functions and line search

arXiv

引用

arXiv 2024年

作者： Shen, Xinhua Shang, Zaijiu Sun, Hongpeng School of Mathematics Renmin University of China China Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Shanghai Institute for Mathematics and Interdisciplinary Sciences Shanghai200092 China

This paper introduces a preconditioned convex splitting algorithm enhanced with line search techniques for nonconvex optimization problems. The algorithm utilizes second-order backward differentiation formulas (BDF) for the implicit and linear components and the Adams-Bashforth scheme for the nonlinear and explicit parts of the gradient flow in variational functions. The proposed algorithm, resembling a generalized difference-of-convex-function approach, involves a changing set of convex functions in each iteration. It integrates the Armijo line search strategy to improve performance. The study also discusses classical preconditioners such as symmetric Gauss-Seidel, Jacobi, and Richardson within this context. The global convergence of the algorithm is established through the Kurdyka-Lojasiewicz properties, ensuring convergence within a finite number of preconditioned iterations. Numerical experiments demonstrate the superiority of the proposed second-order convex splitting with line search over conventional difference-of-convex-function algorithms. © 2024, CC BY-NC-ND.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Dynamic Dimension Wrapping (DDW) Algorithm: A Novel Approach for Efficient Cross-Dimensional Search in Dynamic Multidimensional Spaces

arXiv

引用

arXiv 2024年

作者： Jin, Dongnan Liu, Yali Song, Qiuzhi Ma, Xunju Liu, Yue Wu, Dehao School of Mechatronical Engineering Beijing Institute of Technology Beijing100081 China Advanced Technology Research Institute Beijing Institute of Technology Jinan250300 China

To effectively search for the optimal motion template in dynamic multidimensional space, this paper proposes a novel optimization algorithm, Dynamic Dimension Wrapping (DDW). The algorithm combines Dynamic Time Warping (DTW) and Euclidean distance, and designs a fitness function that adapts to dynamic multidimensional space by establishing a time-data chain mapping across dimensions. This paper also proposes a novel update mechanism-Optimal Dimension Collection (ODC), combined with the search strategy of traditional optimization algorithms, enables DDW to adjust both the dimension values and the number of dimensions of the population individuals simultaneously. In this way, DDW significantly reduces computational complexity and improves search accuracy. Experimental results show that DDW performs excellently in dynamic multidimensional space, outperforming 31 traditional optimization algorithms. This algorithm provides a novel approach to solving dynamic multidimensional optimization problems and demonstrates broad application potential in fields such as motion data analysis. Copyright © 2024, The Authors. All rights reserved.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Cloud-based Model Predictive Building Thermostatic Controls of Commercial Buildings: Algorithm and Implementation

Cloud-based Model Predictive Building Thermostatic Controls ...

引用

American Control Conference

作者： Emrah Biyik James D. Brooks Hullas Sehgal Jigar Shah Sahika Genc Department of Energy Systems Engineering Yasar University Izmir Turkey GE Global Research Niskayuna NY USA

ISBN: (纸本)9781479917730

The contribution of this paper is in two-folds: 1) If more predictive and intelligent control of the thermostat setpoints with no explicit models of Root Top Units (RTUs) yet with simplistic lumped parameter thermal models of buildings can be effective in reducing a small commercial buildings summer-time peak load while adequately maintaining comfort levels, and 2) how this simplistic indirect control approach to RTUs compare to more sophisticated direct control approaches in terms of peak-load reduction and cost. First, the model-predictive control approach is presented. Second, the results of cloud-based implementation of the optimization algorithm at the two demonstration commercial buildings owned by General Electric (GE), optimizer characteristics, different set point trajectories and their implication with regards to peak load and comfort, and observations are described. On average, the savings from the indirect optimal control strategy utilized in our approach through a cloud-based control implementation architecture is shown to be comparable to previously stated savings in literature from more sophisticated direct optimal control of RTUs while the comfort levels are the same as the non-optimal strategy or slightly better in some cases.

关键词： Comfort level commercial buildings maximum loads optimization algorithms Buildings Direct control Intelligent control COMFORT Optimal control

来源：评论

学校读者我要写书评

暂无评论

Recursive Joint Transmit and Receive Antenna Selection in Spatial Multiplexing Systems

Recursive Joint Transmit and Receive Antenna Selection in Sp...

引用

IEEE Vehicular Technology Conference

作者： Liang Zhou Yoji Ohashi Fujitsu Laboratories Ltd. 4-1-1 Kamikodanaka Nakahara-ku Kawasaki-shi Kanagawa 211-8588 Japan

ISBN: (纸本)9781467363365

In this paper we investigate low complexity joint transmit and receive antenna selection (JTRAS) algorithms for wireless spatial multiplexing (SM) systems. Unlike the conventional JTRAS algorithms that mainly use capacity maximization based criterion, we propose a general method for joint transmit and receive antenna selection according to different selection criteria, including minimum mean square error (MMSE), maximum minimum signal-to-interference-plus-noise ratio (SINR), and maximum capacity. The proposed method for different selection criteria is based on the calculation of matrix inverse and the recursive matrix inverse update is developed to reduce computational complexity. Extensive simulation results show that our algorithms perform very close to the optimal exhaustive search algorithms and better than or equivalent to the suboptimal algorithms in terms of bit error rate (BER) and ergodic capacity in both the uncorrelated and highly correlated MIMO channels, while the computational complexity is much lower than the optimal algorithms.

关键词： Matrix inverse update JTRAS optimum antenna selection spatial multiplexing space division multiplexing multiplex system Receiving antennas Inverse matrix TRANSMITTING optimization algorithms complexity classes Recursive

来源：评论

学校读者我要写书评

暂无评论

Treatment of Transformers and Voltage Regulators in Branch Current State Estimation for Distribution Networks

Treatment of Transformers and Voltage Regulators in Branch C...

引用

IEEE Power and Energy Society General Meeting

作者： M. Houari I. Kocar F. Therrien J. S. Lacroix école Polytechnique de Montréal QC Canada the University of British Columbia Cooper Power Systems

ISBN: (纸本)9781479913022

The branch current state estimators available in the existing literature consider the distribution networks as composed of lines and cables. In this paper, a general technique is demonstrated in order to handle other key distribution network components such as transformers and voltage regulators. It is also demonstrated how to consider the tap positions of transformers and regulators as state variables in the estimation process given that they are rarely telemetered. The performance of iterative optimization algorithms depends strongly on the initial solution. In this paper, the load allocation algorithm is used in order to obtain an initial solution and associate loads with pseudo-measurements. The latter step is necessary in order to assure observability of the network. The load allocation algorithm used in this study is a straightforward tool based on ladder iterative algorithm.

关键词： Branch currents distribution networks State Estimator (SE) tap position Weighted Least Squares (WLS) Power grids shunt current Transformer Voltage regulators tapping position optimization algorithms load allocation

来源：评论

学校读者我要写书评

暂无评论

Improved Migratory Birds Optimisation Algorithm to Solve Low-Carbon Hybrid Lot-Streaming Flowshop Scheduling Problem

Improved Migratory Birds Optimisation Algorithm to Solve Low...

引用

World Congress on Computing and Communication Technologies (WCCCT)

作者： Wang Ping Hong-Yan Sang Qiu-Yun Tao Sun Qun School of Computer Science Liaocheng University Liaocheng China School of Mechanical & Automotive Engineering Liaocheng University Liaocheng China

ISBN: (数字)9781728197388

ISBN: (纸本)9781728197395

Under low-carbon scheduling, to solve the hybrid lot-streaming flowshop scheduling (HLFS) problem, an improved migrating birds optimisation (IMBO) algorithm is proposed to minimise the total flow time. The neighbourhood solution of the population is generated by insertion and exchange, and the population is further optimised by a local search method. In addition, a reset mechanism is added to avoid falling into a local optimum. Extensive computational results demonstrate the feasibility and effectiveness of the proposed algorithm.

关键词： lot-streaming hybrid flowshop scheduling low-carbon migrating birds optimisation algorithm low-carbon Search methods reset mechanism optimization algorithms migrant bird Population falls Falling Solve

来源：评论

学校读者我要写书评

暂无评论

Cyclades: Conflict-free Asynchronous Machine Learning 16

Cyclades: Conflict-free Asynchronous Machine Learning

引用

Annual Conference on Neural Information Processing Systems

作者： Xinghao Pan Maximilian Lam Stephen Ti Dimitris Papailiopoulos Ce Zhang Michael I. Jordan Kannan Ramchandran Chris Re Benjamin Recht Department of Electrical Engineering and Computer Science UC Berkeley Berkeley CA Department of Computer Science Stanford University Palo Alto CA Department of Electrical Engineering and Computer Science UC Berkeley Berkeley CADepartment of Statistics UC Berkeley Berkeley CA

ISBN: (纸本)9781510838819

We present Cyclades, a general framework for parallelizing stochastic optimization algorithms in a shared memory setting. Cyclades is asynchronous during model updates, and requires no memory locking mechanisms, similar to Hog-??wild!-type algorithms. Unlike HOGWILD!, Cyclades introduces no conflicts during parallel execution, and offers a black-box analysis for provable speedups across a large family of algorithms. Due to its inherent cache locality and conflict-??free nature, our multi-core implementation of Cyclades consistently outperforms Hogwild!-type algorithms on sufficiently sparse datasets, leading to up to 40% speedup gains compared to Hogwild!, and up to 5× gains over asynchronous implementations of variance reduction algorithms.

关键词： Cyclades Asynchronous parallel execution shared memory large family asynchronous machines optimization algorithms Model updating Conflict (Psychology) algorithms

来源：评论

学校读者我要写书评

暂无评论

Block and Group Regularized Sparse Modeling for Dictionary Learning

Block and Group Regularized Sparse Modeling for Dictionary L...

引用

IEEE Conference on Computer Vision and Pattern Recognition

作者： Yu-Tseh Chi Mohsen Ali Ajit Rajwade Jeffrey Ho University of Florida Gainesville FL U. S. A. Dhirubhai Ambani Institute of Information and Communication Technology Gandhinagar India

ISBN: (纸本)9781467364102

This paper proposes a dictionary learning framework that combines the proposed block/group (BGSC) or reconstructed block/group (R-BGSC) sparse coding schemes with the novel Intra-block Coherence Suppression Dictionary Learning (ICS-DL) algorithm. An important and distinguishing feature of the proposed framework is that all dictionary blocks are trained simultaneously with respect to each data group while the intra-block coherence being explicitly minimized as an important objective. We provide both empirical evidence and heuristic support for this feature that can be considered as a direct consequence of incorporating both the group structure for the input data and the block structure for the dictionary in the learning process. The optimization problems for both the dictionary learning and sparse coding can be solved efficiently using block-gradient descent, and the details of the optimization algorithms are presented. We evaluate the proposed methods using well-known datasets, and favorable comparisons with state-of-the-art dictionary learning methods demonstrate the viability and validity of the proposed framework.

关键词： BGSC R-BGSC ICS-DL Dictionaries as Topic Masonry construction Group Structure Sparse coding optimization algorithms data grouping

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：