Motion, computation and determinism. Motion planning : deterministic approaches

The lecture introduces the issue of decidability in motion planning and shows the limits of the algorithmic notion of completeness. The seminar by J.C. Latombe introduces the notion of probabilistic completeness, develops the associated algorithms and illustrates their performance.