Motion planning algorithms for Configuration Spaces

Abstract

We provide explicit motion planners for Euiclidean configuration spaces. This allows us to recover some known values of the topological complexity and the Lusternik-Schinirelman category of these spaces.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…