Dynamic Potential Search
A New Bounded Suboptimal Search Algorithm
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch
35.90 €
Produktdetails
Produktinformationen zu „Dynamic Potential Search “
Klappentext zu „Dynamic Potential Search “
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 tobe the product of the minimal f-value in OPEN and the required suboptimal bound.
Bibliographische Angaben
- Autor: Daniel Gilon
- 2018, 56 Seiten, Maße: 22 cm, Kartoniert (TB), Englisch
- Verlag: LAP Lambert Academic Publishing
- ISBN-10: 613733807X
- ISBN-13: 9786137338070
Sprache:
Englisch
Kommentar zu "Dynamic Potential Search"
0 Gebrauchte Artikel zu „Dynamic Potential Search“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Dynamic Potential Search".
Kommentar verfassen