Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
Daniel Gilon holds a M.Sc degree in Information System Engineering from the Ben-Gurion University. His research interests are Algorithm Development for combinatoric problems and Games, especially when looking for a solution that is not optimal.
"About this title" may belong to another edition of this title.
Search results for Dynamic Potential Search: A New Bounded Suboptimal...
Seller Image
Dynamic Potential Search
Published by
LAP LAMBERT Academic Publishing Jan 2018, 2018
ISBN 10: 613733807X
ISBN 13: 9786137338070
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 56 pp. Englisch. Seller Inventory # 9786137338070
Stock Image
Dynamic Potential Search: A New Bounded Suboptimal Search Algorithm
Published by
LAP LAMBERT Academic Publishing, 2018
ISBN 10: 613733807X
ISBN 13: 9786137338070
New
Paperback
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 56 pages. 8.66x5.91x0.13 inches. In Stock. Seller Inventory # zk613733807X
Buy New
£ 53.46
£ 10 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
Dynamic Potential Search
Published by
LAP LAMBERT Academic Publishing, 2018
ISBN 10: 613733807X
ISBN 13: 9786137338070
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Gilon DanielDaniel Gilon holds a M.Sc degree in Information System Engineering from the Ben-Gurion University. His research interests are Algorithm Development for combinatoric problems and Games, especially when looking for a soluti. Seller Inventory # 385844991
Buy New
£ 27.95
£ 42.51 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Dynamic Potential Search
Published by
LAP LAMBERT Academic Publishing Jan 2018, 2018
ISBN 10: 613733807X
ISBN 13: 9786137338070
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 56 pp. Englisch. Seller Inventory # 9786137338070
Seller Image
Dynamic Potential Search : A New Bounded Suboptimal Search Algorithm
Published by
LAP LAMBERT Academic Publishing, 2018
ISBN 10: 613733807X
ISBN 13: 9786137338070
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9786137338070
Seller Image
Dynamic Potential Search | A New Bounded Suboptimal Search Algorithm
Published by
LAP LAMBERT Academic Publishing, 2018
ISBN 10: 613733807X
ISBN 13: 9786137338070
New
Taschenbuch
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Dynamic Potential Search | A New Bounded Suboptimal Search Algorithm | Daniel Gilon | Taschenbuch | 56 S. | Englisch | 2018 | LAP LAMBERT Academic Publishing | EAN 9786137338070 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu. Seller Inventory # 111512710