Nested Search versus Limited Discrepancy Search

10/01/2022
by   Tristan Cazenave, et al.
0

Limited Discrepancy Search (LDS) is a popular algorithm to search a state space with a heuristic to order the possible actions. Nested Search (NS) is another algorithm to search a state space with the same heuristic. NS spends more time on the move associated to the best heuristic playout while LDS spends more time on the best heuristic move. They both use similar times for the same level of search. We advocate in this paper that it is often better to follow the best heuristic playout as in NS than to follow the heuristic as in LDS.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/21/2014

Extended Breadth-First Search Algorithm

The task of artificial intelligence is to provide representation techniq...
research
01/15/2014

A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains

We consider the problem of optimal planning in stochastic domains with r...
research
06/07/2019

Exponential-Binary State-Space Search

Iterative deepening search is used in applications where the best cost b...
research
12/01/1997

Bidirectional Heuristic Search Reconsidered

The assessment of bidirectional heuristic search has been incorrect sinc...
research
01/16/2014

Best-First Heuristic Search for Multicore Machines

To harness modern multicore processors, it is imperative to develop para...
research
12/18/2019

Busca de melhor caminho entre múltiplas origens e múltiplos destinos em redes complexas que representam cidades

Was investigated in this paper the use of a search strategy in the probl...
research
05/08/2021

Survey of Parallel A* in Rust

A* is one of the most popular Best First Search (BFS) techniques for gra...

Please sign up or login with your details

Forgot password? Click here to reset