Sciweavers

50 search results - page 6 / 10
» State Space Search for Risk-Averse Agents
Sort
View
AAAI
1996
13 years 9 months ago
Exploiting Graph Properties of Game Trees
The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have c...
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de...
CAEPIA
2007
Springer
14 years 1 months ago
Mixed Narrative and Dialog Content Planning Based on BDI Agents
There exist various narrative systems, focused on different parts of the complex process of story generation. Some of them are oriented to content planning, and some other to sent...
Carlos León, Samer Hassan, Pablo Gerv&aacut...
AAAI
2006
13 years 9 months ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith
AAAI
2004
13 years 9 months ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003
AAAI
2010
13 years 9 months ago
To Max or Not to Max: Online Learning for Speeding Up Optimal Planning
It is well known that there cannot be a single "best" heuristic for optimal planning in general. One way of overcoming this is by combining admissible heuristics (e.g. b...
Carmel Domshlak, Erez Karpas, Shaul Markovitch