Dr. Subbarao Kambhampati is a professor of Computer Science at
Arizona State University. His group saw the connection between
planning graph and reachability analysis in 1998, and 
subsequently developed several scalable planners including AltAlt,
AltAlt-psp, SAPA, SAPA-ps, PEGG, CAltAlt, and POND. He is a
1994 NSF Young Investigator, a 2004 IBM faculty fellow, a AAAI
2005 Co-chair, a JAIR associate editor, and an elected fellow of AAAI 
in 2004 for his contributions to automated planning. He received the
2002 college of engineering teaching excellence award. He gave an
invited talk at 2003 ICAPS titled "1001 ways to skin a planning graph 
for heuristic fun and profit." The current tutorial builds on that
talk and discusses several new areas in which reachability heuristics
have been found to be useful.

Daniel Bryce is a Ph.D. candidate in the Computer Science 
Department at Arizona State University. His research interests
include planning graph heuristics, (PO)MDPs, and
non-deterministic/probabilistic planning, as well as applications to
biological systems. He has developed several planning systems that 
employ reachability heuristics based on planning graphs for planning
with partial observability, uncertain actions, and probabilities/non-determinism.