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

Trajectory reshaping based guidance with impact time and angle constraints

Chinese Journal of Aeronautics 2016年第4期29卷 984-994页

作者： Zhao Yao Sheng Yongzhi Liu Xiangdong School of Automation Beijing Institute of Technology Key Laboratory for Intelligent Control and Decision of Complex Systems Beijing Institute of Technology

This study presents a novel impact time and angle constrained guidance law for homing missiles. The guidance law is first developed with the prior-assumption of a stationary target, which is followed by the practical extension to a maneuvering target scenario. To derive the closed-form guidance law, the trajectory reshaping technique is utilized and it results in defining a specific polynomial function with two unknown coefficients. These coefficients are determined to satisfy the impact time and angle constraints as well as the zero miss distance. Furthermore, the proposed guidance law has three additional guidance gains as design parameters which make it possible to adjust the guided trajectory according to the operational conditions and missile's capability. Numerical simulations are presented to validate the effectiveness of the proposed guidance law. (C) 2016 Chinese Society of Aeronautics and Astronautics. Production and hosting by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license.

关键词： Guidance Homing missiles Impact angle Impact time Trajectory reshaping

来源：评论

学校读者我要写书评

暂无评论

Subspace Deep Learning of Independent Component Regression Model for Ensemble Spectroscopic Calibration

引用

IEEE Sensors Journal 2025年

作者： Zheng, Junhua Zhou, Hansong Liu, Xinyu Lyu, Yuting Yang, Zeyu Ge, Zhiqiang Zhejiang University of Science and Technology School of Automation and Electrical Engineering Hangzhou China Huzhou University Huzhou Key Laboratory of Intelligent Sensing and Optimal Control for Industrial Systems School of Engineering Huzhou313000 China Southeast University School of Mathematics Nanjing210096 China

Independent component regression (ICR) has become as an important spectroscopic calibration modeling method, due to its advantages in extracting non-Gaussian and high-order statistic features. While the calibration performance of ICR was recently improved by its deep learning form, the result is unstable which is subjected to different random seeds in the model initialization stage. This, however, will make the model less trustworthy in practical industrial applications. In this paper, a subspace deep learning framework is formulated to combine the ideas of both deep learning and ensemble learning, in order to improve the prediction stability of the ICR model. Meanwhile, with an appropriate design of the ensemble learning strategy in the subspace modeling framework, the calibration performance can be further enhanced. For performance evaluation, a detailed benchmark case study on the Corn dataset is carried out. Compared to ordinary and deep residual ICR models, both of the calibration performance and prediction stability have been significantly improved by the subspace deep learning approach. © 2001-2012 IEEE.

关键词： Linear regression

来源：评论

学校读者我要写书评

暂无评论

Finite-time sliding-mode control for semi-Markov systems with delayed impulses

引用

IEEE/CAA Journal of Automatica Sinica 2025年

作者： Ren, Fangmin Wang, Xiaoping Li, Yangmin Zeng, Zhigang The School of Artificial Intelligence and Automation The Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Hubei Key Laboratory of Braininspired Intelligent Systems Huazhong University of Science and Technology Wuhan430074 China The Department of Industrial and Systems Engineering The Hong Kong Polytechnic University Hong Kong999077 Hong Kong

来源：评论

学校读者我要写书评

暂无评论

High-order sliding mode attitude controller design for reentry flight

引用

Journal of systems Engineering and Electronics 2014年第5期25卷 848-858页

作者： Liang Wang Yongzhi Sheng Xiangdong Liu School of Automation Beijing Institute of Technology Key Laboratory for Intelligent Control & Decision of Complex Systems Beijing Institute of Technology

A novel high-order sliding mode control strategy is proposed for the attitude control problem of reentry vehicles in the presence of parametric uncertainties and external disturbances, which results in the robust and accurate tracking of the aerodynamic angle commands with the finite time convergence. The proposed control strategy is developed on the basis of integral sliding mode philosophy, which combines conventional sliding mode control and a linear quadratic regulator over a finite time interval with a free-final-state and allows the finite-time establishment of a high-order sliding mode. Firstly, a second-order sliding mode attitude controller is designed in the proposed high-order siding mode control framework. Then, to address the control chattering problem, a virtual control is introduced in the control design and hence a third-order sliding mode attitude controller is developed, leading to the chattering reduction as well as the control accuracy improvement. Finally, simulation examples are given to illustrate the effectiveness of the theoretical results.

关键词： reentry vehicle attitude control high-order sliding mode control integral sliding mode.

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Multimodal Emotion Recognition Based on Multi-Scale Facial Features and Cross-Modal Attention

Multimodal Emotion Recognition Based on Multi-Scale Facial F...

引用

IEEE International Conference on Industrial Technology (ICIT)

作者： Chengao Bao Luefeng Chen Min Li Min Wu Witold Pedrycz Kaoru Hirota School of Automation China University of Geosciences Wuhan China the Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems School of Automation and the Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education China University of Geosciences Wuhan China Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Tokyo Institute of Technology Yokohama Japan Tokyo Institute of Technology Tokyo Japan

ISBN: (数字)9798331521950

ISBN: (纸本)9798331521967

A multi-modal emotion recognition method based on facial multi-scale features and cross-modal attention (MS-FCA) network is proposed. The MSFCA model improves the traditional single-branch ViT network into a two-branch ViT architecture by using classification tokens in each branch to interact with picture embeddings in the other branch, which facilitates effective interactions between different scales of information. Subsequently, audio features are extracted using ResNet18 network. The cross-modal attention mechanism is used to obtain the weight matrices between different modal features, making full use of inter-modal correlation and effectively fusing visual and audio features for more accurate emotion recognition. Two datasets are used for the experiments: eNTERFACE'05 and REDVESS dataset. The experimental results show that the accuracy of the proposed method on the eNTERFACE'05 and REDVESS datasets is 85.42% and 83.84% respectively, which proves the effectiveness of the proposed method.

关键词： Emotion recognition Visualization Accuracy Service robots Semantics Human-robot interaction Speech recognition Feature extraction Data mining Facial features

来源：评论

学校读者我要写书评

暂无评论

Safe Reinforcement Learning for Social Motor Coordination in Two Dimensional Space

Safe Reinforcement Learning for Social Motor Coordination in...

引用

IEEE International Conference on Industrial Technology (ICIT)

作者： Fan Yang Yuening Huang Chao Zhai Hehong Zhang China University of Geosciences Wuhan Campus School of Automation Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China Rice University George R. Brown School of Engineering and Computing Houston Texas United States Fuzhou University School of Computer and Data Science Fuzhou China

ISBN: (数字)9798331521950

ISBN: (纸本)9798331521967

This paper presents an interactive motion control method based on reinforcement learning, designed to assist children with autism who have social motor impairments through a mirror game intervention. The virtual teacher uses the Deep Deterministic Policy Gradient (DDPG) algorithm to optimize its actions, guiding the participant to follow a Lissajous trajectory. To ensure safety, a motion-correction mechanism was developed, which automatically adjusts actions when the predicted trajectory surpasses predefined safety boundaries. The reward function considers both the distance between the virtual teacher and the target trajectory, as well as the distance between the virtual teacher and the participant, with dynamic adjustments applied by the motion-correction mechanism. Experimental results demonstrate that the virtual teacher effectively guides the participant towards the target trajectory while adhering to safety constraints.

关键词： Autism Filters Reinforcement learning Games Variable speed drives Motors Trajectory Safety Mirrors Motion control

来源：评论

学校读者我要写书评

暂无评论

Distributed Event-Triggered Bandit Convex Optimization With Time-Varying Constraints

引用

IEEE Transactions on control of Network systems 2025年

作者： Zhang, Kunpeng Yi, Xinlei Wen, Guanghui Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Ministry of Education Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Shanghai201210 China Southeast University School of Automation Nanjing210096 China University of Groningen Engineering and Technology Institute Groningen Faculty of Science and Engineering GroningenAG 9747 Netherlands KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm10044 Sweden KTH Royal Institute of Technology Digital Futures Stockholm10044 Sweden

This paper considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms solving this problem require that each agent broadcasts its decision to its neighbors at each iteration. However, communication resources are often limited. To better utilize communication resources, we propose a distributed event-triggered online primal-dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and non-increasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results. © 2014 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Cooperative Hierarchical Coverage control of Multi-Agent systems with Non-holonomic Constraints in Poriferous Environments

引用

IEEE Transactions on control of Network systems 2025年

作者： Zou, Jiayu Zhang, Hai-Tao Zhai, Chao Xing, Ning Ma, Yong Liu, Xingjian Huazhong University of Science and Technology School of Artificial Intelligence and Automation The MOE Engineering Research Center of Autonomous Intelligent Unmanned Systems The State Key Laboratory of Digital Manufacturing Equipment and Technology Wuhan430074 China China University of Geosciences School of Automation China The MOE Engineering Research Center of Intelligent Technology for Geo-Exploration Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan430074 China Academician Workstation of China COSCO Shipping Corporation Ltd. Shanghai200120 China Wuhan University of Technology Sanya Science and Education Innovation Park Sanya572000 China Wuhan University of Technology Chongqing Research Institute Chongqing401120 China

It has long posed a challenging task to optimally deploy multi-agent systems (MASs) to cooperatively coverage poriferous environments in real cooperative detection applications. In response to this challenge, this paper proposes a hierarchical coverage control (HCC) protocol for MASs to perform sector-based coverage operations. First, a distributed Voronoi partition-based sweep-and-assign protocol, combined with a sectorial partition method, is developed, enabling the segmentation of a whole poriferous region into multiple sectorial sub-subregions. Following this procedure, an extreme search scheme is developed to determine the optimal amount of agents for each subregion. After this allocation, a distributed controller is proposed to deploy the agents, considering non-holonomic constraints, into designated niche positions. Additionally, sufficient conditions are derived to guarantee the asymptotical stability of the present HCC. The analytical challenge of the present study stems from the non-convex characteristics inherent in the loss function induced by porous environments. This non-convexity renders the task of globally optimizing the assignment of MASs intractable. Finally, numerical simulations are conducted to validate the effectiveness of the present coverage control approach. © 2014 IEEE.

关键词： Nonlinear control systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：