Abstract
The selection of path in an urban combat setting determines the survival to a greater extent. In this paper we propose an algorithm that finds strategic paths inside a map with a set of enemies without using predetermined waypoints. The strategic path calculation is based upon the hit probability calculated for each enemy's weapons and the risk vs. time preference and it is done at multiple levels of abstractions to address trade-off of efficiency and accuracy and the strategic path calculation minimizes both time and risk as per mission objectives. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Singh, A. C., & Holder, L. (2008). Strategic path planning on the basis of risk vs. time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5309 LNCS, pp. 77–87). Springer Verlag. https://doi.org/10.1007/978-3-540-89222-9_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.