Topological complexity of collision-free multi-tasking motion planning on orientable surfaces
classification
🧮 math.AT
keywords
complexitytopologicalorientablespacessurfacescohen-farbercollision-freecompute
read the original abstract
We compute the higher topological complexity of ordered configuration spaces of orientable surfaces, thus extending Cohen-Farber's description of the ordinary topological complexity of those spaces.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.