zbMATH — the first resource for mathematics

Scheduling trajectories on a planar surface with moving obstacles. (English) Zbl 1099.68748
Summary: An algorithm for scheduling the trajectory of a point object, which moves on a plane surface comprising of moving obstacles, is introduced. Different quantitative criteria may be met by schedule, e.g., the course connecting two individual locations being the shortes in length, the least extensive, the fastest as regard to its duration, etc. A prototype system that implements the algorithm is presented. Several examples scenarios are also discussed.
68T35 Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence
68U05 Computer graphics; computational geometry (digital and algorithmic aspects)
68R10 Graph theory (including graph drawing) in computer science
90C35 Programming involving graphs or networks
Full Text: EuDML