The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints.
Arnaud CasteigtsAnne-Sophie HimmelHendrik MolterPhilipp ZschochePublished in: CoRR (2019)
Keyphrases
- computational complexity
- temporal dimension
- temporal information
- np hard
- database
- np complete
- linear constraints
- special case
- temporal reasoning
- geometric constraints
- temporal consistency
- path finding
- constrained optimization
- temporal data
- temporal intervals
- temporal planning
- storage requirements
- temporal constraints
- motion vectors
- shortest path
- computationally efficient
- website
- information systems