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

Authors:
Zbigniew Tarapata;Stefan Wroclawski
Affiliations:
Military University of Technology, Cybernetics Faculty, Warsaw, Poland;Military University of Technology, Cybernetics Faculty, Warsaw, Poland
Venue:
MIG'10 Proceedings of the Third international conference on Motion in games
Year:
2010

Citing 9
Cited 0

The complexity of finding two disjoint paths with min-max objective function

Discrete Applied Mathematics
Disjoint paths in a planar graph—a general theorem

SIAM Journal on Discrete Mathematics
Finding the k Shortest Paths

SIAM Journal on Computing
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph

Journal of the ACM (JACM)
Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout

SIAM Journal on Computing
Finding Disjoint Routes in Telecommunications Networks with Two Technologies

Operations Research
Approximation scheduling algorithms for solving multi-objects movement synchronization problem

ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms
Movement simulation and management of cooperating objects in CGF systems: a case study

KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part I
Multiresolution models and algorithms of movement planning and their application for multiresolution battlefield simulation

ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the article an algorithm (SGDP) for solving node-disjoint shortest K paths problem in mesh graphs is presented. The mesh graph can represent e.g. a discrete terrain model in a battlefield simulation. Arcs in the graph geographically link adjacent nodes only. The algorithm is based on an iterative subgraph generating procedure inside the mesh graph (for finding a single path from among K paths single subgraph is generated iteratively) and the usage of different strategies to find (and improve) the solution. Some experimental results with a discussion of the complexity and accuracy of the algorithm are shown in detail.