Balancing safety and speed in the military path finding problem: analysis of different ACO algorithms

Authors:
Antonio Miguel Mora;Juan Julián Merelo;Juan Luís Jiménez;Pedro A. Castillo;Cristian Millán;Juan Torrecillas
Affiliations:
Universidad de Granada, Granada, Spain;Universidad de Granada, Granada, Spain;Universidad de Granada, Granada, Spain;Universidad de Granada, Granada, Spain;Ejército de Tierra de España, Granada, Spain;Ejército de Tierra de España, Granada, Spain
Venue:
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Year:
2007

Citing 3
Cited 1

The ant colony optimization meta-heuristic

New ideas in optimization
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)

Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Enhancing a MOACO for Solving the Bi-criteria Pathfinding Problem for a Military Unit in a Realistic Battlefield

Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing

A constraint-based solver for the military unit path finding problem

SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference

Quantified Score

Hi-index	0.00

Visualization

Abstract

hCHAC, a MOACO implemented to solve the problem of finding the path that minimizes resources, while maximizing safety for a military unit in realistic battlefields, is compared with some other approaches: two extreme methods, which only considers one objective in the search, and a mono-objective algorithm, which combines the two objectives terms of the formulae in a single. In addition, two state transition rules (combined and dominance-based) have been used in some of the approaches.All of them have been tested in different difficulty maps and hCHAC using the combined state transition rule has been considered the best approach.