Study on Risk-time-dependent Path Programming

Correctly shaping the maneuver scheme is very important to combat unit surviving and promoting battle effectiveness. Influences on maneuver from roads or some areas are ubiquitous in the troop march. The most serious influence is derived from enemy´s menace, which is time dependent. So, we can see the problem of maneuver scheme programming belongs to the domain of research of risk time-dependent shortest path. For risk time dependent network, the study of the shortest path and its efficiency has wide-ranging and realistic meaning. In order to solve this problem, we put forward the model of maneuver path programming, and then give calculating methods on parameters of the net and steps of solving the model. The example shows that it can obtain the practical conclusion from the model.