Topological complexity of collision free motion planning algorithms in the presence of multiple moving obstacles
Optimization and Control
2007-05-23 v1 Algebraic Topology
Abstract
We study motion planning algorithms for collision free control of multiple objects in the presence of moving obstacles. We compute the topological complexity of algorithms solving this problem. We apply topological tools and use information about cohomology algebras of configuration spaces. The results of the paper may potentially be used in systems of automatic traffic control.
Keywords
Cite
@article{arxiv.math/0609476,
title = {Topological complexity of collision free motion planning algorithms in the presence of multiple moving obstacles},
author = {Michael Farber and Mark Grant and Sergey Yuzvinsky},
journal= {arXiv preprint arXiv:math/0609476},
year = {2007}
}