MPLP: Massively Parallelized Lazy Planning

07/06/2021
by   Shohin Mukherjee, et al.
0

Lazy search algorithms have been developed to efficiently solve planning problems in domains where the computational effort is dominated by the cost of edge evaluation. The current approaches operate by intelligently balancing computational effort between searching the graph and evaluating edges. However these algorithms are designed to run as a single process and do not leverage the multi-threading capability of modern processors. In this work we propose a massively parallelized, bounded suboptimal, lazy search algorithm (MPLP) that harnesses modern multi-core processors. In MPLP, searching of the graph and edge evaluations are performed completely asynchronously in parallel, leading to a drastic improvement in planning time. We validate the proposed algorithm in two different planning domains: motion planning for a humanoid navigation and task and motion planning for a robotic assembly task. We show that MPLP outperforms the state of the art lazy search as well as parallel search algorithms.

READ FULL TEXT

page 4

page 6

research
03/02/2022

ePA*SE: Edge-based Parallel A* for Slow Evaluations

Parallel search algorithms harness the multithreading capability of mode...
research
09/19/2023

LEA*: An A* Variant Algorithm with Improved Edge Efficiency for Robot Motion Planning

In this work, we introduce a new graph search algorithm, lazy edged base...
research
11/20/2017

Bayesian Active Edge Evaluation on Expensive Graphs

Robots operate in environments with varying implicit structure. For inst...
research
04/04/2019

Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles

Lazy search algorithms can efficiently solve problems where edge evaluat...
research
05/08/2023

A-ePA*SE: Anytime Edge-Based Parallel A* for Slow Evaluations

Anytime search algorithms are useful for planning problems where a solut...
research
01/24/2023

GePA*SE: Generalized Edge-Based Parallel A* for Slow Evaluations

Parallel search algorithms have been shown to improve planning speed by ...
research
05/25/2021

Lazy Lifelong Planning for Efficient Replanning in Graphs with Expensive Edge Evaluation

We present an incremental search algorithm, called Lifelong-GLS, which c...

Please sign up or login with your details

Forgot password? Click here to reset