Topological complexity of collision free motion planning algorithms in the presence of multiple moving obstacles
Michael Farber, Mark Grant, Sergey Yuzvinsky
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.
Create a lesson
Related papers
UGM: A Unified Framework and New Perspectives for Accelerated Gradient Methods in Smooth and Strongly Convex Optimization
Danqing Zhou, Shiqian Ma, Junfeng Yang
When MILP Beats QP: Piecewise-Linear Reformulations of Sequentially Coupled Bilinear Programs
Quentin Ploussard, Maris Usis, Oluwabunmi Iwakin et al.
Marine Autonomous Vehicle Fleet Scheduling to Maximise Scientific Impact
Mehdi El Krari, Jonathan Smith, Maria Fox
Asymptotic consensus and flocking under decaying persistent excitation on rooted digraphs
Chiara Cicolani, Elisa Continelli, Cristina Pignotti
Co-Optimized Generation, Transmission, and Storage Expansion: System Value and Optimal Duration of Pumped-Storage Hydropower
Rafael Benchimol Klausner, Rafael Kelman
Randomized Quasi-Gauss--Newton Methods for Solving General Nonlinear Equations
Chengchang Liu, Luo Luo