We present an explicit algorithm for two robots to move autonomously and without collisions on a track shaped like the letter Y. Configuration spaces are of practical relevance in designing safe control schemes for automated guided vehicles. The topological complexity of a configuration space is the minimal number of continuous instructions required to move robots between any initial configuration to any final one without collisions. Using techniques from topological robotics, we calculate the topological complexity of two robots moving on a Y-track and exhibit an optimal algorithm realizing this exact number of instructions given by the topological complexity.

Author Bio

David Baldi is an undergraduate student at Wilbur Wright College, one of the City Colleges of Chicago. His interests include computer science, particularly software engineering, and he is pursuing a career in the field, more specifically in the field of artificial intelligence. His non-academic interests include writing and drawing, as well as making sure his cat is happy and healthy.