Disjoint paths in a planar graph—a general theorem
SIAM Journal on Discrete Mathematics
SIAM Journal on Computing
Scheduling Computer and Manufacturing Processes
Scheduling Computer and Manufacturing Processes
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
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
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
| Hi-index | 0.00 |
The paper presents some models and algorithms for the nonlinear optimization problem of multi-objects movement scheduling to synchronize their movement as well as properties of presented algorithms. Similarities and differences between defined problems and the classical tasks scheduling problem on parallel processors are shown. Two algorithms for synchronous movement scheduling are proposed and their properties are considered. One of the algorithm is based on dynamic programming approach and the second one uses some approximation techniques. Theoretical and experimental analysis of complexity and effectiveness of the algorithms as well as their practical usefulness are discussed.