Abstract: Sequential Monte Carlo (SMC) methods are a general class of techniques to sample approximately from any sequence of probability distributions. These distributions are approximated by a cloud of weighted samples which are propagated over time using a combination of importance sampling and resampling steps. This article is concerned with the convergence analysis of a class of SMC methods where the times at which resampling occurs are computed on-line using criteria such as the effective sample size. This is a popular approach amongst practitioners but there are very few convergence results available for these methods. It is shown here that these SMC algorithms correspond to a particle approximation of a Feynman-Kac flow of measures on adaptive excursion spaces. By combining a non-linear distribution flow analysis to an original coupling technique, we obtain functional central limit theorems and uniform exponential concentration estimates for these algorithms. The original exponential concentration theorems presented in this study significantly improve previous concentration estimates obtained for SMC algorithms.