2000 character limit reached
The higher topological complexity of subcomplexes of products of spheres---and related polyhedral product spaces
Published 29 Jan 2015 in math.AT | (1501.07474v2)
Abstract: We construct "higher" motion planners for automated systems whose space of states are homotopy equivalent to a polyhedral product space $Z(K,{(S{k_i},\star)})$, e.g. robot arms with restrictions on the possible combinations of simultaneously moving nodes. Our construction is shown to be optimal by explicit cohomology calculations. The higher topological complexity of other families of polyhedral product spaces is also determined.
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.