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

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

来源：评论

学校读者我要写书评

暂无评论

Optimal Carbon Capture, Utilization and Storage Planning for Multi-Energy System 42

Optimal Carbon Capture, Utilization and Storage Planning for...

引用

42nd Chinese control Conference, CCC 2023

作者： Hu, Aoyu Xu, Da Gao, Menglu 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 Dc Company of State Grid Hubei Electric Power Co. Ltd. Yichang443000 China

ISBN: (纸本)9789887581543

In response to the national dual carbon policy, carbon capture, utilization and storage (CCUS) are currently attracting much attention. This paper proposes optimal CCUS planning for multi-energy system. In this multi-energy system, transmission network and natural gas network are coupled via conversion and storage devices in the energy hubs. The CCUS planning is formulated based on a source-sink matching method to analyze the CO2 capture points, CO2 storage points and CO2 transportation routes. Furthermore, the original CCUS planning problem is reformulated as a mixed integer second order cone programming (MISOCP) and subsequently solved to guarantee a satisfactory convergence performance. Numerical studies on an urban multi-energy system are implemented to verify the effectiveness and superiority of the proposed methodology over conventional scheme. © 2023 Technical Committee on control Theory, Chinese Association of Automation.

关键词： Carbon capture

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Primal-dual Accelerated Mirror-Descent Method for Constrained Bilinear Saddle-Point Problems

arXiv

引用

arXiv 2024年

作者： Li, Weijian Zeng, Xianlin Pavel, Lacra The Department of Electrical and Computer Engineering University of Toronto TorontoONM5S 3G4 Canada The Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China

We develop a first-order accelerated algorithm for a class of constrained bilinear saddle-point problems with applications to network systems. The algorithm is a modified time-varying primal-dual version of an accelerated mirror-descent dynamics. It deals with constraints such as simplices and convex set constraints effectively, and converges with a rate of O(1/t2). Furthermore, we employ the acceleration scheme to constrained distributed optimization and bilinear zero-sum games, and obtain two variants of distributed accelerated algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Mirrors

来源：评论

学校读者我要写书评

暂无评论

Distributed Cooperative Search Method for Multi-Uav with Unstable Communications

SSRN

引用

SSRN 2023年

作者： Zhang, Huaqing Ma, Hongbin Mersha, Bemnet Wondimagegnehu Zhang, Xiaofei Jin, Ying School of Automation Beijing Institute of Technology Beijing100081 China State Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Institution of Technology Beijing100081 China School of Vehicle and Mobility Tsinghua University Beijing100084 China

In search-attack and search-rescue tasks performed by multi-UAV, cooperative search plays an important part. The majority of approaches in use today assume that the UAV swarm's communication network is complete. However, these links are susceptible to environmental changes or adversary interference. Aiming at cooperative search in search-attack and search-rescue tasks, we propose a distributed cooperative search method for multi-UAV with unstable communications (DCS-UC), which is developed based on ant colony optimization (ACO). In this method, three algorithms are presented to enable the UAV swarm to conduct online cooperative search efficiently and safely. Firstly, an algorithm of pheromone matrix consensus update used in ACO is designed under switching and connected topology graphs, which can make the pheromone matrix maintained by each UAV achieve consensus, so that the cooperative efficiency of the UAV swarm is improved. Then, a position consensus update algorithm is presented where the position vector, including the positions of all the UAVs in each UAV, can achieve consensus under switching and connected topology graphs. Finally, to tackle the collision avoidance of all the UAVs, an algorithm of collision avoidance between UAVs is designed by using the obtained consistent positions of all the UAVs, which can make the UAV swarm conduct cooperative search safely. Extensive physical simulation results carried out in Gazebo verify the advantages of our multi-UAV cooperative search method. © 2023, The Authors. All rights reserved.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Deep Domain Adaptation Regression for Force Calibration of Optical Tactile Sensors

arXiv

引用

arXiv 2024年

作者： Chen, Zhuo Ou, Ni Jiang, Jiaqi Luo, Shan Robot Perception Lab Centre for Robotics Research Department of Engineering King’s College London LondonWC2R 2LS United Kingdom State Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Institute of Technology Beijing100081 China

Optical tactile sensors provide robots with rich force information for robot grasping in unstructured environments. The fast and accurate calibration of three-dimensional contact forces holds significance for new sensors and existing tactile sensors which may have incurred damage or aging. However, the conventional neural-network-based force calibration method necessitates a large volume of force-labeled tactile images to minimize force prediction errors, with the need for accurate Force/Torque measurement tools as well as a time-consuming data collection process. To address this challenge, we propose a novel deep domain-adaptation force calibration method, designed to transfer the force prediction ability from a calibrated optical tactile sensor to uncalibrated ones with various combinations of domain gaps, including marker presence, illumination condition, and elastomer modulus. Experimental results show the effectiveness of the proposed unsupervised force calibration method, with lowest force prediction errors of 0.102N (3.4% in full force range) for normal force, and 0.095N (6.3%) and 0.062N (4.1%) for shear forces along the x-axis and y-axis, respectively. This study presents a promising, general force calibration methodology for optical tactile sensors. Copyright © 2024, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

TransForce: Transferable Force Prediction for Vision-based Tactile Sensors with Sequential Image Translation

arXiv

引用

arXiv 2024年

作者： Chen, Zhuo Ou, Ni Zhang, Xuyang Luo, Shan The Robot Perception Lab Centre for Robotics Research Department of Engineering King's College London LondonWC2R 2LS United Kingdom The State Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Institute of Technology Beijing100081 China

Vision-based tactile sensors (VBTSs) provide high-resolution tactile images crucial for robot in-hand manipulation. However, force sensing in VBTSs is underutilized due to the costly and time-intensive process of acquiring paired tactile images and force labels. In this study, we introduce a transferable force prediction model, TransForce, designed to leverage collected image-force paired data for new sensors under varying illumination colors and marker patterns while improving the accuracy of predicted forces, especially in the shear direction. Our model effectively achieves translation of tactile images from the source domain to the target domain, ensuring that the generated tactile images reflect the illumination colors and marker patterns of the new sensors while accurately aligning the elastomer deformation observed in existing sensors, which is beneficial to force prediction of new sensors. As such, a recurrent force prediction model trained with generated sequential tactile images and existing force labels is employed to estimate higher-accuracy forces for new sensors with lowest average errors of 0.69N (5.8% in full work range) in x-axis, 0.70N (5.8%) in y-axis, and 1.11N (6.9%) in z-axis compared with models trained with single images. The experimental results also reveal that pure marker modality is more helpful than the RGB modality in improving the accuracy of force in the shear direction, while the RGB modality show better performance in the normal direction. Copyright © 2024, The Authors. All rights reserved.

关键词： RGB color model

来源：评论

学校读者我要写书评

暂无评论

Geometry Problem Solving Based on Counter-Factual Evolutionary Reasoning 19

Geometry Problem Solving Based on Counter-Factual Evolutiona...

引用

19th IEEE International Conference on Automation Science and Engineering, CASE 2023

作者： Song, Bing Xiong, Gang Shen, Zhen Zhu, Fenghua Lv, Yisheng Ye, Peijun Institute of Automation Chinese Academy of Sciences The State Key Laboratory of Management and Control for Complex Systems Beijing China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China Institute of Automation Chinese Academy of Sciences The Beijing Engineering Research Center of Intelligent Systems and Technology China Chinese Academy of Sciences The Guangdong Engineering Research Center of 3D Printing and Intelligent Manufacturing The Cloud Computing Center Dongguan523808 China Qingdao Academy of Intelligent Industries Intelligent Manufacturing Center Qingdao266000 China

ISBN: (纸本)9798350320695

As a representative topic in natural language processing and automated theorem proving, geometry problem solving requires an abstract problem understanding and symbolic reasoning. A major challenge here is to find a feasible reasoning sequence that is consistent with given axioms and the theorems already proved. Most recent methods have exploited neural network-based techniques to automatically discover eligible solving steps. Such a kind of methods, however, is greatly impacted by the expert solutions for training. To improve the accuracy, this paper proposes a new method called counterfactual evolutionary reasoning, which uses a generative adversarial network to generate initial reasoning sequences and then introduces counterfactual reasoning to explore potential solutions. By directly exploring theorem candidates rather than the neural network selection, the new method can sufficiently extend the searching space to get a more appropriate reasoning step. Through comparative experiments on the recent proposed Geometry3k, the largest geometry problem solving dataset, our method generally achieves a higher accuracy than most previous methods, bringing an overall improvement about 4.4% compared with the transformer models. © 2023 IEEE.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Path Tracking control of Tracked Paver Based on Improved Pure Pursuit Algorithm

Path Tracking Control of Tracked Paver Based on Improved Pur...

引用

第40届中国控制会议

作者： Shuai Wang Shanshan Fu Bin Li Shoukun Wang State Key Laboratory of Intelligent Control and Decision of Complex Systems School of AutomationBeijing Institute of Technology

This paper investigates the high-precision path tracking control of tracked paver combined with global satellite navigation *** the paver is performing paving operations,it requires high path tracking accuracy and good vehicle ***,considering the influence of road curvature on path tracking accuracy and vehicle stability,and the situation that the vehicle can not move quickly to the expectation path when the lateral position of the vehicle deviates from the expectation path,this paper proposes a lateral path tracking control method based on improved Pure Pursuit *** control method is verified through *** experimental results show that the maximum lateral tracking error of the improved algorithm is 0.04 m,which is 55.56% lower than that of the original algorithm,and the average lateral tracking error is 0.02 m,which is60% lower than that of the original *** purpose of high-precision path tracking of the paver is realized.

关键词： Tracked paver Path tracking Road curvature Pure Pursuit algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：