Two algorithms for the package-exchange robot-routing problem

12/26/2018
by   James Drain, et al.
0

We present and analyze two new algorithms for the package-exchange robot-routing problem (PERR): restriction to inidividual paths (RIP) and bubbletree. RIP provably produces a makespan that is O(SIC+k^2), where SIC is the sum of the lengths of the individual paths and k is the number of robots. Bubbletree produces a makespan that is O(n), where n is the number of nodes. With optimizations bubbletree can also achieve a makespan of O((k+l)logk), where l is the longest path from start to goal in the bubbletree subgraph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2021

Topology for Substrate Routing in Semiconductor Package Design

In this work, we propose a new signal routing method for solving routing...
research
04/02/2023

Algorithms for Construction, Classification and Enumeration of Closed Knight's Paths

Two algorithms for construction of all closed knight's paths of lengths ...
research
06/30/2018

Ant routing algorithm for the Lightning Network

We propose a decentralized routing algorithm that can be implemented in ...
research
02/03/2022

The Swapped Dragonfly

This paper describes the Swapped Dragonfly. It is a two-parameter family...
research
08/25/2023

To Rectify Routing Games for Social Information Sharing

We study a new incentive problem of social information sharing for locat...
research
09/10/2017

Robust Routing in Interdependent Networks

We consider a model of two interdependent networks, where every node in ...
research
08/05/2021

Routing with Face Traversal and Auctions Algorithms for Task Allocation in WSRN

Four new algorithms (RFTA1, RFTA2, GFGF2A, and RFTA2GE) handling the eve...

Please sign up or login with your details

Forgot password? Click here to reset