• Create Account

### #ActualAngleWyrm

Posted 21 October 2013 - 12:48 PM

Searched and found the word 'pre-processing' (as expected) on that which makes it a variant of portal analysis  and hierarchical pathfinding.

The two Symmetry Breaking methods discussed, broadly classified as search space pruning techniques

Rectangular Symmetry Reduction
1. It preserves optimality.
2. It has a small memory overhead in practice.
3. Node insertion can be performed in constant time.
4. It can speed up A* search by anywhere from several factors to an order of magnitude.

Jump Point Search

1. It is optimal.
2. It involves no pre-processing.
3. It requires no extra-memory overheads.
4. It can consistently speed up A* search by over 10 times; making it not only competitive with, but often better than, approximate techniques such as HPA*

### #6AngleWyrm

Posted 20 October 2013 - 08:47 PM

Searched and found the word 'pre-processing' (as expected) on that which makes it a variant of portal analysis  and hierarchical pathfinding.

The two Symmetry Breaking methods discussed, broadly classified as search space pruning techniques

Rectangular Symmetry Reduction
1. It preserves optimality.
2. It has a small memory overhead in practice.
3. Node insertion can be performed in constant time.
4. It can speed up A* search by anywhere from several factors to an order of magnitude.

Jump Point Search

1. It is optimal.
2. It involves no pre-processing.
3. It requires no extra-memory overheads.
4. It can consistently speed up A* search by over 10 times; making it not only competitive with, but often better than, approximate techniques such as HPA*

### #5AngleWyrm

Posted 20 October 2013 - 08:40 PM

Searched and found the word 'pre-processing' (as expected) on that which makes it a variant of portal analysis  and hierarchical pathfinding.

The two Symmetry Breaking methods discussed, broadly classified as search space pruning techniques

Rectangular Symmetry Reduction
1. It preserves optimality.
2. It has a small memory overhead in practice.
3. Node insertion can be performed in constant time.
4. It can speed up A* search by anywhere from several factors to an order of magnitude.

Jump Point Search

1. It is optimal.
2. It involves no pre-processing.
3. It requires no extra-memory overheads.
4. It can consistently speed up A* search by over 10 times; making it not only competitive with, but often better than, approximate techniques such as HPA*

The moral -- be careful what you wish for.

### #4AngleWyrm

Posted 20 October 2013 - 08:38 PM

Searched and found the word 'pre-processing' (as expected) on that which makes it a variant of portal analysis  and hierarchical pathfinding.

The two Symmetry Breaking methods discussed, broadly classified as search space pruning techniques

Rectangular Symmetry Reduction
1. It preserves optimality.
2. It has a small memory overhead in practice.
3. Node insertion can be performed in constant time.
4. It can speed up A* search by anywhere from several factors to an order of magnitude.

Jump Point Search

1. It is optimal.
2. It involves no pre-processing.
3. It requires no extra-memory overheads.
4. It can consistently speed up A* search by over 10 times; making it not only competitive with, but often better than, approximate techniques such as HPA*

### #3AngleWyrm

Posted 20 October 2013 - 08:36 PM

Searched and found the word 'pre-processing' (as expected) on that which makes it a variant of portal analysis  and hierarchical pathfinding.

The two Symmetry Breaking methods, broadly classified as search space pruning techniques

Rectangular Symmetry Reduction
1. It preserves optimality.
2. It has a small memory overhead in practice.
3. Node insertion can be performed in constant time.
4. It can speed up A* search by anywhere from several factors to an order of magnitude.

Jump Point Search

1. It is optimal.
2. It involves no pre-processing.
3. It requires no extra-memory overheads.
4. It can consistently speed up A* search by over 10 times; making it not only competitive with, but often better than, approximate techniques such as HPA*

### #2AngleWyrm

Posted 20 October 2013 - 08:34 PM

Searched and found the word 'pre-processing' (as expected) on that which makes it a variant of portal analysis  and hierarchical pathfinding.

The two Symmetry breaking methods discussed in the article are:

Rectangular Symmetry Reduction
1. It preserves optimality.
2. It has a small memory overhead in practice.
3. Node insertion can be performed in constant time.
4. It can speed up A* search by anywhere from several factors to an order of magnitude.

Jump Point Search

1. It is optimal.
2. It involves no pre-processing.
3. It requires no extra-memory overheads.
4. It can consistently speed up A* search by over 10 times; making it not only competitive with, but often better than, approximate techniques such as HPA*

PARTNERS