The Rubik's cube is a prototypical combinatorial puzzle that has a large state space with a
single goal state. The goal state is unlikely to be accessed using sequences of randomly …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

Search has been vital to artificial intelligence from the very beginning as a core technique in
problem solving. The authors present a thorough overview of heuristic search with a balance …

Tit ('maiu c. ntrilmti,, n is tit (. id,'a un, h. riyivg tht" Imuristic th~ Lt yivhIs nt (tilt" 11111". i't
whuh~ fim, ily of Imlyutmlial att, I a, huissild," houristi,'s that Ira, b. avt: uracy fitr ('fiici (. ncy …

This paper investigates symbolic heuristic search with BDDs for solving domain-
independent action planning problems cost-optimally. By distributing the impact of operators …

Liste der Autoren Page 1 Liste der Autoren Clemens Beckstein Gerhard Brewka Christian
Borgelt Wolfram Burgard Hans-Dieter Burkhard Stephan Busemann Thomas Christaller Leonie …

Many areas of computer science require answering questions about reachability in
compactly described discrete transition systems. Answering such questions effectively …

Informed sampling-based planning algorithms exploit problem knowledge for better search
performance. This knowledge is often expressed as heuristic estimates of solution cost and …

Agents operating in the real world often have limited time available for planning their next
actions. Producing optimal plans is infeasible in these scenarios. Instead, agents must be …

When solving instances of problem domains that feature a large branching factor, A* may
generate a large number of nodes whose cost is greater than the cost of the optimal solution …