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

controllability of giant connected components in a directed network

Physical Review E 2017年第4期95卷 042318-042318页

作者： Xueming Liu Linqiang Pan H. Eugene Stanley Jianxi Gao Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation Huazhong University of Science and Technology Wuhan 430074 Hubei China Center for Polymer Studies and Department of Physics Boston University Boston Massachusetts 02215 USA School of Electric and Information Engineering Zhengzhou University of Light Industry Zhengzhou 450002 Henan China Center for Complex Network Research and Department of Physics Northeastern University Boston Massachusetts 02115 USA

When controlling a complex networked system it is not feasible to control the full network because many networks, including biological, technological, and social systems, are massive in size and complexity. But neither is it necessary to control the full network. In complex networks, the giant connected components provide the essential information about the entire system. How to control these giant connected components of a network remains an open question. We derive the mathematical expression of the degree distributions for four types of giant connected components and develop an analytic tool for studying the controllability of these giant connected components. We find that for both Erdős-Rényi (ER) networks and scale-free (SF) networks with p fraction of remaining nodes, the minimum driver node density to control the giant component first increases and then decreases as p increases from zero to one, showing a peak at a critical point p=pm. We find that, for ER networks, the peak value of the driver node density remains the same regardless of its average degree 〈k〉 and that it is determined by pm〈k〉. In addition, we find that for SF networks the minimum driver node densities needed to control the giant components of networks decrease as the degree distribution exponents increase. Comparing the controllability of the giant components of ER networks and SF networks, we find that when the fraction of remaining nodes p is low, the giant in-connected, out-connected, and strong-connected components in ER networks have lower controllability than those in SF networks.

关键词： Network structure

来源：评论

学校读者我要写书评

暂无评论

A polynomial chaos approach to robust H∞ static output-feedback control with bounded truncation error

arXiv

引用

arXiv 2021年

作者： Wan, Yiming Shen, Dongying E. Lucia, Sergio Findeisen, Rolf Braatz, Richard D. Artificial Intelligence and Automation Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control Ministry of Education Wuhan430074 China Massachusetts Institute of Technology 77 Massachusetts Avenue CambridgeMA02139 United States TU Dortmund University Dortmund44227 Germany Otto-von-Guericke University Magdeburg Magdeburg39106 Germany

This article considers the H∞ static output-feedback control for linear time-invariant uncertain systems with polynomial dependence on probabilistic time-invariant parametric uncertainties. By applying polynomial chaos theory, the control synthesis problem is solved using a high-dimensional expanded system which characterizes stochastic state uncertainty propagation. A closed-loop polynomial chaos transformation is proposed to derive the closed-loop expanded system. The approach explicitly accounts for the closed-loop dynamics and preserves the L2-induced gain, which results in smaller transformation errors compared to existing polynomial chaos transformations. The effect of using finite-degree polynomial chaos expansions is first captured by a norm-bounded linear differential inclusion, and then addressed by formulating a robust polynomial chaos based control synthesis problem. This proposed approach avoids the use of high-degree polynomial chaos expansions to alleviate the destabilizing effect of truncation errors, which significantly reduces computational complexity. In addition, some analysis is given for the condition under which the robustly stabilized expanded system implies the robust stability of the original system. A numerical example illustrates the effectiveness of the proposed approach. © 2021, CC BY.

关键词： Feedback control

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Real-Time 3D Route Planner for Aircraft

引用

Chinese Journal of Systems Engineering and Electronics 2003年第1期000卷

A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time,with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.

关键词： Evolutionary computation Route planning Route constraints Real time Aircraft

来源：评论

学校读者我要写书评

暂无评论

-Gain analysis of event-triggered networked control systems: a discontinuous Lyapunov functional approach

引用

International Journal of Robust and Nonlinear control 2012年第11期23卷

作者： Songlin Hu Dong Yue Department of Control Science and Engineering and the Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan 430074 China

In this paper, the problems of exponential stability and -gain analysis of event-triggered networked control systems (NCSs) with network-induced delays are studied. We first propose event-triggering conditions in the sensor side and controller side, respectively. Because the implementation of our event-triggering scheme only needs periodic supervision of the system state at the constant sampling instants, instead of being monitored continuously, it is expected that the scheme will improve the resource utilization. Taking the network-induced delays into account and using delay system approach, we constructed a unified model of NCSs with hybrid event-triggering schemes. On the basis of this model, sufficient conditions for the exponential stability and -gain analysis are developed in the form of LMIs by using a discontinuous Lyapunov–Krasovskii functional approach. Moreover, the corresponding results can be further extended to more general cases, where the system matrices of the considered plant contain parameter uncertainties, represented in either polytopic or norm-bounded frameworks. In addition, as a special case, we also present the exponential stability, -gain analysis, and the control feedback gain design of event-triggered NCSs without considering the effects of network-induced delays and event-triggering condition in the controller side. Finally, a simulation example is provided to illustrate the usefulness and effectiveness of the proposed hybrid event-triggering *** © 2012 John Wiley & Sons, Ltd.

关键词： event-triggering exponential stability -gain Lyapunov–Krasovskii functional NCSs

来源：评论

学校读者我要写书评

暂无评论

Computationally Expensive High-Dimensional Multiobjective Optimization via Surrogate-Assisted Reformulation and Decomposition

引用

IEEE Transactions on Evolutionary Computation 2024年 1-1页

作者： Pan, Linqiang Lin, Jianqing Wang, Handing He, Cheng Tan, Kay Chen Jin, Yaochu School of Artificial Intelligence and Automation Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Huazhong University of Science and Technology Wuhan China School of Artificial Intelligence Xidian University Xi’an China School of Electrical and Electronic Engineering Huazhong University of Science and Technology Wuhan China Department of Computing The Hong Kong Polytechnic University Hong Kong Hong Kong School of Engineering Trustworth and General Artificial Intelligence Laboratory Westlake University Hangzhou China

In recent decades, various surrogate-assisted evolutionary algorithms (SAEAs) have been proposed to solve computationally expensive multiobjective optimization problems (EMOPs). Nevertheless, designing an SAEA to handle high-dimensional EMOPs and balance convergence, diversity, and computational complexity remains challenging. Here, we propose a two-phase SAEA (TP-SAEA), which follows the idea of convergence first and diversity second, for solving high-dimensional EMOPs. In Phase I, a surrogate-assisted problem reformulation method is proposed to fast-track the Pareto optimal set in association with some reference solutions. Specifically, the high-dimensional EMOP is reformulated into an expensive single-objective one with low-dimensional decision space. Then, the surrogate-assisted optimization is utilized to obtain well-converged solutions. In Phase II, the high-dimensional EMOP is decomposed into two subproblems to explore subregions of the decision space that can effectively promote the diversity of the solutions. The two subproblems are optimized independently via surrogate-assisted optimization, aiming to push the population towards different regions of the Pareto optimal front. Experiments are conducted on EMOPs with 100 to 500 decision variables compared with four state-of-the-art SAEAs. The proposed TP-SAEA obtains well-converged and diverse solutions with only 509 real function evaluations. Moreover, its superiority is examined in six real-world instances with up to 12,000 decision variables. IEEE

关键词： Iron

来源：评论

学校读者我要写书评

暂无评论

T-TIME: Test-Time Information Maximization Ensemble for Plug-and-Play BCIs

arXiv

引用

arXiv 2024年

作者： Li, Siyang Wang, Ziwei Luo, Hanbin Ding, Lieyun Wu, Dongrui Ministry of Education Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen China Henan Key Laboratory of Brain Science and Brain Computer Interface Technology School of Electrical and Information Engineering Zhengzhou University China School of Civil and Hydraulic Engineering Huazhong University of Science and Technology Wuhan430074 China

Objective: An electroencephalogram (EEG)-based brain-computer interface (BCI) enables direct communication between the human brain and a computer. Due to individual differences and non-stationarity of EEG signals, such BCIs usually require a subject-specific calibration session before each use, which is time-consuming and user-unfriendly. Transfer learning (TL) has been proposed to shorten or eliminate this calibration, but existing TL approaches mainly consider offline settings, where all unlabeled EEG trials from the new user are available. Methods: This paper proposes Test-Time Information Maximization Ensemble (T-TIME) to accommodate the most challenging online TL scenario, where unlabeled EEG data from the new user arrive in a stream, and immediate classification is performed. T-TIME initializes multiple classifiers from the aligned source data. When an unlabeled test EEG trial arrives, T-TIME first predicts its labels using ensemble learning, and then updates each classifier by conditional entropy minimization and adaptive marginal distribution regularization. Our code is publicized. Results: Extensive experiments on three public motor imagery based BCI datasets demonstrated that T-TIME outperformed about 20 classical and state-of-the-art TL approaches. Significance: To our knowledge, this is the first work on test time adaptation for calibration-free EEG-based BCIs, making plug-and-play BCIs possible. © 2024, CC BY.

关键词： Calibration

来源：评论

学校读者我要写书评

暂无评论

Predefined-time terminal sliding mode control of robot manipulators

arXiv

引用

arXiv 2020年

作者： Liang, Chang-Duo Ge, Ming-Feng Liu, Zhi-Wei Wang, Yan-Wu Karimi, Hamid Reza School of Mechanical Engineering and Electronic Information China University of Geosciences Wuhan430074 China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Wuhan430074 China Department of Mechanical Engineering Politecnico di Milano Milan20156 Italy

In this paper, we present a new terminal sliding mode control to achieve predefined-time stability of robot manipulators. The proposed control is developed based on a novel predefined-time terminal sliding mode (PTSM) surface, on which the states are forced to reach the origin in a predefined time, i.e., the settling time is independent to the initial condition and can be explicitly user-defined via adjusting some specific parameters called the predefined-time parameters. It is also demonstrated that the proposed control can provide satisfactory steady-state performance in the case of both external disturbances and parametric uncertainties. Besides, we present a formal systemic analysis method to derive the sufficient conditions for guaranteeing the predefined-time convergence of the closed-loop system. Finally, the effectiveness and performance of the presented control scheme are illustrated through both theoretical comparisons and numerical simulations. Copyright © 2020, The Authors. All rights reserved.

关键词： Sliding mode control

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Optimization for Charging and Discharging of Plug-in Electric Vehicles

Distributed Online Optimization for Charging and Discharging...

引用

IEEE International Conference on Cyborg and Bionic Systems (CBS)

作者： Haiming Xiong Ming Chi Zhi-Wei Liu Dandan Hu Liang-Liang Zhu Cheng Jiang Jun-Ping Gui Yao Rao School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Wuhan China School of Management South-Central University for Nationalities Wuhan China Nari Group Corporation State Grid Electric Power Research Institute Nanjing China State Grid Electric Power Research Institute Wuhan Efficiency Evaluation Company Limited Wuhan China

The increasing number of uncoordinated charging and discharging for plug-in electric vehicles (PEVs) poses new challenges to the operation of the distribution network. We introduce a dynamic price mechanism so that charging at peak load will lead to an increase in cost. Then, a distributed online charging and discharging scheduling scheme for PEVs based on the dynamic price mechanism is proposed, considering the minimization of charging cost and battery degradation cost. Unlike most of the existing studies that require the future information of PEVs to schedule charging, the proposed algorithm can solve the scheduling problem for PEVs by taking advantage of a distributed alternating direction method of multipliers (ADMM). Simulation results demonstrate the effectiveness and correctness of the proposed scheduling scheme.

关键词： Plug-in electric vehicles Schedules Costs Heuristic algorithms Simulation Dynamic scheduling Minimization

来源：评论

学校读者我要写书评

暂无评论

Multi-View broad learning system for primate oculomotor decision decoding

arXiv

引用

arXiv 2019年

作者： Shi, Zhenhua Chen, Xiaomo Zhao, Changming He, He Stuphorn, Veit Wu, Dongrui Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Zanvyl Krieger Mind and Brain Institute Johns Hopkins University School of Medicine Department of Neurobiology Stanford University StanfordCA United States Department of Neuroscience Johns Hopkins University BaltimoreMD United States

Multi-view learning improves the learning performance by utilizing multi-view data: data collected from multiple sources, or feature sets extracted from the same data source. This approach is suitable for primate brain state decoding using cortical neural signals. This is because the complementary components of simultaneously recorded neural signals, local field potentials (LFPs) and action potentials (spikes), can be treated as two views. In this paper, we extended broad learning system (BLS), a recently proposed wide neural network architecture, from single-view learning to multi-view learning, and validated its performance in monkey oculomotor decision decoding from medial frontal LFPs and spikes. We demonstrated that medial frontal LFPs and spikes in non-human primate do contain complementary information about the oculomotor decision, and that the proposed multi-view BLS is a more effective approach to classify the oculomotor decision, than several classical and state-of-the-art single-view and multi-view learning approaches. Copyright © 2019, The Authors. All rights reserved.

关键词： Electrophysiology

来源：评论

学校读者我要写书评

暂无评论

Channel Reflection: Knowledge-Driven Data Augmentation for Eeg-Based Bcis

SSRN

引用

SSRN 2024年

作者： Wang, Ziwei Li, Siyang Luo, Jingwei Liu, Jiajing Wu, Dongrui Key Laboratory of the Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen518063 China China Electronic System Technology Co. Ltd. Beijing100089 China School of Civil and Hydraulic Engineering Huazhong University of Science and Technology Wuhan430074 China

A brain-computer interface (BCI) enables direct communication between the human brain and external devices. Electroencephalography (EEG) based BCIs are currently the most popular for able-bodied users. To increase user-friendliness, usually a small amount of user-specific EEG data are used for calibration, which may not be enough to develop a pure data-driven decoding model. To cope with this typical calibration data shortage challenge in EEG-based BCIs, this paper proposes a parameter-free channel reflection (CR) data augmentation approach that incorporates prior knowledge on the channel distributions of different BCI paradigms in data augmentation. Experiments on eight public EEG datasets across four different BCI paradigms (motor imagery, steady-state visual evoked potential, P300, and seizure classifications) using different decoding algorithms demonstrated that: 1) CR is effective, i.e., it can noticeably improve the classification accuracy;2) CR is robust, i.e., it consistently outperforms other data augmentation approaches in the literature;and, 3) CR is flexible, i.e., it can be combined with other data augmentation approaches to further increase the performance. We suggest that data augmentation approaches like CR should be an essential step in EEG-based BCIs. Our code is available online. © 2024, The Authors. All rights reserved.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：