Copertina di Dynamic Potential Search
Titolo del libro:

Dynamic Potential Search

A New Bounded Suboptimal Search Algorithm

LAP LAMBERT Academic Publishing (26.01.2018 )

Books loader

Omni badge eleggibile a buono
ISBN-13:

978-613-7-33807-0

ISBN-10:
613733807X
EAN:
9786137338070
Lingua del libro:
Inglese
Risvolto di copertina:
Potential Search (PS) is an algorithm that is designed to solve bounded cost search problems. In bounded cost search we are given a fixed cost-bound and the task is to find a solution (if one exists) with a cost lower than the given bound. A bounded suboptimal search problem is similar to bounded suboptimal search in the manner that it also has an upper bound on the desired solution, but here the bound is given relative to the optimal solution and is not fixed, hence bounded suboptimal. we give a general rule on how to migrate algorithms that were designed to solve bounded cost search problems into ones that can solve bounded suboptimal search problems and vice versa. We show that this can be done for most of the known algorithms and thus improve our understanding of their relation and difference. In this book, we modify PS to work within the framework of bounded suboptimal search and introduce Dynamic Potential Search (DPS). DPS uses the idea of PS but modifies the cost-bound to be the product of the minimal f-value in OPEN and the required suboptimal bound.
Casa editrice:
LAP LAMBERT Academic Publishing
Sito Web:
https://www.lap-publishing.com/
Da (autore):
Daniel Gilon
Numero di pagine:
56
Pubblicato il:
26.01.2018
Giacenza di magazzino:
Disponibile
categoria:
Informatica
Prezzo:
35,90 €
Parole chiave:
Algorithm, bounded, Optimal, Search, Sub, suboptimal

Books loader

Newsletter

Adyen::amex Adyen::mc Adyen::visa Adyen::cup Adyen::unionpay Paypal Trasferimento

  0 prodotti nel carro d'acquisti
Modificare il carrello
Loading frontend
LOADING