[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Reminder: AI/DB Seminar Tomorrow



Howdy!

The next exciting installment of the AI/DB seminar is tomorrow.  Come watch
as professors and students alike grill this week's lucky presenter (victim).
This week, Romeo Sanchez will talk about "AltAlt-p: Online Parallelization
of Plans with Heuristic State Search."

Abstract:
Despite their near dominance, heuristic state search planners still
lag behind disjunctive planners in the generation of parallel plans in
classical planning. The reason is that directly searching for parallel
solutions in state space planners would require the planners to branch on
all possible subsets of parallel actions, thus increasing the branching
factor exponentially. We present a variant of our state search planner
altalt, called altaltp, which generates parallel plans by using
greedy online parallelization of partial plans. The greedy approach is
significantly informed by the use of novel distance heuristics that
altaltp derives from a graphplan-style planning graph for the
problem. While this approach is not guaranteed to provide optimal
parallel plans, empirical results show that altaltp is capable of
generating good quality parallel plans without losing also the quality
in terms of the total number of actions in the solution at a fraction
of the time cost incurred by the disjunctive planners.

See you all tomorrow,

Chris
-- 
==========================================================
Chris Mayer
Captain, USAF;
Ph.D. Student, Arizona State University
Computer Science and Engineering Dept.;
M.S. Computer Engineering '97 Air Force Institute of Tech
B.S. Electrical Engineering '92 Texas A&M University

mailto://chris.mayer@asu.edu
http://home.earthlink.net/~gcmayer
==========================================================