Comparing ACO algorithms for solving the bi-criteria military path-finding problem

  • Authors:

  • Antonio M. Mora;Juan J. Merelo;Cristian Millán;Juan Torrecillas;Juan L. J. Laredo;Pedro A. Castillo

  • Affiliations:

  • Departamento de Arquitectura y Tecnología de Computadores, University of Granada, Spain;Departamento de Arquitectura y Tecnología de Computadores, University of Granada, Spain;Mando de Adiestramiento y Doctrina, Spanish Army;Mando de Adiestramiento y Doctrina, Spanish Army;Departamento de Arquitectura y Tecnología de Computadores, University of Granada, Spain;Departamento de Arquitectura y Tecnología de Computadores, University of Granada, Spain

  • Venue:
  • ECAL'07 Proceedings of the 9th European conference on Advances in artificial life
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper describes and compares mono- and multi-objective Ant Colony System approaches designed to solve the problem of finding the path that minimizes resources while maximizing safety for a military unit in realistic battlefields. Several versions of the previously presented CHAC algorithm, with two different state transition rules are tested. Two of them are extreme cases, which only consider one of the objectives; these are taken as baseline. These algorithms, along with the Multi-Objective Ant Colony Optimization algorithm, have been tested in maps with different difficulty. hCHAC, an approach proposed by the authors, has yielded the best results.