Double Q-PID algorithm for mobile robot control

Ignacio Carlucho, Mariano De Paula, Gerardo G. Acosta

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

Many expert systems have been developed for self-adaptive PID controllers of mobile robots. However, the high computational requirements of the expert systems layers, developed for the tuning of the PID controllers, still require previous expert knowledge and high efficiency in algorithmic and software execution for real-time applications. To address these problems, in this paper we propose an expert agent-based system, based on a reinforcement learning agent, for self-adapting multiple low-level PID controllers in mobile robots. For the formulation of the artificial expert agent, we develop an incremental model-free algorithm version of the double Q-Learning algorithm for fast on-line adaptation of multiple low-level PID controllers. Fast learning and high on-line adaptability of the artificial expert agent is achieved by means of a proposed incremental active-learning exploration-exploitation procedure, for a non-uniform state space exploration, along with an experience replay mechanism for multiple value functions updates in the double Q-learning algorithm. A comprehensive comparative simulation study and experiments in a real mobile robot demonstrate the high performance of the proposed algorithm for a real-time simultaneous tuning of multiple adaptive low-level PID controllers of mobile robots in real world conditions.
Original languageEnglish
Pages (from-to)292-307
Number of pages16
JournalExpert Systems with Applications
Volume137
Early online date27 Jun 2019
DOIs
Publication statusPublished - 15 Dec 2019

Keywords / Materials (for Non-textual outputs)

  • Reinforcement learning
  • Double -learning
  • Incremental learning
  • Double Q-PID
  • Mobile robots
  • Multi-platforms

Fingerprint

Dive into the research topics of 'Double Q-PID algorithm for mobile robot control'. Together they form a unique fingerprint.

Cite this