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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Adaptive Event-Based Consensus of Multi-Agent systems with General Linear Dynamics

引用

Journal of systems Science & complexity 2018年第1期31卷 120-129页

作者： WANG Dandan ZHOU Qianghui ZHU Wei Key Lab of Intelligent Analysis and Decision on Complex Systems Chongqing University of Posts and Telecom-munications

In this paper, adaptive event-based consensus of multi-agent systems with general linear dynamics is considered. A novel adaptive event-based controller and a state-dependent triggering function are proposed for each agent. The consensus can be achieved without the assumption that（A, B） is stabilizable. Furthermore, the Zeno-behavior of the concerned closed-loop system is also excluded under certain conditions. Finally, a numerical simulation example is presented to show the effectiveness of the theoretical results.

关键词： Event-based control adaptive control consensus Zeno-behavior

来源：评论

学校读者我要写书评

暂无评论

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-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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Sliding mode control based guidance law with impact angle constraint

引用

Chinese Journal of Aeronautics 2014年第1期27卷 145-152页

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

The terminal guidance problem for an unpowered lifting reentry vehicle against a sta- tionary target is considered. In addition to attacking the target with high accuracy, the vehicle is also expected to achieve a desired impact angle. In this paper, a sliding mode control （SMC）-based guidance law is developed to satisfy the terminal angle constraint. Firstly, a specific sliding mode function is designed, and the terminal requirements can be achieved by enforcing both the sliding mode function and its derivative to zero at the end of the flight. Then, a backstepping approach is used to ensure the finite-time reaching phase of the sliding mode and the analytic expression of the control effort can be obtained. The trajectories generated by this method only depend on the initial and terminal conditions of the terminal phase and the instantaneous states of the vehicle. In order to test the performance of the proposed guidance law in practical application, numerical simulations are carried out by taking all the aerodynamic parameters into consideration. The effec- tiveness of the proposed guidance law is verified by the simulation results in various scenarios.

关键词： Backstepping Impact angle Sliding mode control Terminal guidance Unpowered lifting reentryvehicle

来源：评论

学校读者我要写书评

暂无评论

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.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：