Mobile robots need to represent obstacles in their surroundings, even moving ones, to make right movement decisions. For higher autonomy the robot should automatically build such representation from its sensory input. This paper compares the dynamic character of several gridmap building techniques: probabilistic, fuzzy, theory of evidence and histogramic. Two criteria are defined to rank such dynamism in the representation: time to show a new obstacle and time to show a new hole. The update rules...

searching for all occurrences of a pattern (string or sequence) in some text, where the pattern can occur with some limited number of errors given by edit distance. Several methods were designed for the approximate string matching that simulate nondeterministic finite automata (NFA) constructed for this problem. This paper presents reduced NFAs for the approximate string matching usable in case, when we are interested only in occurrences having edit distance less than or equal to a given integer,...

Soit U une fonction définie sur un ensemble fini E muni d'un noyau markovien irréductible M. L'objectif du papier est de comparer théoriquement deux procédures stochastiques de minimisation globale de U : le recuit simulé et un algorithme génétique. Pour ceci on se placera dans la situation idéalisée d'une infinité de particules disponibles et nous ferons une hypothèse commode d'existence de suffisamment de symétries du cadre (E,M,U). On verra notamment que contrairement au recuit simulé, toute...