Topological Complexity of Configuration Spaces

Michael Farber, Mark Grant

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

The topological complexity TC(X) is a homotopy invariant which reflects the complexity of the problem of constructing a motion planning algorithm in the space X, viewed as configuration space of a mechanical system. In this paper we complete the computation of tire topological complexity of the configuration space of n distinct points in Euclidean m-space for all m >= 2 and n >= 2; the answer was previously known in the cases m = 2 and m odd. We also give several useful general results concerning sharpness of upper bounds for the topological complexity.

Original languageEnglish
Pages (from-to)1841-1847
Number of pages8
JournalProceedings of the American Mathematical Society
Volume137
Issue number5
Early online date29 Dec 2008
DOIs
Publication statusPublished - May 2009

Keywords

  • topological complexity
  • configuration spaces
  • robot motion

Cite this

Topological Complexity of Configuration Spaces. / Farber, Michael; Grant, Mark.

In: Proceedings of the American Mathematical Society, Vol. 137, No. 5, 05.2009, p. 1841-1847.

Research output: Contribution to journalArticle

@article{3f647ea962a842188f33d0e36bc4f532,
title = "Topological Complexity of Configuration Spaces",
abstract = "The topological complexity TC(X) is a homotopy invariant which reflects the complexity of the problem of constructing a motion planning algorithm in the space X, viewed as configuration space of a mechanical system. In this paper we complete the computation of tire topological complexity of the configuration space of n distinct points in Euclidean m-space for all m >= 2 and n >= 2; the answer was previously known in the cases m = 2 and m odd. We also give several useful general results concerning sharpness of upper bounds for the topological complexity.",
keywords = "topological complexity, configuration spaces, robot motion",
author = "Michael Farber and Mark Grant",
note = "This research was supported by grants from the EPSRC and from The Royal Society",
year = "2009",
month = "5",
doi = "10.1090/S0002-9939-08-09808-0",
language = "English",
volume = "137",
pages = "1841--1847",
journal = "Proceedings of the American Mathematical Society",
issn = "0002-9939",
publisher = "American Mathematical Society",
number = "5",

}

TY - JOUR

T1 - Topological Complexity of Configuration Spaces

AU - Farber, Michael

AU - Grant, Mark

N1 - This research was supported by grants from the EPSRC and from The Royal Society

PY - 2009/5

Y1 - 2009/5

N2 - The topological complexity TC(X) is a homotopy invariant which reflects the complexity of the problem of constructing a motion planning algorithm in the space X, viewed as configuration space of a mechanical system. In this paper we complete the computation of tire topological complexity of the configuration space of n distinct points in Euclidean m-space for all m >= 2 and n >= 2; the answer was previously known in the cases m = 2 and m odd. We also give several useful general results concerning sharpness of upper bounds for the topological complexity.

AB - The topological complexity TC(X) is a homotopy invariant which reflects the complexity of the problem of constructing a motion planning algorithm in the space X, viewed as configuration space of a mechanical system. In this paper we complete the computation of tire topological complexity of the configuration space of n distinct points in Euclidean m-space for all m >= 2 and n >= 2; the answer was previously known in the cases m = 2 and m odd. We also give several useful general results concerning sharpness of upper bounds for the topological complexity.

KW - topological complexity

KW - configuration spaces

KW - robot motion

U2 - 10.1090/S0002-9939-08-09808-0

DO - 10.1090/S0002-9939-08-09808-0

M3 - Article

VL - 137

SP - 1841

EP - 1847

JO - Proceedings of the American Mathematical Society

JF - Proceedings of the American Mathematical Society

SN - 0002-9939

IS - 5

ER -