Article

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

Authors:

Juan TorrecillasAuthors Info & Claims

GECCO '07: Proceedings of the 9th annual conference companion on Genetic and evolutionary computation

Pages 2859 - 2864

https://doi.org/10.1145/1274000.1274032

Published: 07 July 2007 Publication History

Get Access

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.

References

[1]

B. Barán and M. Schaerer. A multiobjective ant colony system for vehicle routing problem with time windows. In IASTED International Multi-Conference on Applied Informatics, number-21 in IASTED IMCAI, pages 97--102, 2003.

Google Scholar

[2]

C. A. C. Coello, D. A. V. Veldhuizen, and G. B. Lamont. Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic Publishers, 2002.

Digital Library

Google Scholar

[3]

M. Dorigo and G. D. Caro. The ant colony optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 11--32. McGraw-Hill, 1999.

Digital Library

Google Scholar

[4]

M. Dorigo and T. Stützle. The ant colony optimization metaheuristic: Algorithms, applications, and advances. In G. K. F. Glover, editor, Handbook of Metaheuristics, pages 251--285. Kluwer, 2002.

Google Scholar

[5]

C. García-Mart7#237;nez, O. Cordón, and F. Herrera. An empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP. In ANTS 2004. Fourth International Workshop on. Ant Colony Optimization and Swarm Intelligence, number 3172 in LNCS, pages 61--72. Springer, 2004.

Google Scholar

[6]

S. Iredi, D. Merkle, and M. Middendorf. Bi-criterion optimization with multi colony ant algorithms. In E. Zitzler, K. Deb, L. Thiele, C. A. C. Coello, and D. Corne, editors, Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization (EMO 2001), volume 1993 of Lecture Notes in Computer Science, pages 359--372, Berlin, 2001. Springer-Verlag.

Digital Library

Google Scholar

[7]

A. Mora, J. Merelo, C. Millán, J. Torrecillas, and J. Laredo. Chac. a moaco algorithm for computation of bi-criteria military unit path in the battlefield. In N.K. David A. Pelta, editor, Proceedings of the Workshop on Nature Inspired Cooperative Strategies for Optimization. NICSO'2006, pages 85--98, Junio 2006.

Google Scholar

[8]

A. M. Mora, J. J. Merelo, C. Millán, J. Torrecillas, J. L. J. Laredo, and P. A. Castillo. Enhancing a MOACO for solving the bi-criteria pathfinding problem for a military unit in a realistic battlefield. In M. Giacobini, editor, EvoWorkshops 2007. Applications of Evolutionary Computing, number 4448 in LNCS, pages 712--721. Springer, 2007.

Digital Library

Google Scholar

Cited By

View all

Ahn JJung SKim HHwang HJun H(2023)A study on unmanned combat vehicle path planning for collision avoidance with enemy forces in dynamic situationsJournal of Computational Design and Engineering10.1093/jcde/qwad09910:6(2251-2270)Online publication date: 9-Nov-2023
https://doi.org/10.1093/jcde/qwad099
Leenen LTerlunen A(2013)A focussed dynamic path finding algorithm with constraints2013 International Conference on Adaptive Science and Technology10.1109/ICASTech.2013.6707501(1-8)Online publication date: Nov-2013
https://doi.org/10.1109/ICASTech.2013.6707501
Leenen LTerlunen Ale Roux HRaol JGopal A(2012)A Constraint Programming Solution for the Military Unit Path Finding ProblemMobile Intelligent Autonomous Systems10.1201/b12690-17(225-240)Online publication date: 3-Aug-2012
https://doi.org/10.1201/b12690-17
Show More Cited By

Index Terms

Balancing safety and speed in the military path finding problem: analysis of different ACO algorithms
1. Computing methodologies
  1. Modeling and simulation
    1. Model development and analysis
      1. Modeling methodologies
2. Information systems
  1. Information systems applications

Recommendations

hCHAC: A family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem

This paper presents a family of Multi-Objective Ant Colony Optimization (MOACO) algorithms, globally identified as hCHAC, which have been designed to solve a pathfinding problem in a military context considering two objectives: maximization of speed and ...
An ant colony optimization algorithm for the bi-objective shortest path problem

Multi-objective shortest path problem (MOSP) is an extension of a traditional single objective shortest path problem that seeks for the efficient paths satisfying several conflicting objectives between two nodes of a network. MOSP is one of the most ...
A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems

This work focuses on the generation of the Pareto front for practical applications such as analog circuit sizing. The Pareto front is the solution to a multiobjective optimization problem. It shows all possible optimal compromises between conflicting ...

Comments

Information & Contributors

Information

Published In

GECCO '07: Proceedings of the 9th annual conference companion on Genetic and evolutionary computation

July 2007

1450 pages

ISBN:9781595936981

DOI:10.1145/1274000

Program Chairs:
Peter A. N. Bosman
Centre for Mathematics & Computer Science, The Netherlands
,
Tina Yu
Memorial University of Newfoundland, Canada
,
Anikó Ekárt
Aston University, UK

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 July 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

GECCO07

Sponsor:

GECCO07: Genetic and Evolutionary Computation Conference

July 7 - 11, 2007

London, United Kingdom

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
285
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ahn JJung SKim HHwang HJun H(2023)A study on unmanned combat vehicle path planning for collision avoidance with enemy forces in dynamic situationsJournal of Computational Design and Engineering10.1093/jcde/qwad09910:6(2251-2270)Online publication date: 9-Nov-2023
https://doi.org/10.1093/jcde/qwad099
Leenen LTerlunen A(2013)A focussed dynamic path finding algorithm with constraints2013 International Conference on Adaptive Science and Technology10.1109/ICASTech.2013.6707501(1-8)Online publication date: Nov-2013
https://doi.org/10.1109/ICASTech.2013.6707501
Leenen LTerlunen Ale Roux HRaol JGopal A(2012)A Constraint Programming Solution for the Military Unit Path Finding ProblemMobile Intelligent Autonomous Systems10.1201/b12690-17(225-240)Online publication date: 3-Aug-2012
https://doi.org/10.1201/b12690-17
Leenen LVorster Jle Roux HMcGraw RImsand EChinni M(2010)A constraint-based solver for the military unit path finding problemProceedings of the 2010 Spring Simulation Multiconference10.1145/1878537.1878564(1-8)Online publication date: 11-Apr-2010
https://dl.acm.org/doi/10.1145/1878537.1878564
Jakimovski BMeyer BMaehle E(2008)Swarm intelligence for self-reconfiguring walking robot2008 IEEE Swarm Intelligence Symposium10.1109/SIS.2008.4668286(1-8)Online publication date: Sep-2008
https://doi.org/10.1109/SIS.2008.4668286

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

hCHAC: A family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem

An ant colony optimization algorithm for the bi-objective shortest path problem

A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations