Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Anytime-Algorithm"”.
-
Anytime deliberation for computer game agents
… time, a planner is presented that behaves as an anytime algorithm. This anytime planner is a hierarchical task network planner which allows a planning agent to interrupt its planning process at any time and trade-off planning time against plan quality. The second area of agent construction that …
-
Exploiting insensitivity in stochastic systems to learn approximately optimal policies
… to extend the graph at each iteration of the algorithm, a sparse representation is obtained. Theoretical and simulation-based results are provided to demonstrate the effectiveness of this approach. The second technique extends the methodology of the first technique to an anytime algorithm. …
-
Risk-bounded Programming using Constrained, Hierarchical, Stochastic Shortest Path Problems
… problem (HC-SSP) and then solving it using an anytime algorithm. In this thesis, we present an executive named Zeppelin, which employs a divide-and- conquer approach to solving HC-SSP, leveraging the hierarchical structure of the problem to generate solutions in an anytime fashion. Zeppelin …
-
Energie- und qualitätsbewußte Einplanung von periodischen Prozessen in eingebetteten Echtzeitsystemen
… Qualität) generiert, und damit der Klasse der Anytime-Algorithmen zuzuordnen ist. Eine Variante der Dynamischen Programmierung dient zur Bestimmung global optimaler, flexibler Schedules, die beispielsweise als Basis für Benchmarks dienen. Eine auf Simulated Annealing basierende Variante des …
-
Algorithms for coalition formation in multi-agent systems
… this background, we develop a novel algorithm for distributing the value calculation among the cooperative agents. Specifically, by using our algorithm, each agent is assigned some part of the calculation such that the agents' shares are exhaustive and disjoint. Moreover, the …