Synthesis of Compromise-Optimal Trajectories of Mobile Objects in Conflict Environment

摘要

A problem of synthesis of a compromise-optimal trajectory of a mobile object in conflict environment is studied. Solution of the problem by the method of multicriteria dynamic programming is described. A modified method of multicriteria dynamic programming is suggested. Here, search of the optimal point at each level is performed by the method of dual programming (non-local approach). Possible approaches to solution of the problem of structure optimization of active conflict environment are analyzed.