Search for: [Description = "Path searching is challenging problem in many domains such as simulation war games, robotics, military mission planning, computer generated forces \(CGF\), etc. Effectiveness problems in military route planning are related both with terrain modelling and path planning algorithms. These problems may be considered from the point of view of many criterions. It seems that two criterions are the most important\: quality of terrain reflection in the terrain model and computational complexity of the on\(off\)\-line path planning algorithm. The paper deals with two above indicated problems of route planning effectiveness. Comparison of approaches used in route planning is presented. The hybrid, terrain merging\-based and partial path planning, approach for route planning in dynamically changed environment during simulation is described. It significantly increase effectiveness of route planning process. The computational complexity of the method is given and some discussion for using the method in the battlefield simulation is conducted. In order to estimate how many times faster we can compute problem for finding shortest path in network with n big squares \(b\-nodes\) with relation to problem for finding shortest path in the network with V small squares \(s\-nodes\) acceleration function is defined and optimized."]
