Pub Date : 2024-08-02DOI: 10.1007/s12555-023-0587-0
Lin-Jing Chen, Tao Han, Bo Xiao, Huaicheng Yan
This article mainly tackles the finite-time time-varying formation tracking (Fin-TVFT) problem and fixed-time time-varying formation tracking (Fix-TVFT) problem of multiple Euler-Lagrange systems (MELSs) subject to the external disturbances under the directed interaction topology. The distributed estimator-based hierarchical control (EBHC) algorithms are respectively formulated to achieve the foregoing problems. Note that the settling time of Fin-TVFT depends on the initial values, but the convergence time of Fix-TVFT is independent of the initial conditions. According to the Lyapunov stability analysis, several sufficient conditions for accomplishing the Fin-TVFT and Fix-TVFT are derived. Eventually, the simulation results are exhibited in order to illustrate the feasibility of the designed algorithms.
{"title":"Finite-time and Fixed-time Time-varying Formation Tracking for Multiple Euler-Lagrange Systems With Disturbances","authors":"Lin-Jing Chen, Tao Han, Bo Xiao, Huaicheng Yan","doi":"10.1007/s12555-023-0587-0","DOIUrl":"https://doi.org/10.1007/s12555-023-0587-0","url":null,"abstract":"<p>This article mainly tackles the finite-time time-varying formation tracking (Fin-TVFT) problem and fixed-time time-varying formation tracking (Fix-TVFT) problem of multiple Euler-Lagrange systems (MELSs) subject to the external disturbances under the directed interaction topology. The distributed estimator-based hierarchical control (EBHC) algorithms are respectively formulated to achieve the foregoing problems. Note that the settling time of Fin-TVFT depends on the initial values, but the convergence time of Fix-TVFT is independent of the initial conditions. According to the Lyapunov stability analysis, several sufficient conditions for accomplishing the Fin-TVFT and Fix-TVFT are derived. Eventually, the simulation results are exhibited in order to illustrate the feasibility of the designed algorithms.</p>","PeriodicalId":54965,"journal":{"name":"International Journal of Control Automation and Systems","volume":"26 1","pages":""},"PeriodicalIF":3.2,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141882739","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-02DOI: 10.1007/s12555-023-0117-0
Sang Deok Lee, Seul Jung
This article presents a data-driven control application to robot manipulation for implementing the time-delayed control (TDC) algorithm. TDC scheme uses the previous information to cancel out all the dynamics except the inertial torque in robot manipulators. The accuracy of estimating the inertia matrix plays an important role in control performance as well as the stability of TDC. Necessary information for the time-delayed control is inertia and acceleration signals. Since selecting the constant inertia matrix is simple but concerned with the poor performance, better estimation is required. Based on the input and output data of a robot manipulator, necessary models are obtained by a recursive least squares (RLS) algorithm and those models are used for estimating acceleration signals by designing a state observer (SOB). Here the models of a robot arm are decoupled, linearized, and identified by RLS algorithm and the joint acceleration signals are identified by a state observer in on-line fashion. Combining RLS, SOB, and TDC yields RST scheme for a robot manipulator to improve the tracking control performance by providing solutions for TDC problems. Tracking control performances of a mobile manipulator by the RST scheme are empirically tested.
{"title":"A Data-driven Control Scheme for Improving Tracking Control Performance of Robot Manipulators: Experimental Studies","authors":"Sang Deok Lee, Seul Jung","doi":"10.1007/s12555-023-0117-0","DOIUrl":"https://doi.org/10.1007/s12555-023-0117-0","url":null,"abstract":"<p>This article presents a data-driven control application to robot manipulation for implementing the time-delayed control (TDC) algorithm. TDC scheme uses the previous information to cancel out all the dynamics except the inertial torque in robot manipulators. The accuracy of estimating the inertia matrix plays an important role in control performance as well as the stability of TDC. Necessary information for the time-delayed control is inertia and acceleration signals. Since selecting the constant inertia matrix is simple but concerned with the poor performance, better estimation is required. Based on the input and output data of a robot manipulator, necessary models are obtained by a recursive least squares (RLS) algorithm and those models are used for estimating acceleration signals by designing a state observer (SOB). Here the models of a robot arm are decoupled, linearized, and identified by RLS algorithm and the joint acceleration signals are identified by a state observer in on-line fashion. Combining RLS, SOB, and TDC yields RST scheme for a robot manipulator to improve the tracking control performance by providing solutions for TDC problems. Tracking control performances of a mobile manipulator by the RST scheme are empirically tested.</p>","PeriodicalId":54965,"journal":{"name":"International Journal of Control Automation and Systems","volume":"216 1","pages":""},"PeriodicalIF":3.2,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141882743","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-02DOI: 10.1007/s12555-023-0483-7
Shuqing Wu, Shuang Shi, Xinhua Wang, Ju Jiang
In this paper, the integral event-triggered time-varying formation tracking (TVFT) problem is investigated for unmanned aerial vehicle (UAV) swarm systems with switching directed topologies. An improved integral event-triggered mechanism (ETM) is introduced into the TVFT control protocol, which can further reduce communication frequency and resource consumption compared with traditional static ETM. The switching topology is considered to improve the reliability of the communication network. Different from traditional TVFT, the addition of the switching signal and the ETM brings challenges to the system analysis and design. To this end, the control protocol of TVFT, the admissible edge-dependent average dwell time switching signal and the ETM are co-designed, the global exponential stability criterion is further deduced. The simulation verifies the effectiveness and merits of the design scheme.
{"title":"Integral Event-triggered Time-varying Formation Tracking for UAV Swarm Systems With Switching Directed Topologies","authors":"Shuqing Wu, Shuang Shi, Xinhua Wang, Ju Jiang","doi":"10.1007/s12555-023-0483-7","DOIUrl":"https://doi.org/10.1007/s12555-023-0483-7","url":null,"abstract":"<p>In this paper, the integral event-triggered time-varying formation tracking (TVFT) problem is investigated for unmanned aerial vehicle (UAV) swarm systems with switching directed topologies. An improved integral event-triggered mechanism (ETM) is introduced into the TVFT control protocol, which can further reduce communication frequency and resource consumption compared with traditional static ETM. The switching topology is considered to improve the reliability of the communication network. Different from traditional TVFT, the addition of the switching signal and the ETM brings challenges to the system analysis and design. To this end, the control protocol of TVFT, the admissible edge-dependent average dwell time switching signal and the ETM are co-designed, the global exponential stability criterion is further deduced. The simulation verifies the effectiveness and merits of the design scheme.</p>","PeriodicalId":54965,"journal":{"name":"International Journal of Control Automation and Systems","volume":"93 1","pages":""},"PeriodicalIF":3.2,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141882747","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-02DOI: 10.1007/s12555-023-0600-7
Xin Liu, Yong Chen, Siweihua Zhang, Pengcheng Fu
As unmanned aerial vehicles (UAVs) have limited energy resources and diverse constraints, the reconfiguration of their formation encounters substantial challenges. In this paper, we employ a leader-follower method. In order to minimize flight distance and resource consumption, a greedy algorithm is used to allocate leader and follower positions. Based on the limitations of the receding horizon control (RHC) method and the control parameterization and time discretization (CPTD) method, we propose the no reference path RHC (NRPRHC) method. The proposed method transforms the formation reconfiguration into smaller local optimization problems, leading to a reduction in the size of the optimization stages and computational complexity. For each local optimization problem, we propose the adaptive population differential evolution (APDE) algorithm to optimize the control inputs. Finally, the results are provided to illustrate the feasibility and effectiveness of the proposed method.
{"title":"No-reference Path Receding Horizon Control for Multi-UAV Formation Reconfiguration Based on Adaptive Differential Evolution","authors":"Xin Liu, Yong Chen, Siweihua Zhang, Pengcheng Fu","doi":"10.1007/s12555-023-0600-7","DOIUrl":"https://doi.org/10.1007/s12555-023-0600-7","url":null,"abstract":"<p>As unmanned aerial vehicles (UAVs) have limited energy resources and diverse constraints, the reconfiguration of their formation encounters substantial challenges. In this paper, we employ a leader-follower method. In order to minimize flight distance and resource consumption, a greedy algorithm is used to allocate leader and follower positions. Based on the limitations of the receding horizon control (RHC) method and the control parameterization and time discretization (CPTD) method, we propose the no reference path RHC (NRPRHC) method. The proposed method transforms the formation reconfiguration into smaller local optimization problems, leading to a reduction in the size of the optimization stages and computational complexity. For each local optimization problem, we propose the adaptive population differential evolution (APDE) algorithm to optimize the control inputs. Finally, the results are provided to illustrate the feasibility and effectiveness of the proposed method.</p>","PeriodicalId":54965,"journal":{"name":"International Journal of Control Automation and Systems","volume":"53 1","pages":""},"PeriodicalIF":3.2,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141882748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-02DOI: 10.1007/s12555-023-0724-9
Jianjun Ni, Yu Gu, Yang Gu, Yonghao Zhao, Pengfei Shi
In response to the increasingly complex problem of patrolling urban areas, the utilization of deep reinforcement learning algorithms for autonomous unmanned aerial vehicle (UAV) coverage path planning (CPP) has gradually become a research hotspot. CPP’s solution needs to consider several complex factors, including landing area, target area coverage and limited battery capacity. Consequently, based on incomplete environmental information, policy learned by sample inefficient deep reinforcement learning algorithms are prone to getting trapped in local optima. To enhance the quality of experience data, a novel reward is proposed to guide UAVs in efficiently traversing the target area under battery limitations. Subsequently, to improve the sample efficiency of deep reinforcement learning algorithms, this paper introduces a novel dynamic soft update method, incorporates the prioritized experience replay mechanism, and presents an improved deep double Q-network (IDDQN) algorithm. Finally, simulation experiments conducted on two different grid maps demonstrate that IDDQN outperforms DDQN significantly. Our method simultaneously enhances the algorithm’s sample efficiency and safety performance, thereby enabling UAVs to cover a larger number of target areas.
{"title":"UAV Coverage Path Planning With Limited Battery Energy Based on Improved Deep Double Q-network","authors":"Jianjun Ni, Yu Gu, Yang Gu, Yonghao Zhao, Pengfei Shi","doi":"10.1007/s12555-023-0724-9","DOIUrl":"https://doi.org/10.1007/s12555-023-0724-9","url":null,"abstract":"<p>In response to the increasingly complex problem of patrolling urban areas, the utilization of deep reinforcement learning algorithms for autonomous unmanned aerial vehicle (UAV) coverage path planning (CPP) has gradually become a research hotspot. CPP’s solution needs to consider several complex factors, including landing area, target area coverage and limited battery capacity. Consequently, based on incomplete environmental information, policy learned by sample inefficient deep reinforcement learning algorithms are prone to getting trapped in local optima. To enhance the quality of experience data, a novel reward is proposed to guide UAVs in efficiently traversing the target area under battery limitations. Subsequently, to improve the sample efficiency of deep reinforcement learning algorithms, this paper introduces a novel dynamic soft update method, incorporates the prioritized experience replay mechanism, and presents an improved deep double Q-network (IDDQN) algorithm. Finally, simulation experiments conducted on two different grid maps demonstrate that IDDQN outperforms DDQN significantly. Our method simultaneously enhances the algorithm’s sample efficiency and safety performance, thereby enabling UAVs to cover a larger number of target areas.</p>","PeriodicalId":54965,"journal":{"name":"International Journal of Control Automation and Systems","volume":"8 1","pages":""},"PeriodicalIF":3.2,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141882661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, the optimal backstepping control method based on game theory is designed for strict feedback nonlinear systems with input saturation. In order to improve the robustness of the system, the zero-sum game problem of control input and disturbance for strict feedback systems is studied in this paper. Specifically, reinforcement learning (RL) is used to obtain the Nash equilibrium solution of the subsystem corresponding to the virtual control input and the virtual disturbance based on the HJB equation. By using the recursive process of backstepping, the controller of the tracking game problem between the control input and the disturbance of the high-order system is designed. In addition, according to the Lyapunov stability theory, it is proved that all internal signals of the closed-loop systems are uniformly ultimately bounded (UUB). Finally, simulation results are provided to illustrate the validity of the proposed method.
{"title":"Game-based Optimized Backstepping Control for Strict-feedback Systems With Input Constraints","authors":"Liuliu Zhang, Hailong Jing, Cheng Qian, Changchun Hua","doi":"10.1007/s12555-023-0727-6","DOIUrl":"https://doi.org/10.1007/s12555-023-0727-6","url":null,"abstract":"<p>In this paper, the optimal backstepping control method based on game theory is designed for strict feedback nonlinear systems with input saturation. In order to improve the robustness of the system, the zero-sum game problem of control input and disturbance for strict feedback systems is studied in this paper. Specifically, reinforcement learning (RL) is used to obtain the Nash equilibrium solution of the subsystem corresponding to the virtual control input and the virtual disturbance based on the HJB equation. By using the recursive process of backstepping, the controller of the tracking game problem between the control input and the disturbance of the high-order system is designed. In addition, according to the Lyapunov stability theory, it is proved that all internal signals of the closed-loop systems are uniformly ultimately bounded (UUB). Finally, simulation results are provided to illustrate the validity of the proposed method.</p>","PeriodicalId":54965,"journal":{"name":"International Journal of Control Automation and Systems","volume":"29 1","pages":""},"PeriodicalIF":3.2,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141882741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-02DOI: 10.1007/s12555-023-0610-5
Yufang Xie, Mengjie Li, Lijun Gao
The main purpose of this paper is to study the stability of discrete-time impulsive switched T-S fuzzy systems with two kinds of asynchronous behaviors, including asynchronous behavior between impulse and switching, and asynchronous switching between controllers and subsystems. We divide the subsystems into stable and unstable subsystems, which respectively adopt slow switching and fast switching methods. Then, based on multiple Lyapunov functions, admissible edge-dependent average dwell time (AED-ADT) and admissible edge-dependent average impulsive interval (AED-AII) methods, sufficient conditions for global uniform exponential stability (GUES) of the closed-loop system are established, and the results are less conservative than that based on mode-dependent average dwell time (MDADT) and mode-dependent average impulsive interval (MDAII) methods. In addition, we provide the solvability conditions for the state feedback controller. Finally, several numerical examples are provided to verify the effectiveness of the results in this paper.
{"title":"Stability Analysis of Asynchronous Impulsive Switched T-S Fuzzy Systems Based on the Admissible Edge-dependent Scheme","authors":"Yufang Xie, Mengjie Li, Lijun Gao","doi":"10.1007/s12555-023-0610-5","DOIUrl":"https://doi.org/10.1007/s12555-023-0610-5","url":null,"abstract":"<p>The main purpose of this paper is to study the stability of discrete-time impulsive switched T-S fuzzy systems with two kinds of asynchronous behaviors, including asynchronous behavior between impulse and switching, and asynchronous switching between controllers and subsystems. We divide the subsystems into stable and unstable subsystems, which respectively adopt slow switching and fast switching methods. Then, based on multiple Lyapunov functions, admissible edge-dependent average dwell time (AED-ADT) and admissible edge-dependent average impulsive interval (AED-AII) methods, sufficient conditions for global uniform exponential stability (GUES) of the closed-loop system are established, and the results are less conservative than that based on mode-dependent average dwell time (MDADT) and mode-dependent average impulsive interval (MDAII) methods. In addition, we provide the solvability conditions for the state feedback controller. Finally, several numerical examples are provided to verify the effectiveness of the results in this paper.</p>","PeriodicalId":54965,"journal":{"name":"International Journal of Control Automation and Systems","volume":"26 1","pages":""},"PeriodicalIF":3.2,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141882742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-02DOI: 10.1007/s12555-023-0745-4
Yifan Bai, Björn Lindqvist, Samuel Nordström, Christoforos Kanellakis, George Nikolakopoulos
This paper presents a complete system architecture for multi-robot coordination for unbalanced task assignments, where a number of robots are supposed to visit and accomplish missions at different locations. The proposed method first clusters tasks into clusters according to the number of robots, then the assignment is done in the form of one-cluster-to-one-robot, followed by solving the traveling salesman problem (TSP) to determine the visiting order of tasks within each cluster. A nonlinear model predictive controller (NMPC) is designed for robots to navigate to their assigned tasks while avoiding colliding with other robots. Several simulations are conducted to evaluate the feasibility of the proposed architecture. Video examples of the simulations can be viewed at https://youtu.be/5C7zTnv2sfo and https://youtu.be/-JtSg5V2fTI?si=7PfzZbleOOsRdzRd. Besides, we compare the cluster-based assignment with a simulated annealing (SA) algorithm, one of the typical solutions for the multiple traveling salesman problem (mTSP), and the result reveals that with a similar optimization effect, the cluster-based assignment demonstrates a notable reduction in computation time. This efficiency becomes increasingly pronounced as the task-to-agent ratio grows.
{"title":"Cluster-based Multi-robot Task Assignment, Planning, and Control","authors":"Yifan Bai, Björn Lindqvist, Samuel Nordström, Christoforos Kanellakis, George Nikolakopoulos","doi":"10.1007/s12555-023-0745-4","DOIUrl":"https://doi.org/10.1007/s12555-023-0745-4","url":null,"abstract":"<p>This paper presents a complete system architecture for multi-robot coordination for unbalanced task assignments, where a number of robots are supposed to visit and accomplish missions at different locations. The proposed method first clusters tasks into clusters according to the number of robots, then the assignment is done in the form of one-cluster-to-one-robot, followed by solving the traveling salesman problem (TSP) to determine the visiting order of tasks within each cluster. A nonlinear model predictive controller (NMPC) is designed for robots to navigate to their assigned tasks while avoiding colliding with other robots. Several simulations are conducted to evaluate the feasibility of the proposed architecture. Video examples of the simulations can be viewed at https://youtu.be/5C7zTnv2sfo and https://youtu.be/-JtSg5V2fTI?si=7PfzZbleOOsRdzRd. Besides, we compare the cluster-based assignment with a simulated annealing (SA) algorithm, one of the typical solutions for the multiple traveling salesman problem (mTSP), and the result reveals that with a similar optimization effect, the cluster-based assignment demonstrates a notable reduction in computation time. This efficiency becomes increasingly pronounced as the task-to-agent ratio grows.</p>","PeriodicalId":54965,"journal":{"name":"International Journal of Control Automation and Systems","volume":"45 1","pages":""},"PeriodicalIF":3.2,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141882744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-31DOI: 10.1007/s12555-023-0174-4
Yongfeng Lv, Jun Zhao, Baixue Miao, Huimin Chang, Xuemei Ren
The traditional coal mining machine uses a single-motor system, which will terminate when encountering a hard road header surface because of power limitations. The same problem exists in large radar servo systems and other applications of heavy industrial. To address this issue, this paper develops the multi-motor driving servo system for the coal mining machine, and designs the adaptive optimal torques for the cut-off gear and the multi-motor system. Firstly, the multi-motor driving system for the coal mining machine is modeled. The optimal performance functions of the cut-off gear and the driving motors are presented, and the Nash equilibrium among the optimal torques is defined. Then, based on the given performance functions, the adaptive optimal torques are found by approximate dynamic programming (ADP) technique, which can find the saddle point and optimize the coal mining machine performance. Moreover, the neural network (NN) weight convergence in the ADP structure is investigated. The stability of the multi-motor driven system with the proposed torques is proved. Finally, taking the coal mining machine as an example, the effectiveness of the performance optimization strategies of cut-off gear and multi-driving motors is verified.
{"title":"Optimal Cooperative Controls for Multi-motor Driving System in Long-wall Shearer","authors":"Yongfeng Lv, Jun Zhao, Baixue Miao, Huimin Chang, Xuemei Ren","doi":"10.1007/s12555-023-0174-4","DOIUrl":"https://doi.org/10.1007/s12555-023-0174-4","url":null,"abstract":"<p>The traditional coal mining machine uses a single-motor system, which will terminate when encountering a hard road header surface because of power limitations. The same problem exists in large radar servo systems and other applications of heavy industrial. To address this issue, this paper develops the multi-motor driving servo system for the coal mining machine, and designs the adaptive optimal torques for the cut-off gear and the multi-motor system. Firstly, the multi-motor driving system for the coal mining machine is modeled. The optimal performance functions of the cut-off gear and the driving motors are presented, and the Nash equilibrium among the optimal torques is defined. Then, based on the given performance functions, the adaptive optimal torques are found by approximate dynamic programming (ADP) technique, which can find the saddle point and optimize the coal mining machine performance. Moreover, the neural network (NN) weight convergence in the ADP structure is investigated. The stability of the multi-motor driven system with the proposed torques is proved. Finally, taking the coal mining machine as an example, the effectiveness of the performance optimization strategies of cut-off gear and multi-driving motors is verified.</p>","PeriodicalId":54965,"journal":{"name":"International Journal of Control Automation and Systems","volume":"43 1","pages":""},"PeriodicalIF":3.2,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141865192","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-31DOI: 10.1007/s12555-023-0323-9
Antamil Said, Takami Matsuo
While the Lyapunov exponents used in previous studies require embedded dimensions and/or multiple initial conditions, our previously proposed instantaneous Lyapunov exponent (ILE) and Malthusian parameter estimator (MPE) directly estimate the rate of increase or decrease by time series data in real-time. The MPE uses adaptive control algorithms to estimate the rate of increase or decrease of the system. Our previously proposed MPE tends to have larger errors for fast-varying parameters and requires a PE condition, but the MPE in the case of a stable system does not satisfy the persistency of excitation (PE) condition. In this paper, we apply recently proposed parameter estimation algorithms effective for time-varying parameters to MPE. Moreover, the other MPE using the generalized parameter estimation-based observer (GPEBO) and the energy pumping-and-damping injection construction is proposed, that does not require the PE condition. The proposed methods allow us to monitor the transient stability in real-time. We compare the estimation performance of ILE and four MPE’s by using two power system examples.
以往研究中使用的 Lyapunov 指数需要嵌入维度和/或多个初始条件,而我们之前提出的瞬时 Lyapunov 指数(ILE)和马尔萨斯参数估算器(MPE)可直接通过时间序列数据实时估算增减率。MPE 采用自适应控制算法来估计系统的增减率。我们之前提出的 MPE 对于快速变化的参数往往误差较大,并且需要一个 PE 条件,但在稳定系统的情况下 MPE 并不满足激励持久性(PE)条件。本文将最近提出的对时变参数有效的参数估计算法应用于 MPE。此外,我们还提出了另一种 MPE,它使用基于广义参数估计的观测器(GPEBO)和能量泵送与阻尼注入结构,不需要 PE 条件。所提出的方法允许我们实时监控瞬态稳定性。我们通过两个电力系统实例比较了 ILE 和四种 MPE 的估计性能。
{"title":"Real-time Stability Monitoring of Power Systems Using Instantaneous Lyapunov Exponent and Malthusian Parameter","authors":"Antamil Said, Takami Matsuo","doi":"10.1007/s12555-023-0323-9","DOIUrl":"https://doi.org/10.1007/s12555-023-0323-9","url":null,"abstract":"<p>While the Lyapunov exponents used in previous studies require embedded dimensions and/or multiple initial conditions, our previously proposed instantaneous Lyapunov exponent (ILE) and Malthusian parameter estimator (MPE) directly estimate the rate of increase or decrease by time series data in real-time. The MPE uses adaptive control algorithms to estimate the rate of increase or decrease of the system. Our previously proposed MPE tends to have larger errors for fast-varying parameters and requires a PE condition, but the MPE in the case of a stable system does not satisfy the persistency of excitation (PE) condition. In this paper, we apply recently proposed parameter estimation algorithms effective for time-varying parameters to MPE. Moreover, the other MPE using the generalized parameter estimation-based observer (GPEBO) and the energy pumping-and-damping injection construction is proposed, that does not require the PE condition. The proposed methods allow us to monitor the transient stability in real-time. We compare the estimation performance of ILE and four MPE’s by using two power system examples.</p>","PeriodicalId":54965,"journal":{"name":"International Journal of Control Automation and Systems","volume":"41 1","pages":""},"PeriodicalIF":3.2,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141865190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}