Multiresolution models and algorithms of movement planning and their application for multiresolution battlefield simulation

Authors:
Zbigniew Tarapata
Affiliations:
Military University of Technology, Cybernetics Faculty, Warsaw, Poland
Venue:
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Year:
2010

Citing 6
Cited 1

Data structures and network algorithms

Data structures and network algorithms
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Faster scaling algorithms for network problems

SIAM Journal on Computing
Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
Approximating Shortest Paths in Large-Scale Networks with An Application to Intelligent Transportation Systems

INFORMS Journal on Computing
Planning Algorithms

Planning Algorithms

Subgraphs generating algorithm for obtaining set of node-disjoint paths in terrain-based mesh graphs

MIG'10 Proceedings of the Third international conference on Motion in games

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper a branch-and-bound algorithm for solving shortest paths problem in a large-scale terrain-based grid network, especially designed for multiresolution movement planning and simulation is discussed. The new approach deals with a specific method for merging the geographically adjacent nodes (squares) and the planning path to a "merged" graph. The merging is done by using geographically adjacent squares of primary graph (thus, we obtain nodes of a "merged" graph) and calculating costs in the "merged" graph as longest (or shortest) of the shortest paths between some subsets of nodes belonging to "merged" nodes. The properties of the algorithm are discussed and proved. Moreover, some remarks on how to parallelize and apply the presented algorithm for finding multiresolution shortest paths are proposed.