Temporal resolving sets in graphs are generalized to include temporal aspects, with complexity analysis revealing NP-completeness.
