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

Edge-End Cooperative Network Resource Allocation With Time Synchronization Awareness for Federated Learning-Based Distributed Energy Regulation

引用

IEEE Transactions on Smart Grid 2025年第3期16卷 2671-2682页

作者： Wang, Zhao Shu, Yiling Liao, Haijun Zhou, Zhenyu Lv, Lei Zhang, Le Mumtaz, Shahid Guizani, Mohsen North China Electric Power University State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources Beijing102206 China China Electric Power Research Institute Beijing100192 China State Grid Sichuan Information and Communication Company Chengdu610095 China Nottingham Trent University Department of Engineering NottinghamNG1 4FQ United Kingdom Kyung Hee University Department of Electronic Engineering Gyeonggi Yongin17104 Korea Republic of Mohamed Bin Zayed University of Artificial Intelligence Machine Learning Department Abu Dhabi United Arab Emirates

Distributed energy regulation is essential for carbon reduction and neutralization of smart park, and relies heavily on distributed energy regulation model training based on federated learning (FL). Network resource allocation is vital to reduction of model training loss and delay. However, time synchronization offset as well as adversarial competition in resource allocation cause low training precision and high training delay. Therefore, we investigate the edge-end cooperative network resource allocation problem for low-delay and high-precision FL, considering the long-term time synchronization offset constraint. We propose a penalty dueling deep Q network (PDDQN)-based edge-end cooperative network resource allocation algorithm with time synchronization awareness, named TARGET, to solve the formulated problem. TARGET achieves joint optimization of adversarial routing selection and device scheduling through the combination of PDDQN and DQN. TARGET provides model training precision guarantee by considering both long-term and short-term constraints of time synchronization offset. Simulation results indicate TARGET achieves superior performance in global loss function, time synchronization offset, and distributed energy regulation. © 2010-2012 IEEE.

关键词： Training Synchronization Logic gates Resource management Regulation Relays Routing Delays Optimization Data models

来源：评论

学校读者我要写书评

暂无评论

Secure Consensus of Multi-agent systems via Fully Distributed Dynamic Edge-based Event Triggered Under Denial-of-service Attacks

引用

International Journal of control, Automation and systems 2025年第5期23卷 1337-1355页

作者： Li, Lei Liu, Lei Yan, Dongmei Liang, Chengqing School of Mathematics Hohai University Nanjing China Key Laboratory of System Control and Information Processing Ministry of Education Shanghai China School of Modern Posts Nanjing University of Posts and Telecommunications Nanjing China College of Artificial Intelligence and Automation Hohai University Changzhou China Key Laboratory of Maritime Intelligent Cyberspace Technology Hohai University Ministry of Education Nanjing China

This paper addresses the issue of ensuring secure consensus in linear multi-agent systems under Denial-of-Service attacks. At the outset, to address the issue of partially observable agent states, a state observer is engineered to offer state estimations for the agents. Using the capabilities of this observer, a novel fully distributed dynamic adaptive edge-based event triggered control mechanism is introduced, and a timing variable is utilized to ensure that the inter-event intervals for all communication links in the network are strictly positive, thereby excluding Zeno behavior. Following that, by leveraging the piecewise Lyapunov function approach, the necessary conditions are meticulously crafted to ensure that the system reaches a secure consensus, thereby establishing a quantitative link between control gains, the duration of attacks, and their frequencies. Ultimately, the effectiveness of the developed event-triggered control strategy is validated through a simulation example.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Intelligent Construction and Analysis of a Complex Network for Determining Risk-Influencing Factors in Ship Self-Sinking Accidents

引用

ASCE-ASME Journal of Risk and Uncertainty in Engineering systems, Part A: Civil Engineering 2025年第3期11卷

作者： Ma, Jun Wang, Liguang Xu, Luhui Zhao, Jiong Lin, Rui School of Computer Science Xijing Univ. Xi'An Key Laboratory of Human-Machine Integration and Control Technology for Intelligence Xi'an710123 China School of Computer Science Xijing Univ. Xi'an710123 China Xi'An Senke Construction Engineering Co. Xi'an710043 China

One of the most effective methods for analyzing risk-influencing factors (RIFs) in maritime accidents is the complex network approach. However, there is limited research specifically focused on RIFs in ship self-sinking accidents. Moreover, challenges remain in the accurate ontology construction of RIFs based on the data set, intelligent extraction of RIF propagation paths, RIF importance ranking, and robustness analysis of complex networks. To address these issues, an intelligent method is proposed to construct a ship self-sinking accident RIF complex network (SSARIFCN) based on 204 accident reports, yielding 247 nodes and 1,872 edges derived from 488 RIF propagation paths. This approach significantly improves the objectivity and accuracy of RIF identification while enhancing the intelligence level of the information extraction process. The three-weight LeaderRank algorithm is applied for node importance ranking and network robustness analysis, outperforming eight traditional ranking models and five attack algorithms, enhancing the accuracy of key RIF identification. Based on this algorithm, the top five RIFs for ship self-sinking accidents were identified, concluding that "unfit for maritime navigation"is a frequently overlooked key RIF. The experiment validates the method's effectiveness in identifying key RIFs, controlling RIF propagation, and enhancing accident prevention and navigational safety. © 2025 American Society of Civil Engineers.

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

Global Spatial-Temporal Information-based Residual ConvLSTM for Video Space-Time Super-Resolution

引用

IEEE Transactions on Multimedia 2025年

作者： Fu, Congrui Yuan, Hui Jiang, Shiqi Zhang, Guanghui Shen, Liquan Hamzaoui, Raouf Center of Experimental Teaching China Shandong University School of Control Science and Engineering China Ministry of Education Key Laboratory of Machine Intelligence and System Control China Shandong University School of software Shandong Jinan China Shandong University School of Computer Science and Technology China Shanghai University School of Communication and Information Engineering Shanghai China De Montfort University School of Engineering and Sustainable Development LeicesterLE1 9BH United Kingdom

By converting low-frame-rate, low-resolution videos into high-frame-rate, high-resolution ones, space-time video super-resolution techniques can enhance visual experiences and facilitate more efficient information dissemination. We propose a convolutional neural network (CNN) for space-time video super-resolution, namely GIRNet. Our method combines long-term global information and short-term local information from the video to better extract complete and accurate spatial-temporal information. To generate highly accurate features and thus improve performance, the proposed network integrates a feature-level temporal interpolation module with deformable convolutions and a global spatial-temporal information-based residual convolutional long short-term memory (convLSTM) module. In the feature-level temporal interpolation module, we leverage deformable convolution, which adapts to deformations and scale variations of objects across different scene locations. This provides a more efficient solution than conventional convolution for extracting features from moving objects. Our network effectively uses forward and backward feature information to determine inter-frame offsets, leading to the direct generation of interpolated frame features. In the global spatial-temporal information-based residual convLSTM module, the first convLSTM is used to derive global spatial-temporal information from the input features, and the second convLSTM uses the previously computed global spatial-temporal information feature as its initial cell state. This second convLSTM adopts residual connections to preserve spatial information, thereby enhancing the output features. Experiments on the Vimeo90K dataset show that the proposed method outperforms open source state-of-the-art techniques in peak signal-to-noise-ratio (by 1.45 dB, 1.14 dB, and 0.2 dB over STARnet, TMNet, and 3DAttGAN, respectively), structural similarity index(by 0.027, 0.023, and 0.006 over STARnet, TMNet, and 3DAttGAN, respectiv

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Distributed Proportional-Integral Algorithms for Multiple Coalition Games under Limited Communication Resources

引用

IEEE Transactions on Signal and Information Processing over Networks 2025年 11卷 450-459页

作者： Liu, Jiaxun Wang, Dong Liu, Jiashuo Dong, Xiwang Ludong University School of Mathematics and Statistics Science Yantai264025 China Dalian University of Technology School of Control Science and Engineering Dalian116024 China Optimization for Industrial Equipment of Ministry of Education Key Laboratory of Intelligent Control China Beihang University Institute of Unmanned System Institute of Artificial Intelligence School of Automation Science and Electrical Engineering Beijing100191 China

This paper studies the algorithm design for multiple coalition games under limited communication resources, in which the players in the same coalition cooperatively optimize the summation of cost functions in this coalition and do not care about the costs of other coalitions. To address this game, we develop a distributed proportional-integral algorithm based on the coalition estimate strategy and the proportional-integral principle. Furthermore, when the communication resource is concretely quantified by bit rates in communication channels, we propose a coding-decoding-based distributed proportional-integral algorithm based on the distributed proportional-integral algorithm and coding-decoding rules for seeking the Nash equilibrium of multiple coalition games. It proves that both algorithms linearly and precisely converge to the Nash equilibrium in spite of limited communication resources. Then, the necessary and sufficient condition for the linear convergence of the proposed algorithm about the requirement of bit rates is presented. Moreover, the relationship between the bit rate and the convergence speed of the proposed algorithm is also theoretically explained. Lastly, the simulation in formation problems of unmanned vehicle swarms is presented to demonstrate the effectiveness of proposed algorithms. © 2015 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

PCE-GAN: A Generative Adversarial Network for Point Cloud Attribute Quality Enhancement based on Optimal Transport

arXiv

引用

arXiv 2025年

作者： Guo, Tian Yuan, Hui Liu, Qi Su, Honglei Hamzaoui, Raouf Kwong, Sam School of Control Science and Engineering Shandong University Jinan250061 China Key Laboratory of Machine Intelligence and System Control Ministry of Education Ji’nan250061 China School of Electronic Information Qingdao University Qingdao266071 China School of Engineering and Sustainable Development De Montfort University LeicesterLE1 9BH United Kingdom Department of Computing and Decision Science Lingnan University Hong Kong

Point cloud compression significantly reduces data volume but sacrifices reconstruction quality, highlighting the need for advanced quality enhancement techniques. Most existing approaches focus primarily on point-to-point fidelity, often neglecting the importance of perceptual quality as interpreted by the human visual system. To address this issue, we propose a generative adversarial network for point cloud quality enhancement (PCE-GAN), grounded in optimal transport theory, with the goal of simultaneously optimizing both data fidelity and perceptual quality. The generator consists of a local feature extraction (LFE) unit, a global spatial correlation (GSC) unit and a feature squeeze unit. The LFE unit uses dynamic graph construction and a graph attention mechanism to efficiently extract local features, placing greater emphasis on points with severe distortion. The GSC unit uses the geometry information of neighboring patches to construct an extended local neighborhood and introduces a transformer-style structure to capture long-range global correlations. The discriminator computes the deviation between the probability distributions of the enhanced point cloud and the original point cloud, guiding the generator to achieve high quality reconstruction. Experimental results show that the proposed method achieves state-of-the-art performance. Specifically, when applying PCE-GAN to the latest geometry-based point cloud compression (G-PCC) test model, it achieves an average BD-rate of -19.2% compared with the PredLift coding configuration and -18.3% compared with the RAHT coding configuration. Subjective comparisons show a significant improvement in texture clarity and color transitions, revealing finer details and more natural color gradients. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Polytope Volume Monitoring Problem: Formulation and Solution via Parametric Linear Program Based control Barrier Function

arXiv

引用

arXiv 2025年

作者： Wu, Shizhen Dong, Jinyang Fang, Xu Sun, Ning Fang, Yongchun Institute of Robotics and Automatic Information System College of Artificial Intelligence Nankai University Tianjin300353 China The Institute of Intelligence Technology and Robotic Systems Shenzhen Research Institute of Nankai University Shenzhen518083 China Key Laboratory of Intelligent Control and Optimization for Industrial Equipment of Ministry of Education Dalian University of Technology Dalian116024 China

Motivated by the latest research on feasible space monitoring of multiple control barrier functions (CBFs) as well as polytopic collision avoidance, this paper studies the Polytope Volume Monitoring (PVM) problem, whose goal is to design a control law for inputs of nonlinear systems to prevent the volume of some state-dependent polytope from decreasing to zero. Recent studies have explored the idea of applying Chebyshev ball method in optimization theory to solve the case study of PVM;however, the underlying difficulties caused by nonsmoothness have not been addressed. This paper continues the study on this topic, where our main contribution is to establish the relationship between nonsmooth CBF and parametric optimization theory through directional derivatives for the first time, so as to solve PVM problems more conveniently. In detail, inspired by Chebyshev ball approach, a parametric linear program (PLP) based nonsmooth barrier function candidate is established for PVM, and then, sufficient conditions for it to be a nonsmooth CBF are proposed, based on which a quadratic program (QP) based safety filter with guaranteed feasibility is proposed to address PVM problems. Finally, a numerical simulation example is given to show the efficiency of the proposed safety filter. © 2025, CC BY.

关键词： Chebyshev filters

来源：评论

学校读者我要写书评

暂无评论

Safe RL-based Adaptive Cooperative Game control of Wing Deformation and Flight State Tracking for Morphing Hypersonic Vehicles

引用

IEEE Transactions on Aerospace and Electronic systems 2025年

作者： Wang, Jun-Wei Wang, Feng Wu, Huai-Ning Liu, Zhou-Yang University of Science and Technology Beijing School of Intelligence Science and Technology Beijing100083 China Beihang University School of Automation Science and Electrical Engineering Beijing100191 China Beihang University Hangzhou International Innovation Institute Hangzhou311115 China National Key Laboratory of Complex System Control and Intelligent Agent Cooperation Beijing100074 China

This study addresses the issue of adaptive cooperative game control (ACGC) design for wing deformation and flight state tracking of morphing hypersonic vehicles (MHVs) with variable wing shapes, input constraints and state constraints. To access a better flight control performance, the wing deformation parameter is extended in this work as an auxiliary control input. An oriented-coordinated-control nonlinear differential equation model is first established to describe the complicated longitudinal flight state tracking error dynamics of the MHV. Then, a control barrier function (CBF) is introduced and incorporated into the value function as a risk penalty term of state security constraint. Based on the differential game (DG) theory, the optimal coordinated control problem for the MHV with input constraints and state constraints is treated as a constrained cooperative DG that is further formulated as a Hamilton-Jacobi-Bellman (HJB) equation with barrier and hyperbolic functions. A safe RL algorithm is proposed to solve the above HJB equation and an online Pareto joint control strategy is achieved thereby. Hereafter the stability analysis of the closed-loop state tracking error system is done by the Lyapunov technique. Meanwhile, both state and input constraints are met during the the parameter learning regulation process. At last, a simulation study is performed to support the proposed safe RL-ACGC algorithm. © 2025 IEEE.

关键词： Hyperbolic functions

来源：评论

学校读者我要写书评

暂无评论

Minimizing Data Collection Latency for Coexisting Time-Critical Wireless Networks with Tree Topologies

引用

IEEE Transactions on Network and Service Management 2025年

作者： Zhang, Jialin Liang, Wei Yang, Bo Shi, Huaguang Liang, Ying-Chang Chinese Academy of Sciences State Key Laboratory of Robotics Shenyang Institute of Automation Shenyang110016 China Chinese Academy of Sciences Key Laboratory of Networked Control System Shenyang Institute of Automation Shenyang110016 China Northwest A and F University College of Information Engineering Yangling712100 China Henan University School of Artificial Intelligence Zhengzhou450046 China University of Electronic Science and Technology of China Center for Intelligent Networking and Communications Chengdu611731 China

Time-Critical Wireless Network (TCWN) is a promising communication technology that can satisfy the low latency, high reliability, and deterministic requirements of mission-critical applications. Multiple TCWNs required by various applications inevitably coexist with each other. Most existing works aim to achieve acceptable latency or consider the simplest topology (i.e., line topology). As latency requirements become more stringent, exploring the minimum data collection latency becomes an interesting problem. In this paper, the coexisting system consists of multiple tree-topology-based TCWNs. We first establish a conversion framework to convert an arbitrary tree topology into multiple analogous line topologies to reduce the analysis complexity. We then propose a Time-Critical wireless network Scheduling (TCS) algorithm to minimize the data collection latency of coexisting TCWNs. The TCS algorithm consists of two phases. In the internetwork scheduling phase, we strictly derive a general expression to characterize the practical network requirements. In the intranetwork scheduling phase, we design two levels of priority assignment algorithms to accurately characterize the critical states and resource requirements of different nodes. We conduct extensive simulations to verify the effectiveness of the TCS algorithm. The evaluation results show that the TCS algorithm can achieve minimum data collection latency in more than 99.956% cases, and the maximum difference compared to the optimal value is one time slot. © 2004-2012 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Analysis and Design of Application-Layer Rateless Codes Based on Reliability and Latency Trade-Off

Analysis and Design of Application-Layer Rateless Codes Base...

引用

IEEE Conference on Wireless Communications and Networking

作者： Haobo Huang Yusun Fu Junpeng Yin Ningbo Artificial Intelligence Institute Shanghai Jiao Tong University Ningbo China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

With the Internet of Things (IoT) playing an increasingly crucial role in connecting diverse devices, applications have different requirements for communication and various evaluation metrics have emerged, such as Age of Information (AoI) and estimation error. Considering the fundamental trade-off between reliability and latency of the communication system, the relationship among reliability, latency, AoI and estimation error is complex. This paper proposes a remote state observation system with application-layer rateless codes to explore above relationships, addressing how to design the system for optimal performance based on varying requirements by adjusting coding parameters. By emphasizing flexible and adaptable coding strategies, we aim to convey the idea that the error-correction codes can be designed to optimize the communication system for diverse practical metrics. It is different from the traditional designs that focus on approaching the Shannon limit.

关键词： Measurement Estimation error Correlation Communication systems Reliability engineering Information age Error correction codes Internet of Things Channel coding State estimation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：