2000 character limit reached
Motion planning algorithms for Configuration Spaces
Published 25 Apr 2014 in math.AT | (1404.6310v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.