Performance optimisation of discrete time linear active disturbance rejection control approach
by Congzhi Huang; Bin Du; Chaomin Luo
International Journal of Automation and Control (IJAAC), Vol. 14, No. 5/6, 2020

Abstract: In the framework of the linear active disturbance rejection control (LADRC) approach, all the uncertainties, including the perturbed internal model parameters and time-varying external disturbances, can be estimated by constructing an extended state observer, and then cancelled in real time. However, the parameter tuning of the approach is an extremely challenging mission. In this paper, the model parameters of the controlled servo motor control system are identified by employing the algebraic parameter identification approach. Afterward, the bacteria foraging optimisation (BFO) algorithm, and the particle swarm optimisation (PSO) algorithm are both proposed to optimise the performance of the system driven by the LADRC approach in light of the identified model of the servo motor. The BFO and PSO algorithms and LADRC approach have been extensively applied in optimised control and networked systems. Extensive simulation results and experimental tests are given to demonstrate that the proposed approaches are effective and efficient for the performance optimisation of the LADRC approach.

Online publication date: Mon, 05-Oct-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Automation and Control (IJAAC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com