Detecting Regular Visit Patterns

We are given a trajectory T\mathcal{T} and an area A\mathcal{A} . T\mathcal{T} might intersect A\mathcal{A} several times, and our aim is to detect whether T\mathcal{T} visits A\mathcal{A} with some regularity, e.g. what is the longest time span that a GPS-GSM equipped elephant visited a specific lake on a daily (weekly or yearly) basis, where the elephant has to visit the lake most of the days (weeks or years), but not necessarily on every day (week or year).