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

Observer-based event-triggered formation tracking control for second-order multi-agent systems in constrained region

引用

Science China(Information Sciences) 2025年第2期68卷 151-169页

作者： Fenglan SUN Zhonghua XU Wei ZHU ■ KURTHS Key Lab of Intelligent Analysis and Decision on Complex Systems School of ScienceChongqing University of Posts and Telecommunications Key Lab of Intelligent Air-Ground Cooperative Control for Universities in Chongqing College of AutomationChongqing University of Posts and Telecommunications Department of Complexity Science Potsdam Institute for Climate Impact Research Institute of Physics Humboldt University of Berlin

In this paper, an event-triggered time-varying formation tracking control for a class of second-order nonlinear multiagent systems(MAS) operating within a constrained region is investigated. To mitigate the negative effects of external unknown disturbance, a novel disturbance observer with performance guarantees is proposed, enabling precise disturbance *** the artificial potential field(APF) method, a repulsive potential function is introduced to prevent inter-agent collisions as well as collisions with environmental obstacles. To reduce continuous communication and frequent system updates, a sliding mode technique is incorporated into the formation tracking controller, utilizing an event-triggered mechanism. The controller is also applicable to the formation control of MAS in switching-constrained regions. The achievement of the specified timevarying geometric formation is rigorously demonstrated through the Lyapunov framework. Numerical simulations are presented to validate the effectiveness of the theoretical results.

关键词： formation tracking control region constraints repulsive potential function event-triggered mechanism

来源：评论

学校读者我要写书评

暂无评论

Influence Enhanced Sparse Coordination Graphs for Multi-Agent Reinforcement Learning

引用

Neural Networks 2025年 188卷 107454页

作者： Zhang, Xiwen Chen, Jie Gan, Ming-Gang Chen, Haoxiang State Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China

In contemporary Multi-Agent Reinforcement Learning (MARL), effectively enhancing the expressive capacity of value functions has been a persistent research focus. Many studies have employed value decomposition methods;however, due to the neglect of inter-agent collaboration, these methods fall short of achieving optimal performance. Subsequent research introduced coordination graphs into value decomposition methods;nevertheless, these approaches often rely on simplistic rules to evaluate inter-agent collaboration and fail to adequately describe the collaborative relationships of agents in complex environments. Consequently, we propose Influence Enhanced Sparse Coordination Graphs (IESCG) as a solution to provide insights into the aforementioned problem. In this study, we propose influence networks as quantitative descriptions of the importance of collaboration among agents, utilizing them as crucial basis for constructing the topology of Sparse Time-Varying Coordination Graphs. Additionally, we propose Recurrent Payoff Function Networks (RPFN) to incorporate temporal information while providing necessary input to influence networks. Furthermore, Sparse Graph Advantage Selection Coefficients (SGASC) are introduced to stabilize the overall value function across different time steps, ensuring training stability. Experimental investigations conducted on the StarCraft II micromanagement and MACO benchmark indicate that our algorithm not only accelerates convergence and improves winning probabilities but also exhibits more pronounced advantages in complex scenarios. © 2025

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Contextual Multi-Armed Bandit-Based Dynamic Cooperative Link Configuration for AUV in UWASNs With Energy Harvesting

引用

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Dai, Jun Li, Xinbin Han, Song Yu, Junzhi Liu, Zhixin Yanshan University Key Lab of Industrial Computer Control Engineering of Hebei Province Qinhuangdao066004 China Yanshan University Key Laboratory of Intelligent Rehabilitation and Neuromodulation of Hebei Province Qinhuangdao066004 China Peking University State Key Laboratory for Turbulence and Complex Systems Department of Advanced Manufacturing and Robotics BIC-ESAT College of Engineering Beijing100871 China

This paper investigates the cooperative link configuration problem for Autonomous Underwater Vehicle (AUV) in Underwater Acoustic (UWA) sensor networks with Energy Harvesting (EH), which aims to maximize long-term cumulative capacity by jointly optimizing cooperation relay, AUV transmission power, and relay transmission power. Subject to unknown time-varying Channel state Information (CSI), unpredictable stochastic EH, and variable communication topology caused by AUV mobility, the proposed problem is an unknown dynamic combination decision optimization problem. To resist the change of the dynamic UWA communication topology with unknown time-varying CSI and EH, a novel collaborative contextual multi-armed bandit learning framework is proposed, which allows relay nodes to learn cooperatively and enriches the learning information of relays. Consequently, the proposed learning framework can resist the change of the dynamic UWA communication topology efficiently, thereby achieving the superior link configuration quickly. Besides, a learning-rate adjustment rule for the dynamic UWA communication topology is proposed to adaptively balance the exploration-exploitation, thereby avoiding missing the real superior joint relay-power configuration. Finally, simulation results show the significantly superiority of the proposed scheme. © 2015 IEEE.

关键词： Cooperative communication

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Learning and control with Event-Triggered Measurements

引用

IEEE Transactions on Automatic control 2025年

作者： Feng, Shilun Shi, Dawei Chen, Tongwen Shi, Ling Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems MIIT Key Laboratory of Servo Motion System Drive and Control School of Automation Beijing100081 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 1H9 Canada Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Clear Water Bay Kowloon Hong Kong

Event-triggered control has attracted considerable attention for its effectiveness in resource-restricted applications. To make event-triggered control as an end-to-end solution, a key issue is how to effectively learn unknown system dynamics from event-triggered measurements and consequently, develop a learning-based event-triggered controller. Existing works learn system dynamics based on periodic time-triggered measurements, and it is yet to know how to learn a controller with performance guarantee based on event-triggered measurements. To address this issue, we consider the problem of learning an event-triggered state feedback controller for an unknown linear system based on event-triggered state measurements in this work. In particular, we first analyze the event-triggered measurements within a set-membership framework. We prove that the estimation error belongs to a bounded ellipsoid determined by the historical measurements and the event-triggering condition. Subsequently, we demonstrate that all admissible systems compatible with the collected data samples can be explicitly represented in the form of quadratic matrix inequalities using the state estimates. With the acquired set of admissible systems, a co-design problem for the data-driven controller and event-triggering condition is solved using the linear matrix inequality technique, with guaranteed closed-loop stability and L2-gain performance. Finally, numerical examples and comparisons are provided to illustrate the effectiveness of the proposed event-triggered learning and control approach. © 1963-2012 IEEE.

关键词： Networked control systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Design and development of a new autonomous transportation robot for finished vehicles docking transportation in RO/RO logistics terminal

引用

Advanced Engineering Informatics 2025年 66卷

作者： Yongkang Xu Lin Zhang Zhi Liu Shoukun Wang Junzheng Wang State Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing 100081 China

With the continuous growth of the automobile trade, the inefficiency of traditional cargo transshipment in Roll-On/Roll-Off (RO/RO) terminals has become increasingly pronounced. As a result, the adoption of autonomous transportation robot (ATR) for the automatic handling of finished vehicles has seen significant growth. However, ATRs designed for this purpose face several limitations, including suboptimal mobility performance and the necessity for additional infrastructure to support their operation. This paper introduces a novel ATR that offers enhanced flexibility and operational capability. To further optimize the positioning of LiDAR, we develop a multi-stage LiDAR fusion algorithm for the precise localization of finished vehicles, incorporating an event-triggered decision-making approach to improve positioning accuracy. Based on the accurate positioning data, we propose a docking strategy consisting of two key phases: the approach phase and the docking phase. During the docking phase, an enhanced Model Predictive control (MPC) algorithm, integrated with a Radial Basis Function (RBF) neural network, is designed to enable real-time adjustment of the robot’s docking attitude. The effectiveness of the proposed approach is validated through real-world robot experimentals demonstrating its practical viability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Path planning for unmanned aerial vehicles in surveillance tasks under wind fields

引用

Journal of Central South University 2014年第8期21卷 3079-3091页

作者：张兴陈杰辛斌 School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems

The optimal path planning for fixed-wing unmanned aerial vehicles(UAVs) in multi-target surveillance tasks(MTST) in the presence of wind is *** take into account the minimal turning radius of UAVs,the Dubins model is used to approximate the dynamics of *** on the assumption,the path planning problem of UAVs in MTST can be formulated as a Dubins traveling salesman problem(DTSP).By considering its prohibitively high computational cost,the Dubins paths under terminal heading relaxation are introduced,which leads to significant reduction of the optimization scale and difficulty of the whole ***,in view of the impact of wind on UAVs' paths,the notion of virtual target is *** application of the idea successfully converts the Dubins path planning problem from an initial configuration to a target in wind into a problem of finding the minimal root of a transcendental ***,the Dubins tour is derived by using differential evolution(DE) algorithm which employs random-key encoding technique to optimize the visiting sequence of ***,the effectiveness and efficiency of the proposed algorithm are demonstrated through computational *** results exhibit that the proposed algorithm can produce high quality solutions to the problem.

关键词： unmanned aerial vehicle path planning in wind field Dubins traveling salesman problem terminal heading relaxation differential evolution

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective Cooperative Salvo Attack Against Group Target

引用

Journal of systems Science & complexity 2018年第1期31卷 244-261页

作者： ZENG Jie DOU Lihua XIN Bin School of Automation State Key Laboratory of Intelligent Control and Decision of Complex SystemsBeijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology

This paper proposes a solution for the problem of cooperative salvo attack of multiple cruise missiles against targets in a group. Synchronization of the arrival time of missiles to hit their common target, minimizing the time consumption of attack and maximizing the expected damage to group targets are taken into consideration simultaneously. These operational objectives result in a hierarchical mixed-variable optimization problem which includes two types of subproblems, namely the multi-objective missile-target assignment（MOMTA） problem at the upper level and the time-optimal coordinated path planning（TOCPP） problems at the lower level. In order to solve the challenging problem, a recently proposed coordinated path planning method is employed to solve the TOCPP problems to achieve the soonest salvo attack against each target. With the aim of finding a more competent solver for MOMTA, three state-of-the-art multi-objective optimization methods（MOMs）,namely NSGA-II, MOEA/D and DMOEA-εC, are adopted. Finally, a typical example is used to demonstrate the advantage of the proposed method. A simple rule-based method is also employed for comparison. Comparative results show that DMOEA-εC is the best choice among the three MOMs for solving the MOMTA problem. The combination of DMOEA-εC for MOMTA and the coordinated path planning method for TOCPP can generate obviously better salvo attack schemes than the rule-based method.

关键词： Coordinated path planning missile-target assignment multi-missile salvo attack multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：