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

Optimized Weighted Ensemble Using Dipper Throated Optimization Algorithm in Metamaterial Antenna

Computers, Materials & Continua 2022年第12期73卷 5771-5788页

作者： Doaa Sami Khafaga El-Sayed M.El-kenawy Faten Khalid Karim Sameer Alshetewi Abdelhameed Ibrahim Abdelaziz AAbdelhamid Department of Computer Sciences College of Computer and Information SciencesPrincess Nourah bint Abdulrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia Department of Communications and Electronics Delta Higher Institute of Engineering and TechnologyMansoura35111Egypt Faculty of Artificial Intelligence Delta University for Science and TechnologyMansoura35712Egypt General Information Technology Department Ministry of DefenseThe Executive AffairsExcellence Services DirectorateRiyadh11564Saudi Arabia Computer Engineering and Control Systems Department Faculty of EngineeringMansoura UniversityMansoura35516Egypt Department of Computer Science Faculty of Computer and Information SciencesAin Shams UniversityCairo11566Egypt Department of Computer Science College of Computing and Information TechnologyShaqra University11961Saudi Arabia

Metamaterial Antennas are a type of antenna that uses metamaterial to enhance *** bandwidth restriction associated with small antennas can be solved using metamaterial *** learning is gaining popularity as a way to improve solutions in a range of *** learning approaches are currently a big part of current research,and they’re likely to be huge in the *** model utilized determines the accuracy of the prediction in large *** goal of this paper is to develop an optimized ensemble model for forecasting the metamaterial antenna’s bandwidth and *** basic models employed in the developed ensemble are Support Vector Regression(SVR),K-NearestRegression(KNR),Multi-Layer Perceptron(MLP),Decision Trees(DT),and Random Forest(RF).The percentages of contribution of these models in the ensemble model are weighted and optimized using the dipper throated optimization(DTO)*** choose the best features from the dataset,the binary(bDTO)algorithm is *** proposed ensemble model is compared to the base models and results are recorded and analyzed *** addition,two other ensembles are incorporated in the conducted experiments for *** ensembles are average ensemble and K-nearest neighbors(KNN)-based *** comparison is performed in terms of eleven evaluation *** evaluation results confirmed the superiority of the proposed model when compared with the basic models and the other ensemble models.

关键词： Metamaterial antenna dipper throated optimization feature selection parameters prediction

来源：评论

学校读者我要写书评

暂无评论

Quantum state and detector tomography with known rank

引用

IFAC-PapersOnLine 2023年第2期56卷 5881-5887页

作者： Shuixin Xiao Yuanlong Wang Jun Zhang Daoyi Dong Hidehiro Yonezawa School of Engineering and Information Technology University of New South Wales Canberra ACT 2600 Australia University of Michigan - Shanghai Jiao Tong University Joint Institute Shanghai Jiao Tong University Shanghai 200240 China Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100190 China Centre for Quantum Computation and Communication Technology Australian Research Council Canberra ACT 2600 Australia

Quantum state tomography and quantum detector tomography are two main problems in quantum system identification. In this paper, we study state tomography and detector tomography with prior knowledge about the true rank of the unknown state/detector. In this case, we propose a sufficient condition for static (non-adaptive) tomography algorithms to achieve the optimal infidelity scaling O(1/N) on the number of state copies N. Then we present two examples of such static quantum state tomography and quantum detector tomography algorithms. Numerical examples demonstrate the effectiveness of our algorithms.

关键词： Quantum system identification quantum state tomography quantum detector tomography

来源：评论

学校读者我要写书评

暂无评论

Training robust neural networks using Lipschitz bounds

arXiv

引用

arXiv 2020年

作者： Pauli, Patricia Koch, Anne Berberich, Julian Kohler, Paul Allgöwer, Frank The Institute for Systems Theory and Automatic Control University of Stuttgart Germany

Due to their susceptibility to adversarial perturbations, neural networks (NNs) are hardly used in safety-critical applications. One measure of robustness to such perturbations in the input is the Lipschitz constant of the input-output map defined by an NN. In this work, we propose a framework to train multi-layer NNs while at the same time encouraging robustness by keeping their Lipschitz constant small, thus addressing the robustness issue. More specifically, we design an optimization scheme based on the Alternating Direction Method of Multipliers that minimizes not only the training loss of an NN but also its Lipschitz constant resulting in a semidefinite programming based training procedure that promotes robustness. We design two versions of this training procedure. The first one includes a regularizer that penalizes an accurate upper bound on the Lipschitz constant. The second one allows to enforce a desired Lipschitz bound on the NN at all times during training. Finally, we provide two examples to show that the proposed framework successfully increases the robustness of NNs. Copyright © 2020, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Distributed Optimization for Quadratic Cost Functions over Large-Scale Networks with Quantized Communication and Finite-Time Convergence

arXiv

引用

arXiv 2023年

作者： Rikos, Apostolos I. Grammenos, Andreas Kalyvianaki, Evangelia Hadjicostis, Christoforos N. Charalambous, Themistoklis Johansson, Karl H. The Division of Decision and Control Systems KTH Royal Institute of Technology StockholmSE-100 44 Sweden The Department of Computer Science and Technology University of Cambridge Cambridge United Kingdom The Alan Turing Institute London United Kingdom The Department of Electrical and Computer Engineering School of Engineering University of Cyprus Nicosia1678 Cyprus

We propose two distributed iterative algorithms that can be used to solve, in finite time, the distributed optimization problem over quadratic local cost functions in large-scale networks. The first algorithm exhibits synchronous operation whereas the second one exhibits asynchronous operation. Both algorithms share salient features. Specifically, the algorithms operate exclusively with quantized values, which means that the information stored, processed and exchanged between neighboring nodes is subject to deterministic uniform quantization. The algorithms rely on event-driven updates in order to reduce energy consumption, communication bandwidth, network congestion, and/or processor usage. Finally, once the algorithms converge, nodes distributively terminate their operation. We prove that our algorithms converge in a finite number of iterations to the exact optimal solution depending on the quantization level, and we present applications of our algorithms to (i) optimal task scheduling for data centers, and (ii) global model aggregation for distributed federated learning. We provide simulations of these applications to illustrate the operation, performance, and advantages of the proposed algorithms. Additionally, it is shown that our proposed algorithms compare favorably to algorithms in the current literature. Quantized communication and asynchronous updates increase the required time to completion, but finite-time operation is maintained. © 2023, CC BY.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Scheduling and control over networks using MPC with time-varying terminal ingredients

Scheduling and control over networks using MPC with time-var...

引用

American control Conference

作者： Stefan Wildhagen Frank Allgower Institute for Systems Theory and Automatic Control University of Stuttgart Germany

ISBN: (数字)9781538682661

ISBN: (纸本)9781538682678

Rollout approaches are an effective tool to address the problem of co-designing the transmission schedule and the corresponding input values, when the controller is connected to the plant via a resource-constrained communication network. These approaches typically employ an MPC, activated at multiples of the period length of a base transmission schedule. Using multi-step invariant terminal regions and a prediction horizon longer than the base period, stability can be ensured. This strategy, however, suffers from intrinsic shortcomings, such as a high computational complexity and low robustness. We aim to resolve these drawbacks by proposing an MPC with periodically time-varying terminal region and cost for the rollout setup, where the controller is activated at each time instant and features an arbitrary but fixed prediction horizon. We consider in more detail two specific setups from the literature on Networked control systems, namely the token bucket network and actuator scheduling. For both setups, we provide conditions for which convergence under application of the time-varying MPC can be guaranteed. In a numerical example, we demonstrate the benefits of the proposed method.

关键词： duration of menstrual flow time varying controllers application time networks(communications) complexity classes Network numerical example

来源：评论

学校读者我要写书评

暂无评论

Obstacle-Avoidance Motion Planning Method of Manipulator Based on Deep Reinforcement Learning

引用

Unmanned systems 2025年

作者： Liu, Yiyang Wu, Defan Fu, Yukai Bai, Hongfei Deng, Chao State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China Key Laboratory of Networked Control Systems Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang110169 China University of Chinese Academy of Sciences Beijing100049 China Institute of Advanced Technology Nanjing University of Posts and Telecommunications Nanjing210023 China

In recent years, driven by the rapid advancement of industrial automation and intelligent manufacturing, the demand for manipulators to perform tasks in complex environments has significantly increased. Traditional motion planning methods face challenges of computational complexity and lack of adaptability when handling robots with redundant degrees of freedom. To address these issues, this paper proposes a novel obstacle avoidance motion planning method for manipulators based on deep reinforcement learning (DRL), which is especially important when unmanned systems operate in a GPS-free environment. The primary contributions are twofold: (i) we propose an innovative algorithm, termed PPO-HER, which incorporates hindsight experience replay (HER) into proximal policy optimization (PPO) during training, effectively leveraging failed experiences to enhance policy learning efficiency;(ii) an adaptive action exploration strategy is designed to accelerate training convergence and avoid local optima. Experimental results demonstrate that the PPO-HER algorithm and the adaptive action exploration strategy perform exceptionally well across three environments of varying difficulty, significantly improving network training speed and success rates, shortening planned paths, and enhancing autonomous obstacle avoidance capabilities. These findings provide new ideas for target location and tracking of unmanned systems, and lay the foundation for future learning and data-driven approaches in complex environments. © World Scientific Publishing Company.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Distributed Filtering under Mismatched Noise Covariances

arXiv

引用

arXiv 2024年

作者： Lyu, Xiaoxu Wen, Guanghui Shi, Ling Duan, Peihu Duan, Zhisheng The Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong The Laboratory of Security Operation and Control for Intelligent Autonomous Systems Department of Systems Science School of Mathematics Southeast University Nanjing211189 China School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden State Key Laboratory for Turbulence and Complex Systems Department of Mechanics and Engineering Science College of Engineering Peking University Beijing100871 China

This paper systematically investigates the performance of consensus-based distributed filtering under mismatched noise covariances. First, we introduce three performance evaluation indices for such filtering problems, namely the standard performance evaluation index, the nominal performance evaluation index, and the estimation error covariance. We derive difference expressions among these indices and establish one-step relations among them under various mismatched noise covariance scenarios. We particularly reveal the effect of the consensus fusion on these relations. Furthermore, the recursive relations are introduced by extending the results of the one-step relations. Subsequently, we demonstrate the convergence of these indices under the collective observability condition, and show this convergence condition of the nominal performance evaluation index can guarantee the convergence of the estimation error covariance. Additionally, we prove that the estimation error covariance of the consensus-based distributed filter under mismatched noise covariances can be bounded by the Frobenius norms of the noise covariance deviations and the trace of the nominal performance evaluation index. Finally, the effectiveness of the theoretical results is verified by numerical simulations. Copyright © 2024, The Authors. All rights reserved.

关键词： Wiener filtering

来源：评论

学校读者我要写书评

暂无评论

Data-driven Polytopic Output Synchronization of Heterogeneous Multi-agent systems from Noisy Data

arXiv

引用

arXiv 2023年

作者： Li, Yifei Liu, Wenjie Sun, Jian Wang, Gang Xie, Lihua Chen, Jie The National Key Lab of Autonomous Intelligent Unmanned Systems Beijing Institute of Technology Beijing100081 China The Beijing Institute of Technology Chongqing Innovation Center Chongqing401120 China School of Electrical and Electronic Engineering Nanyang Technological University Singapore The Department of Control Science and Engineering Tongji University Shanghai201804 China

This paper proposes a novel approach to addressing the output synchronization problem in unknown heterogeneous multi-agent systems (MASs) using noisy data. Unlike existing studies that focus on noiseless data, we introduce a distributed data-driven controller that enables all heterogeneous followers to synchronize with a leader’s trajectory. To handle the noise in the state-input-output data, we develop a data-based polytopic representation for the MAS. We tackle the issue of infeasibility in the set of output regulator equations caused by the noise by seeking approximate solutions via constrained fitting error minimization. This method utilizes measured data and a noise-matrix polytope to ensure near-optimal output synchronization. Stability conditions in the form of data-dependent semidefinite programs are derived, providing stabilizing controller gains for each follower. The proposed distributed data-driven control protocol achieves near-optimal output synchronization by ensuring the convergence of the tracking error to a bounded polytope, with the polytope size positively correlated with the noise bound. Numerical tests validate the practical merits of the proposed data-driven design and theory. © 2023, CC BY.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Active Wildfires Detection and Dynamic Escape Routes Planning for Humans Through Information Fusion between Drones and Satellites

Active Wildfires Detection and Dynamic Escape Routes Plannin...

引用

International Conference on Intelligent Transportation

作者： Chang Liu Tamas Sziranyi Department of Networked Systems and Services Budapest University of Technology and Economics Müegyetem rkp. 3 H-1111 Budapest Hungary and Machine Perception Research Laboratory of Institute for Computer Science and Control (SZTAKI) Budapest Hungary Faculty of Transportation Engineering and Vehicle Engineering Machine Perception Research Laboratory of Institute for Computer Science and Control (SZTAKI) Budapest University of Technology and Economics (BME-KJK) Müegyetem rkp. 3 H-1111 Budapest Hungary Budapest Hungary

UAVs are playing an increasingly important role in the field of wilderness rescue by virtue of their flexibility. This paper proposes a fusion of UAV vision technology and satellite image analysis technology for active wildfires detection and road networks extraction of wildfire areas and real-time dynamic escape route planning for people in distress. Firstly, the fire source location and the segmentation of smoke and flames are targeted based on Sentinel 2 satellite imagery. Secondly, the road segmentation and the road condition assessment are performed by D-linkNet and NDVI values in the central area of the fire source by UAV. Finally, the dynamic optimal route planning for humans in real time is performed by the weighted A* algorithm in the road network with the dynamic fire spread model. Taking the Chongqing wildfire on August 24, 2022, as a case study, the results demonstrate that the dynamic escape route planning algorithm can provide an optimal real-time navigation path for humans in the presence of fire through the information fusion of UAVs and satellites.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hybrid Routing in VANETs Using OLSR and Q-Learning for Enhanced Performance

Hybrid Routing in VANETs Using OLSR and Q-Learning for Enhan...

引用

IEEE SSD International Multi-Conference on systems, Signals and Devices

作者： Wafa Akermi Nouha Alyaoui Awatef Benfradj Guiloufi Karim Chabir Computer Science and Telecommunications Department Higher Institute of Applied Science and Technology Gafsa University Gafsa Tunisia Laboratory of Modeling Analysis and Control of Systems (MACS) National Engineering School of Gabes (ENIG) Gabes University Gabes Tunisia Departement of Computer Engineering College of Computer Qassim University Buraidh Saudi Ababia

ISBN: (数字)9798331542726

ISBN: (纸本)9798331542733

High node mobility, rapid topology changes provide specific challenges for vehicular ad hoc networks (VANETs), which have an immediate impact on the routing protocols' performance. Traditional approaches, like the Optimized Link State Routing (OLSR) protocol, provide proactive route management but fail to fully account for critical dynamic parameters like link stability, relative vehicle speed, node distance, and bandwidth availability. This work proposes a hybrid method combining OLSR with Q-learning to facilitate real-time adaptive routing. The model leverages dynamic metrics to proactively evaluate links while employing Q-learning to optimize routing decisions based on rewards computed from performance factors like delay, packet loss rate, and link duration. Simulation results demonstrate that our approach significantly outperforms classic OLSR. The improvements include reduced packet loss rates, increased average throughput, lower average latency, and a reduction in control overhead. These findings confirm that integrating dynamic metrics and adaptive learning effectively addresses the challenges posed by VANETs.

关键词： Q-learning Simulation Vehicular ad hoc networks Packet loss Routing Throughput Routing protocols Stability analysis Topology Vehicle dynamics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：