CHAC. A MOACO Algorithm for Computation of Bi-Criteria Military Unit Path in the Battlefield

Computer Science – Multiagent Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-12608

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.