Computer Science – Multiagent Systems
Scientific paper
2006-10-19
Published in Proceedings of the Workshop on Nature Inspired Cooperative Strategies for Optimization. NICSO'2006, Pelta & Krasn
Computer Science
Multiagent Systems
Scientific paper
In this paper we propose a Multi-Objective Ant Colony Optimization (MOACO) algorithm called CHAC, which has been designed to solve the problem of finding the path on a map (corresponding to a simulated battlefield) that minimizes resources while maximizing safety. CHAC has been tested with two different state transition rules: an aggregative function that combines the heuristic and pheromone information of both objectives and a second one that is based on the dominance concept of multiobjective optimization problems. These rules have been evaluated in several different situations (maps with different degree of difficulty), and we have found that they yield better results than a greedy algorithm (taken as baseline) in addition to a military behaviour that is also better in the tactical sense. The aggregative function, in general, yields better results than the one based on dominance.
Laredo J. L. J.
Merelo Juan J.
Millan C.
Mora Antonio M.
Torrecillas J.
No associations
LandOfFree
CHAC. A MOACO Algorithm for Computation of Bi-Criteria Military Unit Path in the Battlefield does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with CHAC. A MOACO Algorithm for Computation of Bi-Criteria Military Unit Path in the Battlefield, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and CHAC. A MOACO Algorithm for Computation of Bi-Criteria Military Unit Path in the Battlefield will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-12608