Speaker: Christian Muise
Department of Computer Science
University of Toronto
Topic: Reachability Refinement Deadend Detection
Abstract: I will be discussing research conducted over the summer in collaboration with the Strathclyde Planning Group -- Reachability Refinement Deadend Detection. A deadend is defined as a state (or set of states) in a planning task that has no path to the goal state. Not all domains contain deadends, but for those that do have deadends, solving time can be reduced substantially by avoiding large portions of the search space thanks to efficient deadend detection.
For further information contact: Jessica Davies