TSP with multiple visits Can you please suggest possible approaches for the following problem: 

Find a path through graph vertices so that the distance (sum of edges weights) between two vertex $i$ occurrences would be no more than $D_i$. It is obviously infinite, so I want to have a generator for this path. 

Thanks in advance.
This problem is PSPACE-complete even in the case in which the edge weights obey the triangle inequality. See


Hsi-Ming Ho, Joel Ouaknine, The Cyclic-Routing UAV Problem is PSPACE-Complete, FoSSaCS 2015