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

Conditional Diffusion Model for Skeleton-based Gesture Recognition with Severe Occlusions

IEEE Signal Processing Letters 2025年 32卷 1970-1974页

作者： Liu, Jinting Gan, Minggang Du, Yao Guan, keyi Guo, Jia Beijing Institute of Technology Key Laboratory of Complex System Intelligent Control and Decision School of Automation Beijing China

In the field of skeleton-based gesture recognition, occlusion remains a significant challenge, significantly degrading performance when key joints are occluded or disturbed. To tackle this issue, we propose DiffTrans, a practical conditional diffusion model for occlusion recognition, which enables skeleton-based gesture recognition under high occlusion by generating more likely samples. This study addresses the hand skeleton occlusion problem by framing it as a conditional denoising problem, where unoccluded data serve as observations and occluded data as repair targets. We employ a conditional diffusion model to impute the missing skeleton data and the DSTANet model, which is based on the transformer, to learn the skeleton feature representations. Research results show that the DiffTrans outperforms existing methods under various occlusion modes, maintaining high performance even in scenarios with a high missing rate. © 1994-2012 IEEE.

关键词： Musculoskeletal system

来源：评论

学校读者我要写书评

暂无评论

Neural-based prescribed-time consensus control for multiagent systems via dynamic memory event-triggered mechanism

引用

Science China(Technological Sciences) 2025年第3期68卷 217-227页

作者： Xiaohong ZHENG Hui MA Qi ZHOU Hongyi LI School of Automation Guangdong-Hong Kong Joint Laboratory for Intelligent Decision and Cooperative Controland Guangdong Provincial Key Laboratory for Intelligent Decision and Cooperative ControlGuangdong University of TechnologyGuangzhou510006China School of Mathematics and Statistics Guangdong University of TechnologyGuangzhou510006China College of Electronic and Information Engineering and the Chongqing Key Laboratory of Generic Technology and System of Service Robots Southwest UniversityChongqing400715China

This work investigates the implementation of distributed prescribed-time neural network(NN)control for nonlinear multiagent systems(MASs)using a dynamic memory event-triggered mechanism(DMETM).First,it introduces a composite learning technique in NN *** method leverages the prediction error within the NN update law to enhance the accuracy of the unknown nonlinearity ***,by introducing a time-varying transformation,the study establishes a distributed prescribed-time control *** notable feature of this algorithm is its ability to predetermine the convergence time independently of initial conditions or control ***,the DMETM is established to reduce the actuation frequency of the *** the conventional memoryless dynamic event-triggered mechanism,the DMETM incorporates a memory term to further increase triggering *** a distributed estimator for the leader,the DMETM-based NN prescribed-time controller is designed in a fully distributed manner,which guarantees that all signals in the closed-loop system remain bounded within the prescribed ***,simulation results are presented to validate the effectiveness of the proposed algorithm.

关键词： consensus control composite learning control dynamic memory event-triggered control prescribed-time control multiagent systems(MASs)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Swarm-Based Dynamic Coverage of Multi-ASV systems in the Presence of Measurement Noises

引用

IEEE Transactions on Vehicular Technology 2025年第5期74卷 7237-7250页

作者： Liu, Lu Jiao, Shijian Han, Bing Li, Tieshan Peng, Zhouhua Dalian Maritime University School of Marine Electrical Engineering Dalian116026 China Dalian Key Laboratory of Swarm Control and Electrical Technology for Intelligent Ships Dalian116026 China State Key Laboratory of Maritime Technology and Safety Dalian116026 China Shanghai Ship and Shipping Research Institute National Engineering Research Center of Ship & Shipping Control System Shanghai200135 China University of Electronic Science and Technology of China School of Automation Engineering Chengdu611731 China

This paper is concerned with the dynamic coverage of multiple autonomous surface vehicles (ASVs) in the presence of static and dynamic obstacles, limited communication distance, and measurement noises. A modular control method including planning, guidance, and control is proposed. At the planning level, a swarm-based dynamic coverage strategy is developed to achieve the coverage of a given domain. Both the collision avoidance and connectivity preservation issues are solved by using artificial potential fields. At the kinematic level, novel adaptive line-of-sight guidance laws are presented based on cascade extended state observers (CESOs), such that accurate guidance signals are given by compensating for time-varying sideslip angle and suppressing measurement noises. At the kinetic level, two CESOs are developed to estimate the internal model uncertainties and external environmental disturbance, and antidisturbance kinetic control laws are designed subsequently. The proposed CESOs overcome the noises sensitivity problem of classical observers, and thus facilitate the practical implementation under measurement noises. The input-to-state stability of the closed-loop system is confirmed by the Lyapunov theory and cascade stability theory. Simulation and hardware-in-the-loop experiment results are provided to demonstrate the effectiveness of the proposed swarm-based dynamic coverage method. © 1967-2012 IEEE.

关键词： Velocity measurement

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Hybrid optimization of dynamic deployment for networked fire control system

引用

Journal of systems Engineering and Electronics 2013年第6期24卷 954-961页

作者： Chen Chen Jie Chen Bin Xin School of Automation Beijing Institute of Technology Key Laboratory of Complex System Intelligent Control and Decision Ministry of Education

With applying the information technology to the military field, the advantages and importance of the networked combat are more and more obvious. In order to make full use of limited battlefield resources and maximally destroy enemy targets from arbitrary angle in a limited time, the research on firepower nodes dynamic deployment becomes a key problem of command and control. Considering a variety of tactical indexes and actual constraints in air defense, a mathematical model is formulated to minimize the enemy target penetration probability. Based on characteristics of the mathematical model and demands of the deployment problems, an assistance-based algorithm is put forward which combines the artificial potential field （APF） method with a memetic algorithm. The APF method is employed to solve the constraint handling problem and generate feasible solutions. The constrained optimization problem transforms into an optimization problem of APF parameters adjustment, and the dimension of the problem is reduced greatly. The dynamic deployment is accomplished by generation and refinement of feasible solutions. The simulation results show that the proposed algorithm is effective and feasible in dynamic situation.

关键词： deployment optimization artificial potential field (APF) constraint handling generation of feasible solutions memetic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Interactive multiobjective evolutionary algorithm based on decomposition and compression

引用

Science China(Information Sciences) 2021年第10期64卷 166-181页

作者： Lu CHEN Bin XIN Jie CHEN School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems

Many real-world optimization problems involve multiple conflicting objectives. Such problems are called multiobjective optimization problems(MOPs). Typically, MOPs have a set of so-called Pareto optimal solutions rather than one unique optimal solution. To assist the decision maker(DM) in finding his/her most preferred solution, we propose an interactive multiobjective evolutionary algorithm(MOEA)called iDMOEA-εC, which utilizes the DM's preferences to compress the objective space directly and progressively for identifying the DM's preferred region. The proposed algorithm employs a state-of-the-art decomposition-based MOEA called DMOEA-εC as the search engine to search for solutions. DMOEA-εC decomposes an MOP into a series of scalar constrained subproblems using a set of evenly distributed upper bound vectors to approximate the entire Pareto front. To guide the population toward only the DM's preferred part on the Pareto front, an adaptive adjustment mechanism of the upper bound vectors and two-level feasibility rules are proposed and integrated into DMOEA-εC to control the spread of the population. To ease the DM's burden, only a small set of representative solutions is presented in each interaction to the DM,who is expected to specify a preferred one from the set. Furthermore, the proposed algorithm includes a two-stage selection procedure, allowing to elicit the DM's preferences as accurately as possible. To evaluate the performance of the proposed algorithm, it was compared with other interactive MOEAs in a series of experiments. The experimental results demonstrated the superiority of iDMOEA-εC over its competitors.

关键词： multiobjective optimization interactive decision making preference incorporation decomposition compression

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：