23,99 €
inkl. MwSt.
Versandfertig in 6-10 Tagen
12 °P sammeln
Andere Kunden interessierten sich auch für
![Optimal Parsing for Dictionary-Based Compression]( "Optimal Parsing for Dictionary-Based Compression")
Optimal Parsing for Dictionary-Based Compression22,99 €![Enhanced Question Classification with Optimal Combination of Features]( "Enhanced Question Classification with Optimal Combination of Features")
Enhanced Question Classification with Optimal Combination of Features32,99 €![Energy-optimal routing with turn costs for electric vehicles]( "Energy-optimal routing with turn costs for electric vehicles")
Energy-optimal routing with turn costs for electric vehicles26,99 €![Solution of an optimal control problem using neural networks]( "Solution of an optimal control problem using neural networks")
Solution of an optimal control problem using neural networks44,99 €![Reinforcement Learning for Sequential Decision and Optimal Control]( "Reinforcement Learning for Sequential Decision and Optimal Control")
Reinforcement Learning for Sequential Decision and Optimal Control59,99 €![Reinforcement Learning for Sequential Decision and Optimal Control]( "Reinforcement Learning for Sequential Decision and Optimal Control")
Reinforcement Learning for Sequential Decision and Optimal Control82,99 €![Dynamic Service Aggregation for Integrated Mobile Grid Systems]( "Dynamic Service Aggregation for Integrated Mobile Grid Systems")
Dynamic Service Aggregation for Integrated Mobile Grid Systems51,99 €
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.