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

Adaptive Fixed-Time Synchronization of Delayed Memristor-Based Neural Networks with Discontinuous Activations

Computer Modeling in Engineering & Sciences 2023年第1期134卷 221-239页

作者： Tianyuan Jia Xiangyong Chen Xiurong Yao Feng Zhao Jianlong Qiu School of Automation and Electrical Engineering and Key Laboratory of Complex Systems and Intelligent Computing in Universities of ShandongLinyi UniversityLinyi276005China The Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems and School of AutomationChina University of GeosciencesWuhan430074China

Fixed-time synchronization(FTS)of delayed memristor-based neural networks(MNNs)with discontinuous activations is studied in this *** continuous and discontinuous activations are considered *** the mixed delays which are closer to reality are taken into the ***,two kinds of control schemes are proposed,including feedback and adaptive control *** on some lemmas,mathematical inequalities and the designed controllers,a few synchronization criteria are ***,the upper bound of settling time(ST)which is independent of the initial values is ***,the feasibility of our theory is attested by simulation examples.

关键词： Memristor-based neural networks fixed-time synchronization mixed delays discontinuous activations adaptive control

来源：评论

学校读者我要写书评

暂无评论

Multimodal Image Matching based on Frequency-domain Information of Local Energy Response

arXiv

引用

arXiv 2025年

作者： Yang, Meng Chen, Jun Gong, Wenping Wei, Longsheng Tian, Xin School of Automation China University of Geosciences Wuhan430074 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan430074 China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan430074 China Faculty of Engineering China University of Geosciences Wuhan430074 China Electronic Information School Wuhan University Wuhan430072 China

Complicated nonlinear intensity differences, nonlinear local geometric distortions, noises and rotation transformation are main challenges in multimodal image matching. In order to solve these problems, we propose a method based on Frequency-domain Information of Local Energy Response called FILER. The core of FILER is the local energy response model based on frequency-domain information, which can overcome the effect of nonlinear intensity differences. To improve the robustness to local nonlinear geometric distortions and noises, we design a new edge structure enhanced feature detector and convolutional feature weighted descriptor, respectively. In addition, FILER overcomes the sensitivity of the frequency-domain information to the rotation angle and achieves rotation invariance. Extensive experiments multimodal image pairs show that FILER outperforms other state-of-the-art algorithms and has good robustness and *** Codes 68U10 (Primary), 68T45, 68Wxx (Secondary) Copyright © 2025, The Authors. All rights reserved.

关键词： Mathematical transformations

来源：评论

学校读者我要写书评

暂无评论

COph100: A comprehensive fundus image registration dataset from infants constituting the "RIDIRP" database

arXiv

引用

arXiv 2025年

作者： Hu, Yan Gong, Mingdao Qiu, Zhongxi Liu, Jiabao Shen, Hongli Yuan, Mingzhen Zhang, Xiaoqing Li, Heng Lu, Hai Liu, Jiang Research Institute of Trustworthy Autonomous Systems Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Beijing Tongren Eye Center Beijing Tongren Hospital Capital Medical University Beijing Ophthalmology and Visual Sciences Key Laboratory Beijing China Center for High Performance Computing and Shenzhen Key Laboratory of Intelligent Bioinformatics Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China

Retinal image registration is vital for diagnostic therapeutic applications within the field of ophthalmology. Existing public datasets, focusing on adult retinal pathologies with high-quality images, have limited number of image pairs and neglect clinical challenges. To address this gap, we introduce COph100, a novel and challenging dataset known as the Comprehensive Ophthalmology Retinal Image Registration dataset for infants with a wide range of image quality issues constituting the public "RIDIRP" database1. COph100 consists of 100 eyes, each with 2 to 9 examination sessions, amounting to a total of 491 image pairs carefully selected from the publicly available dataset. We manually labeled the corresponding ground truth image points and provided automatic vessel segmentation masks for each image. We have assessed COph100 in terms of image quality and registration outcomes using state-of-the-art algorithms. This resource enables a robust comparison of retinal registration methodologies and aids in the analysis of disease progression in infants, thereby deepening our understanding of pediatric ophthalmic conditions. Copyright © 2025, The Authors. All rights reserved.

关键词： Image registration

来源：评论

学校读者我要写书评

暂无评论

The Separate Meter in Separate Meter Out Control System Using Dual Servo Valves Based on Indirect Adaptive Robust Dynamic Surface Control

引用

Journal of systems Science & complexity 2019年第2期32卷 557-576页

作者： CHEN Guangrong WANG Junzheng WANG Shoukun ZHAO Jiangbo SHEN Wei The Key Laboratory of Drive and Control of Servo Motion Systems Beijing Institute of Technology The Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Institute of Technology

Due to the demand for energy efficiency in electro-hydraulic systems, the separate meter in and separate meter out(SMISMO) control system attracts vast attention. In this paper, the SMISMO control system was configured with two servo valves to control the meter in and meter out *** designing two of the proposed indirect adaptive robust dynamic surface controllers(IARDSC)for the working-side and off-side system and setting the coupled items as estimated parameters, the SMISMO control system was decoupled into two subsystems completely. Here, indirect adaptive robust control(IARC) was employed to address the internal parameter uncertainties and external *** surface control(DSC) was utilized in the backstepping design procedure of IARC to deal with the inherent ‘explosion of terms' problem. As thus, the proposed IARDSC could simplify the design procedure, decrease the computational cost, and achieve an improved control performance in practical use. Finally, experimental results validated the effectiveness of proposed IARDSC and showed that the proposed SMISMO control system could provide a possibility to save more energy.

关键词： Dynamic surface control indirect adaptive robust control parameter estimation SMISMO stability analysis

来源：评论

学校读者我要写书评

暂无评论

A memetic algorithm for path planning of curvature-constrained UAVs performing surveillance of multiple ground targets

引用

Chinese Journal of Aeronautics 2014年第3期27卷 622-633页

作者： Zhang Xing Chen Jie Xin Bin Peng Zhihong School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems

The problem of generating optimal paths for curvature-constrained unmanned aerial vehicles （UAVs） performing surveillance of multiple ground targets is addressed in this paper. UAVs are modeled as Dubins vehicles so that the constraints of UAVs＇ minimal turning radius can be taken into account. In view of the effective surveillance range of the sensors equipped on UAVs, the problem is formulated as a Dubins traveling salesman problem with neighborhood （DTSPN）. Considering its prohibitively high computational complexity, the Dubins paths in the sense of terminal heading relaxation are introduced to simplify the calculation of the Dubins distance, and a boundary-based encoding scheme is proposed to determine the visiting point of every target neighborhood. Then, an evolutionary algorithm is used to derive the optimal Dubins tour. To further enhance the quality of the solutions, a local search strategy based on approximate gradient is employed to improve the visiting points of target neighborhoods. Finally, by a minor modification to the individual encoding, the algorithm is easily extended to deal with other two more sophisticated DTSPN variants （multi-UAV scenario and multiple groups of targets scenario）. The performance of the algorithm is demonstrated through comparative experiments with other two state-of-the-art DTSPN algorithms identified in literature. Numerical simulations exhibit that the algorithm proposed in this paper can find high-quality solutions to the DTSPN with lower computational cost and produce significantly improved performance over the other algorithms.

关键词： Approximate gradient Dubins traveling salesmanproblem with neighborhood Local search Memetic algorithm Unmanned aerial vehicles

来源：评论

学校读者我要写书评

暂无评论

A-STC: auction-based spanning tree coverage algorithm for motion planning of cooperative robots

引用

Frontiers of Information Technology & Electronic Engineering 2019年第1期20卷 18-31页

作者： Guan-qiang GAO Bin XIN School of Automation Beijing Institute of Technology Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Advanced Innovation Center for Intelligent Robots and Systems

The multi-robot coverage motion planning(MCMP) problem in which every reachable area must be covered is common in multi-robot systems. To deal with the MCMP problem, we propose an efficient, complete, and off-line algorithm, named the "auction-based spanning tree coverage(A-STC)" algorithm. First, the configuration space is divided into mega cells whose size is twice the minimum coverage range of a robot. Based on connection relationships among mega cells, a graph structure can be obtained. A robot that circumnavigates a spanning tree of the graph can generate a coverage trajectory. Then, the proposed algorithm adopts an auction mechanism to construct one spanning tree for each robot. In this mechanism, an auctioneer robot chooses a suitable vertex of the graph as an auction item from neighboring vertexes of its spanning tree by heuristic rules. A bidder robot submits a proper bid to the auctioneer according to the auction vertexes' relationships with the spanning tree of the robot and the estimated length of its trajectory. The estimated length is calculated based on vertexes and edges in the spanning tree. The bidder with the highest bid is selected as a winner to reduce the makespan of the coverage task. After auction processes, acceptable coverage trajectories can be planned rapidly. Computational experiments validate the effectiveness of the proposed MCMP algorithm and the method for estimating trajectory lengths. The proposed algorithm is also compared with the state-of-the-art algorithms. The comparative results show that the A-STC algorithm has apparent advantages in terms of the running time and the makespan for large crowded configuration spaces.

关键词： Coverage motion planning Multi-robot system Auction algorithm Spanning tree coverage algorithm

来源：评论

学校读者我要写书评

暂无评论

Online adaptive Q-learning method for fully cooperative linear quadratic dynamic games

引用

Science China(Information Sciences) 2019年第12期62卷 164-177页

作者： Xinxing LI Zhihong PENG Lei JIAO Lele XI Junqi CAI School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems

A model-based offline policy iteration(PI) algorithm and a model-free online Q-learning algorithm are proposed for solving fully cooperative linear quadratic dynamic games. The PI-based adaptive Q-learning method can learn the feedback Nash equilibrium online using the state samples generated by behavior policies, without sending inquiries to the system model. Unlike the existing Q-learning methods, this novel Q-learning algorithm executes both policy evaluation and policy improvement in an adaptive *** prove the convergence of the offline PI algorithm by proving its equivalence to Newton's method while solving the game algebraic Riccati equation(GARE). Furthermore, we prove that the proposed Q-learning method will converge to the Nash equilibrium under a small learning rate if the method satisfies certain persistence of excitation conditions, which can be easily met by suitable behavior policies. Our simulation results demonstrate the good performance of the proposed online adaptive Q-learning algorithm.

关键词： adaptive dynamic programming reinforcement learning Q-learning fully cooperative linear quadratic dynamic games policy iteration off-policy

来源：评论

学校读者我要写书评

暂无评论

Further results on cloud control systems

引用

Science China(Information Sciences) 2016年第7期59卷 232-236页

作者： Yuanqing XIA Yongming QIN Di-Hua ZHAI Senchun CHAI School of Automation Key Laboratory of Intelligent Control and Decision of Complex SystemsBeijing Institute of Technology

This paper is devoted to further investigating the cloud control systems(CCSs). The benefits and challenges of CCSs are provided. Both new research results of ours and some typical work made by other researchers are p... 详细信息

关键词： cloud control systems cloud computing cyber-physical systems networked control systems big data

来源：评论

学校读者我要写书评

暂无评论

Cramér-Rao Bound Minimization for a Passive Sensing Multi-ISAC System

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Chen, Jian Chen, Qikai Deng, Yansha Jia, Jie Yin, Baoxin Wang, Xingwei Northeastern University School of Computer Science and Engineering Shenyang110819 China Northeastern University Engineering Research Center of Security Technology of Complex Network System Ministry of Education Shenyang110819 China Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China King's College London LondonWC2R 2LS United Kingdom

The integrated sensing and communication (ISAC) system can simultaneously provide communication and radar sensing, effectively improving spectrum utilization. However, existing research mainly focuses on the mono-static sensing ISAC system, which has shortcomings in limited sensing range and accuracy. We thus investigate a passive sensing multi-ISAC system with multiple communication users and sensing targets, and consider two cases for multi-target sensing without and with prior target knowledge at the base stations (BSs), in which the BSs are interested in estimating the targets' response matrix and channel coefficients, respectively. We also formulate a joint beamforming problem to minimize the Cramér-Rao bound (CRB) of the worst estimation constrained by communication requirements, and obtain the optimal solution with semidefinite relaxation (SDR) assisted transformation. To verify the advantages of our proposed scheme, we consider the bi-static BSs system (B-B) and beamforming with sensing interference cancellation (W-S) as two benchmark schemes. Numerical results illustrate that the proposed scheme obtains better sensing performance and effectively alleviates the effect caused by sensing interference. © 1967-2012 IEEE.

关键词： Cramer-Rao bounds

来源：评论

学校读者我要写书评

暂无评论

On Real Reward Testing

引用

Journal of Shanghai Jiaotong university(Science) 2011年第4期16卷 479-484页

作者：杨伟忠邓玉欣 MOE-MS Key Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiaotong University

We extend the traditional nonnegative reward testing with negative *** this new testing framework,may preorder and must preorder are the inverse of each *** surprisingly,it turns out that the real reward must testing is no more powerful than the nonnegative reward testing,at least for finite processes. In order to prove that result,we exploit an important property of failure simulation about the inclusion of the testing outcomes between two related processes.

关键词： probabilistic processes real reward testing nonnegative reward testing failure simulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：