Abstract
We consider a path planning problem wherein an agent needs to safely and swiftly navigate from a given source location to a destination through an arrangement of disk-shaped obstacles. The agent possesses a limited neutralization capability in the sense that it can neutralize a certain number of obstacles enroute and pass through them safely upon neutralization. Optimal utilization of such a capability is called the neutralization problem. This problem is essentially a shortest path problem with resource constraints, which has been shown to be NP-Hard except for some trivial variants. In this study, we propose an ant system algorithm for the neutralization problem. In the proposed algorithm, the state transition rule makes use of certain problem-specific information to guide the ants. We show how the parameters of the algorithm can be fine-tuned for enhanced performance and we present limited computational experiments including a real-world naval minefield dataset. Our experiments suggest that the proposed algorithm finds high quality solutions in general with reasonable computational resources.
This work is supported by Marmara University Scientific Research Committee under the project ID FEN-D-100413-0135.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alkaya, A.F., Aksakalli, V., Periebe, C.E.: Heuristics for Optimal Neutralization in a Mapped Hazard Field (submitted for publication)
Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press Cambridge (2004)
Dorigo, M., Gambardella, L.M.: Ant Colony system: A Cooperative learning approach to the Travelling Salesman Problem. IEEE Transaction on Evolutionary Computation 1(1) (1997)
Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Trans. Syst., Man, Cybern. B 26(2), 29–41 (1996)
Stutzle, T., Hoos, H.: Improvements on the ant system, introducing the MAX-MIN ant system. In: Proc. ICANNGA97–Third Int. Conf. Artificial Neural Networks and Genetic Algorithms. Springer, Wien (1997)
Lawler, E.L., Lenstra, J.K., Rinnooy-Kan, A.H.G., Shmoys, D.B.: The Travelling Salesman Problem. Wiley, New York (1985)
Kuipers, F., Korkmaz, T., Krunz, M., Van Mieghem, P.: Performance evaluation of constraintbased path selection algorithms. IEEE Network 18, 16–23 (2004)
Dahl, G., Realfsen, B.: Curve approximation and constrained shortest path problems. In: International Symposium on Mathematical Programming, ISMP 1997 (1997)
Zabarankin, M., Uryasev, S., Pardalos, P.: Optimal Risk Path Algorithms. In: Murphey, R., Pardalos, P. (eds.) Cooperative Control and Optimization, vol. 66, pp. 271–303. Kluwer Academic, Dordrecht (2002)
Fishkind, D.E., Priebe, C.E., Giles, K., Smith, L.N., Aksakalli, V.: Disambiguation protocols based on risk simulation. IEEE Trans Syst. Man Cybernet Part A 37, 814–823 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Algin, R., Alkaya, A.F., Aksakalli, V., Öz, D. (2013). An Ant System Algorithm for the Neutralization Problem. In: Rojas, I., Joya, G., Cabestany, J. (eds) Advances in Computational Intelligence. IWANN 2013. Lecture Notes in Computer Science, vol 7903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38682-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-38682-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38681-7
Online ISBN: 978-3-642-38682-4
eBook Packages: Computer ScienceComputer Science (R0)