Novel ant colony optimization approach to optimal control

Abstract

Purpose

The purpose of this paper is to propose a novel ant colony optimization (ACO) approach to optimal control. The standard ACO algorithms have proven to be very powerful optimization metaheuristic for combinatorial optimization problems. They have been demonstrated to work well when applied to various nondeterministic polynomial‐complete problems, such as the travelling salesman problem. In this paper, ACO is reformulated as a model‐free learning algorithm and its properties are discussed.

Design/methodology/approach

First, it is described how quantizing the state space of a dynamic system introduces stochasticity in the state transitions and transforms the optimal control problem into a stochastic combinatorial optimization problem, motivating the ACO approach. The algorithm is presented and is applied to the time‐optimal swing‐up and stabilization of an underactuated pendulum. In particular, the effect of different numbers of ants on the performance of the algorithm is studied.

Findings

The simulations show that the algorithm finds good control policies reasonably fast. An increasing number of ants results in increasingly better policies. The simulations also show that although the policy converges, the ants keep on exploring the state space thereby capable of adapting to variations in the system dynamics.

Research limitations/implications

This paper introduces a novel ACO approach to optimal control and as such marks the starting point for more research of its properties. In particular, quantization issues must be studied in relation to the performance of the algorithm.

Originality/value

The paper presented is original as it presents the first application of ACO to optimal control problems.

Citation

Marinus van Ast, J., Babuška, R. and De Schutter, B. (2009), "Novel ant colony optimization approach to optimal control", International Journal of Intelligent Computing and Cybernetics, Vol. 2 No. 3, pp. 414-434. https://doi.org/10.1108/17563780910982671