DeepAI AI Chat
Log In Sign Up

Symmetry-Based Search Space Reduction For Grid Maps

by   Daniel Harabor, et al.

In this paper we explore a symmetry-based search space reduction technique which can speed up optimal pathfinding on undirected uniform-cost grid maps by up to 38 times. Our technique decomposes grid maps into a set of empty rectangles, removing from each rectangle all interior nodes and possibly some from along the perimeter. We then add a series of macro-edges between selected pairs of remaining perimeter nodes to facilitate provably optimal traversal through each rectangle. We also develop a novel online pruning technique to further speed up search. Our algorithm is fast, memory efficient and retains the same optimality and completeness guarantees as searching on an unmodified grid map.


page 1

page 2

page 3

page 4


Fast Breadth-First Search in Still Less Space

It is shown that a breadth-first search in a directed or undirected grap...

BFS Enumeration for Breaking Symmetries in Graphs

There are numerous NP-hard combinatorial problems which involve searchin...

Fast 2D Map Matching Based on Area Graphs

We present a novel area matching algorithm for merging two different 2D ...

Why is Differential Evolution Better than Grid Search for Tuning Defect Predictors?

Context: One of the black arts of data mining is learning the magic para...

Path planning with Inventory-driven Jump-Point-Search

In many navigational domains the traversability of cells is conditioned ...

PyGlove: Symbolic Programming for Automated Machine Learning

Neural networks are sensitive to hyper-parameter and architecture choice...

Avoiding Monochromatic Rectangles Using Shift Patterns

Ramsey Theory deals with avoiding certain patterns. When constructing an...