The Efficiency of an Optimized PID Controller Based on Ant Colony Algorithm (ACO-PID) for the Position Control of a Multi-articulated System

23Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

In this article, a robot manipulator is controlled by the PID controller in a closed loop system with unit feedback. The difficulty of using the controller is parameter tuning, because the tuning parameters still use the trial and error method to find the PID parameter constants, namely Proportional Gain (Kp), Integral Gain (Ki) and Derivative Gain (Kd). In this case the Ant colony Optimization algorithm (ACO) is used to find the best gain parameters of the PID. The Ant algorithm is a method of combinatorial optimization, which utilizes the pattern of ants search for the shortest path from the nest to the place where the food is located, this concept is applied to tuning PID parameters by minimizing the objective function such that the robot manipulator has improved performance characteristics. This work uses the Matlab Simulink environment, First, after obtaining the system model, the ant colony algorithm is used to determine the proper coefficients Kp, Ki, and Kd in order to minimize the trajectory errors of the two joints of the robot manipulator. Then, the parameters will implement in the robot system. According to the results of the computer simulations, the proposed method (ACO-PID) gives a system that has a good performance compared with the classical PID.

Cite

CITATION STYLE

APA

Baghli, F. Z., Lakhal, Y., & El Kadi, Y. A. (2023). The Efficiency of an Optimized PID Controller Based on Ant Colony Algorithm (ACO-PID) for the Position Control of a Multi-articulated System. Journal of Robotics and Control (JRC), 4(3), 289–298. https://doi.org/10.18196/jrc.v4i3.17709

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free