Topological complexity of collision free motion planning algorithms in the presence of multiple moving obstacles

Simple item page
dc.creatorFarber, Michael
dc.creatorGrant, Mark
dc.creatorYuzvinsky, Sergey
dc.date2006-09-17
dc.date.accessioned2026-07-07T07:24:54Z
dc.date.available2026-07-07T07:24:54Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/0609476
dc.identifierhttp://arxiv.org/abs/math/0609476
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116547
dc.subjectOptimization and Control
dc.subjectAlgebraic Topology
dc.subject55R80; 93C83
dc.titleTopological complexity of collision free motion planning algorithms in the presence of multiple moving obstacles
dc.typetext

Files

Collections

arXiv