Strobe: An Acceleration Meta-algorithm for Optimizing Robot Paths using Concurrent Interleaved Sub-Epoch Pods

06/01/2021
by   Daniel Rakita, et al.
0

In this paper, we present a meta-algorithm intended to accelerate many existing path optimization algorithms. The central idea of our work is to strategically break up a waypoint path into consecutive groupings called "pods," then optimize over various pods concurrently using parallel processing. Each pod is assigned a color, either blue or red, and the path is divided in such a way that adjacent pods of the same color have an appropriate buffer of the opposite color between them, reducing the risk of interference between concurrent computations. We present a path splitting algorithm to create blue and red pod groupings and detail steps for a meta-algorithm that optimizes over these pods in parallel. We assessed how our method works on a testbed of simulated path optimization scenarios using various optimization tasks and characterize how it scales with additional threads. We also compared our meta-algorithm on these tasks to other parallelization schemes. Our results show that our method more effectively utilizes concurrency compared to the alternatives, both in terms of speed and optimization quality.

READ FULL TEXT
research
12/23/2021

Reinforced Meta-path Selection for Recommendation on Heterogeneous Information Networks

Heterogeneous Information Networks (HINs) capture complex relations amon...
research
11/15/2012

Color scales that are effective in both color and grayscale

We consider the problem of finding a color scale which performs well whe...
research
06/08/2023

Scenic Routes over Points in 2D Space

Consider a 2D coordinate space with a set of red and a set of blue point...
research
09/28/2019

Learning Fast Adaptation with Meta Strategy Optimization

The ability to walk in new scenarios is a key milestone on the path towa...
research
10/14/2022

MetaFill: Text Infilling for Meta-Path Generation on Heterogeneous Information Networks

Heterogeneous Information Network (HIN) is essential to study complicate...
research
08/10/2023

Shortest path or random walks? A framework for path weights in network meta-analysis

Quantifying the contributions, or weights, of comparisons or single stud...

Please sign up or login with your details

Forgot password? Click here to reset