Scheduling Trajectories on a Planar Surface with Moving Obstacles

Authors:
Emmanuel Stefanakis
Affiliations:
Spade Team, Institut Autonome Intelligente Systeme, Fraunhofer-Gesellschaft, Sankt Augustin, Germany, e-mail: stefanak@dbnet.ece.ntua.gr
Venue:
Informatica
Year:
2006

Citing 8
Cited 1

Artificial intelligence

Artificial intelligence
Algorithms

Algorithms
The weighted region problem: finding shortest paths through a weighted planar subdivision

Journal of the ACM (JACM)
An interface for exploring spatial alternatives for a corridor location problem

Computers & Geosciences - Special issue on geographical computing
Artificial intelligence: a modern approach

Artificial intelligence: a modern approach
Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
GIS: A Computing Perspective, 2nd Edition

GIS: A Computing Perspective, 2nd Edition
3-D Computer Modeling with Intra-Component, Geometric, Quality and Topological Constraints

Informatica

E-Learning Documentation of Historical Living Systems with 3-D Modeling Functionality

Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm for scheduling the trajectory of a point object, which moves on a plane surface comprising a set of moving obstacles, is introduced. Different quantitative criteria may be met by the schedule, e.g., the course connecting two individual locations being the shortest in length, the least expensive, the fastest as regard to its duration, etc. A prototype system that implements the algorithm is presented. Several example scenarios are also discussed.