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

arXiv 2022年

作者： Yang, Zixuan Wang, Xiaofan Wang, Lin The Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Key Laboratory of Power Station Automation Technology School of Mechatronic Engineering and Automation Shanghai University Shanghai200444 China

The controllability of networked sampled-data systems with zero-order holders on the control and transmission channels is explored, where single- and multi-rate sampling patterns are considered, respectively. The effects of sampling on the controllability of networked systems are analyzed, with some necessary and/or sufficient controllability conditions derived. Different from the sampling control of single systems, the pathological sampling of node systems could be eliminated by an appropriate design of network structure and inner couplings. While for singular topology matrices, the pathological sampling of single nodes will cause the entire system to lose controllability. Moreover, any periodic sampling will not affect the controllability of networked systems with specific node dynamics. All the results indicate that whether a networked system is under pathological sampling or not is jointly determined by mutually coupled factors. Copyright © 2022, The Authors. All rights reserved.

关键词： controllability

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Generalized Nash Equilibrium Tracking for Prosumer Energy Trading Games

Distributed Online Generalized Nash Equilibrium Tracking for...

引用

American control Conference (ACC)

作者： Yongkai Xie Zhaojian Wang John Z.F. Pang Bo Yang Xinping Guan Department of Automation Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Jiao Tong University Shanghai China Agency for Science Technology and Research (A*STAR) Institute of High Performance Computing (IHPC) Singapore Republic of Singapore

With the proliferation of distributed generations, traditional passive consumers in distribution networks are evolving into "prosumers", which can both produce and consume energy. Energy trading with the main grid or between prosumers is inevitable if the energy surplus and shortage exist. To this end, this paper investigates the peer-to-peer (P2P) energy trading market, which is formulated as a generalized Nash game. We first prove the existence and uniqueness of the generalized Nash equilibrium (GNE). Then, an distributed online algorithm is proposed to track the GNE in the time-varying environment. Its regret is proved to be bounded by a sublinear function of learning time, which indicates that the online algorithm has an acceptable accuracy in practice. Finally, numerical results with six microgrids validate the performance of the algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Atf-Bss: Adaptive Time-Frequency Blind Source Separation for High Reverberation and Echo Environments

SSRN

引用

SSRN 2023年

作者： Xie, Yuan Zou, Tao Chen, Ci Sun, Weijun Xie, Shengli School of Mechanical and Electrical Engineering Guangzhou University Guangdong-Hong Kong-Macao Key Laboratory of Multi-scale Information Fusion and Collaborative Optimization Control of Complex Manufacturing Process Guangzhou510006 China School of Automation Guangdong University of Technology Joint International Research Laboratory of Intelligent Information Processing and System Integration of IoT Ministry of Education of the P.R.C. Guangzhou510006 China School of Automation Guangdong University of Technology Guangdong Key Laboratory of IoT Information Processing Guangdong-HongKong-Macao Joint Laboratory for Smart Discrete Manufacturing Guangzhou510006 China School of Automation Guangdong University of Technology Key Laboratory of Intelligent Detection and the IoT in Manufacturing Ministry of Education 111 Center for Intelligent Batch Manufacturing Based on IoT Technology Guangzhou510006 China

Blind source separation with high reverberation and echoes is an open and extremely challenging issue. Room reverberation and echoes have an important influence on acoustics quality, causing great difficulty in independent source separation. In the paper, an adaptive time-frequency blind source separation algorithm (ATF-BSS) is designed to deal with high reverberation and echoes, which can adaptively attenuate audible echoes and enhance the harmonic structure of real-world audio signals, achieving excellent separation performance. Firstly, an equalizer network is designed for the room impulse response to weakening audible echoes under high reverberation and echo environments without changing the perceived timbre. Furthermore, an adaptive time-frequency Wiener-like masking is presented to enhance the dominant signal and attenuate the other components that have less energy than the dominant signal. ATF-BSS algorithm incorporates the advantages of an equalizer network for removing or weakening audible echoes and adaptive time-frequency masking for high reverberation and echoes scene, improving the performance of blind separation. Experimental results on public audio datasets demonstrate that the proposed ATF-BSS algorithm improves signal intelligibility and achieves much better separation performance than state-of-the-art methods. © 2023, The Authors. All rights reserved.

关键词： Reverberation

来源：评论

学校读者我要写书评

暂无评论

Room Impulse Response Reshaping-Based Blind Source Separation in an Underdetermined Reverberant Environment

SSRN

引用

SSRN 2023年

作者： Xie, Yuan Zou, Tao Yang, Junjie Sun, Weijun Xie, Shengli School of Mechanical and Electrical Engineering Guangzhou University Guangdong-Hong Kong-Macao Key Laboratory of Multi-scale Information Fusion and Collaborative Optimization Control of Complex Manufacturing Process Guangzhou510006 China School of Automation Guangdong University of Technology Joint International Research Laboratory of Intelligent Information Processing and System Integration of IoT Ministry of Education of the P.R.C. Guangzhou510006 China School of Automation Guangdong University of Technology Guangdong Key Laboratory of IoT Information Processing Guangdong-HongKong-Macao Joint Laboratory for Smart Discrete Manufacturing Guangzhou510006 China School of Automation Guangdong University of Technology Key Laboratory of Intelligent Detection and the IoT in Manufacturing Ministry of Education 111 Center for Intelligent Batch Manufacturing Based on IoT Technology Guangzhou510006 China

Blind source separation in an underdetermined reverberation environment is a very challenging issue. The classical method is based on the expectation-maximization algorithm. However, it is limited in a high reverberation environment, resulting in bad or even invalid separation performance. To get rid of this restriction, a room impulse response reshaping-based blind source separation algorithm is designed to solve the signal separation problem in an underdetermined reverberant environment. Firstly, a room impulse response reshaping technology is designed to eliminate the influence of audible echo for the reverberant environment, improving the quality of the received signals. Then, a new mathematical model of time-frequency mixing signals is established to reduce the approximation error of model transformation caused by high reverberation. Furthermore, an improved expectation-maximization algorithm is proposed for real-time update learning rules of model parameters, and then the sources are separated using the estimators provided by the improved expectation maximization method. Experimental results based on source separation of speech and music mixtures demonstrate that the proposed algorithm achieves better separation performance while maintaining much better robustness than the popular expectation-maximization methods. © 2023, The Authors. All rights reserved.

关键词： Blind source separation

来源：评论

学校读者我要写书评

暂无评论

Submodularity-based False Data Injection Attack Scheme in Multi-agent Dynamical Systems

arXiv

引用

arXiv 2022年

作者： Luo, Xiaoyu Zhao, Chengcheng Fang, Chongrong He, Jianping The Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China The State Key Laboratory of Industrial Control Technology Institute of Cyberspace Research Zhejiang University China The Department of Electrical and Computer Engineering University of Victoria BC Canada

Consensus in multi-agent dynamical systems is prone to be sabotaged by the adversary, which has attracted much attention due to its key role in broad applications. In this paper, we study a new false data injection (FDI) attack design problem, where the adversary with limited capability aims to select a subset of agents and manipulate their local multi-dimensional states to maximize the consensus convergence error. We first formulate the FDI attack design problem as a combinatorial optimization problem and prove it is NP-hard. Then, based on the submodularity optimization theory, we show the convergence error is a submodular function of the set of the compromised agents, which satisfies the property of diminishing marginal returns. In other words, the benefit of adding an extra agent to the compromised set decreases as that set becomes larger. With this property, we exploit the greedy scheme to find the optimal compromised agent set that can produce the maximum convergence error when adding one extra agent to that set each time. Thus, the FDI attack set selection algorithms are developed to obtain the near-optimal subset of the compromised agents. Furthermore, we derive the analytical suboptimality bounds and the worst-case running time under the proposed algorithms. Extensive simulation results are conducted to show the effectiveness of the proposed algorithm. Copyright © 2022, The Authors. All rights reserved.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Distributionally Robust Mixed-Integer control through Lifted control Policy

引用

IEEE Transactions on Automatic control 2025年

作者： Ma, Xutao Ning, Chao Du, Wenli Shi, Yang Shanghai Jiao Tong University Department of Automation Shanghai200240 China Ministry of Education of China Key Laboratory of System Control and Information Processing Shanghai200240 China East China University of Science and Technology Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education Shanghai200237 China University of Victoria Department of Mechanical Engineering VictoriaBCV8W 3P6 Canada

This paper investigates the finite-horizon distributionally robust mixed-integer control (DRMIC) of uncertain linear systems. However, deriving an optimal causal feedback control policy to this DRMIC problem is computationally formidable for most ambiguity sets. To address the computational challenge, we propose a novel distributionally robust lifted control policy (DR-LCP) method to derive a high-quality approximate solution to this DRMIC problem for a rich class of Wasserstein metric-based ambiguity sets, including the Wasserstein ambiguity set and its variants. In theory, we analyze the asymptotic performance and establish a tight non-asymptotic bound of the proposed method. In numerical experiments, the proposed DR-LCP method empirically demonstrates superior performance compared with existing methods in the literature. ©1963-2012 IEEE.

关键词： Mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Distributed Optimization by Network Flows with Spatio-Temporal Compression

arXiv

引用

arXiv 2024年

作者： Ren, Zihao Wang, Lei Yi, Xinlei Wang, Xi Yuan, Deming Yang, Tao Wu, Zhengguang Shi, Guodong State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou310027 China College of Electronics and Information Engineering Tongji University China School of Electrical Engineering Telecommunications University of New South Wales Sydney Australia School of Automation Nanjing University of Science and Technology China State Key Laboratory of Synthetical Automation for Process Industries Northeastern University China Australian Centre for Robotics School of Aerospace Mechanical and Mechatronic Engineering The University of Sydney SydneyNSW2006 Australia

Several data compressors have been proposed in distributed optimization frameworks of network systems to reduce communication overhead in large-scale applications. In this paper, we demonstrate that effective information compression may occur over time or space during sequences of node communications in distributed algorithms, leading to the concept of spatio-temporal compressors. This abstraction classifies existing compressors as spatio-temporal compressors, with their effectiveness described by constructive stability criteria from nonlinear system theory. Subsequently, we apply these spatio-temporal compressors to standard continuous-time consensus flows and distributed prime-dual flows, establishing conditions ensuring convergence. Additionally, we introduce a novel observer-based distributed primal-dual continuous flow integrated with spatio-temporal compressors, which provides broader convergence conditions. These continuous flows achieve exponential convergence to the global optimum when the objective function is strongly convex and can be discretized using Euler approximations. Finally, numerical simulations illustrate the versatility of the proposed spatio-temporal compressors and verify the convergence of algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Stability criteria

来源：评论

学校读者我要写书评

暂无评论

Bionic Geomagnetic Navigation for Autonomous Underwater Vehicle with Temporal Attention-based Data-Driven Dead Reckoning

TechRxiv

引用

TechRxiv 2023年

作者： Yang, Songnan Zhang, Xiaohui Liu, Ding Bai, Wenqi Liu, Fan The School of Automation and Information Engineering Xi’an University of Technology Shaanxi 710048 China The Institute of Advanced Navigation and Electromagnetics Xi’an University of Technology Shaanxi 710048 China The State Key Laboratory of Eco-Hydraulics in the Northwest Arid Region of China Xi’an University of Technology Shaanxi 710048 China The Shaanxi Key Laboratory of Complex System Control with the Intelligent Information Processing Xi’an University of Technology Shaanxi 710048 China

Numerous studies have demonstrated that numerous animal species are capable of goal-directed navigation using environmental information for dead reckoning. The stable magnetic field of the earth provides important information for the migration of animals over long distances. Inspired by the goal-directed navigation of animals, a novel Geomagnetic Navigation with Temporal Attention-based Data-Driven Dead Reckoning (Attention-DR) method for Autonomous Underwater Vehicles (AUV) is presented in this article, which only utilizes the inclination angle (I) and the declination angle (D) of the Geomagnetic Field (GF) for underwater navigation without any prior knowledge of the geographical location or geographic map. This article proposes a Temporal Attention-based Long Short-Term Memory (TA-LSTM) neural network by combining history, GF information, and location in time series to achieve the optimization heading angle of underwater dead reckoning. Due to its ability to adjust the utilization weights of local and global temporal information in the path, TA-LSTM possesses the capability to continually update neural network model parameters through a data-driven process during the navigation process. This enables the Attention-DR to achieve efficient navigation in regions without prior magnetic maps and overcome navigation failures caused by magnetic field anomalies. The simulation outcomes confirm the efficiency, precision, and practicability of the proposed algorithm. © 2023, CC BY.

关键词： Navigation

来源：评论

学校读者我要写书评

暂无评论

Energy Management Based on Multi-Agent Deep Reinforcement Learning for A Multi-Energy industrial Park

arXiv

引用

arXiv 2022年

作者： Zhu, Dafeng Yang, Bo Liu, Yuxiang Wang, Zhaojian Ma, Kai Guan, Xinping Department of Automation Shanghai Jiao Tong University Shanghai 200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai 200240 China Key Laboratory of Industrial Computer Control Engineering of Hebei Province Yanshan University Qinhuangdao066004 China

Owing to large industrial energy consumption, industrial production has brought a huge burden to the grid in terms of renewable energy access and power supply. Due to the coupling of multiple energy sources and the uncertainty of renewable energy and demand, centralized methods require large calculation and coordination overhead. Thus, this paper proposes a multi-energy management framework achieved by decentralized execution and centralized training for an industrial park. The energy management problem is formulated as a partially-observable Markov decision process, which is intractable by dynamic programming due to the lack of the prior knowledge of the underlying stochastic process. The objective is to minimize long-term energy costs while ensuring the demand of users. To solve this issue and improve the calculation speed, a novel multi-agent deep reinforcement learning algorithm is proposed, which contains the following key points: counterfactual baseline for facilitating contributing agents to learn better policies, soft actor-critic for improving robustness and exploring optimal solutions. A novel reward is designed by Lagrange multiplier method to ensure the capacity constraints of energy storage. In addition, considering that the increase in the number of agents leads to performance degradation due to large observation spaces, an attention mechanism is introduced to enhance the stability of policy and enable agents to focus on important energy-related information, which improves the exploration efficiency of soft actor-critic. Numerical results based on actual data verify the performance of the proposed algorithm with high scalability, indicating that the industrial park can minimize energy costs under different demands. © 2022, CC BY-NC-ND.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

A localizability estimation method for mobile robots based on 3D point cloud feature

A localizability estimation method for mobile robots based o...

引用

2021 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2021

作者： Liu, Ying Wang, Jingchuan Huang, Yi Institute of Medical Robotics Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Department of Automation Shanghai200240 China Nanjing Kingyoung Intelligent Technology CO. LTD.

ISBN: (纸本)9781665436786

This paper introduces the theoretical analysis and derivation of localizability estimation for mobile robots based on point cloud observation. Combined with the observation model, the pre-established point cloud map is firstly clustered and segmented with a newly proposed method considering multiple constraints on depth map. Then localizability is set to be equal to the strength of the constraints associated with 3D point cloud features. In addition, based on the method of using information matrix theory, this paper integrates the Fisher's information matrix and point cloud features to estimate localizability. © 2021 IEEE.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：