DeepAI AI Chat
Log In Sign Up

Collision free motion planning on a wedge of circles

by   Elif Sensoy, et al.

We exhibit an algorithm with continuous instructions for two robots moving without collisions on a track shaped as a wedge of three circles. We show that the topological complexity of the configuration space associated with this problem is 3. The topological complexity is a homotopy invariant that can be thought of as the minimum number of continuous instructions required to describe the movement of the robots between any initial configuration to any final one without collisions. The algorithm presented is optimal in the sense that it requires exactly 3 continuous instructions.


page 1

page 2

page 3

page 4


Sequential parametrized motion planning and its complexity, II

This is a continuation of our recent paper in which we developed the the...

Parametrized motion planning and topological complexity

In this paper we study paramertized motion planning algorithms which pro...

Learning Configuration Space Belief Model from Collision Checks for Motion Planning

For motion planning in high dimensional configuration spaces, a signific...

Geodesic complexity of a cube

The topological (resp. geodesic) complexity of a topological (resp. metr...

Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021

We give an overview of the 2021 Computational Geometry Challenge, which ...

Connected Coordinated Motion Planning with Bounded Stretch

We consider the problem of coordinated motion planning for a swarm of si...

BB_Evac: Fast Location-Sensitive Behavior-Based Building Evacuation

Past work on evacuation planning assumes that evacuees will follow instr...