Résumé : We present a new interacting Markov chain Monte Carlo methodology for solving numerically discrete-time measure-valued equations. The associated stochastic processes belong to the class of self-interacting Markov chains. In contrast to traditional Markov chains, their time evolution may depend on the occupation measure of the past values. This general methodology allows us to provide a natural way to sample from a sequence of target probability measures of increasing complexity. We develop an original theoretical analysis to analyze the behaviour of these algorithms as the time parameter tends to infinity. This analysis relies on measure-valued processes and semigroup techniques. We present a variety of convergence results including exponential estimates and a uniform convergence theorem with respect to the number of target distributions, yielding what seems to be the first results of this kind for this class of self-interacting models. We also illustrate these models in the context of Feynman-Kac distribution flows.