[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Joint AIlab seminar and Fall Seminar on Data and Knowledge Integration
- To: rao@asu.edu, Huan Liu <hliu@asu.edu>, Hasan Davulcu <Hasan.Davulcu@asu.edu>, "candan@asu.edu" <candan@asu.edu>, zoe.lacroix@asu.edu, goran.konjevod@asu.edu, Chitta Baral <chitta@asu.edu>, ailab1@asu.edu, Saadat Anwar <saadat@east.la.asu.edu>, panch@asu.edu, surban@asu.edu, "'dietrich@asu.edu'" <dietrich@asu.edu>, mutsumi@asu.edu, dsandhya@asu.edu, Yisheng Yao <Yisheng.Yao@asu.edu>, "Xiao.Wei@asu.edu" <Xiao.Wei@asu.edu>, "partha.dasgupta@asu.edu" <partha.dasgupta@asu.edu>, Hari Sundaram <Hari.Sundaram@asu.edu>, Drew Davis <drewdavis00@hotmail.com>, "webdbai@parichaalak.eas.asu.edu" <webdbai@parichaalak.eas.asu.edu>
- Subject: Joint AIlab seminar and Fall Seminar on Data and Knowledge Integration
- From: Chitta Baral <chitta@asu.edu>
- Date: Wed, 25 Sep 2002 18:02:15 -0700
- Organization: Dept of Comp Sc and Engg, Arizona St Univ.
- References: <3D6865E6.B25BEA6F@asu.edu> <3D74D887.C14FA1BD@asu.edu><3D77806F.BD34DAA6@asu.edu> <3D7E499B.FC26BA63@asu.edu>
- Sender: chitta@smtp.asu.edu
The fourth talk of the seminar series
will be this Friday. It will be jointly sponsered
by the AI lab and will be at a different time.
Date: 9/27/02 (Friday)
Time: 3:00 -- 4:30 PM
Place: GWC 487
Title: Incremental Contingency Planning (for Mars Rover)
Speaker: David E. Smith
Head, Planning and Scheduling Group,
NASA AMES
Moffet Field, CA
http://wordbot.com/de2smith
Abstract:
There has been considerable work in AI on planning under uncertainty.
But this work generally assumes an extremely simple model of action that
does not consider continuous time and resources. These assumptions are
not reasonable for a Mars rover, which must cope with uncertainty about
the duration of tasks, the power required, the data storage necessary,
and its position and orientation.
In this talk, I present an approach to generating contingency plans
when the sources of uncertainty involve continuous quantities such as
time and resources. The approach involves first constructing a "seed"
plan, and then incrementally adding contingent branches to this plan in
order to improve utility. The challenge is to figure out the best places
to insert contingency branches. This requires an estimate of how much
utility could be gained by building a contingent branch at any given
place in the seed plan. Computing this utility exactly is intractable,
but I outline an approximation method that back propagates utility
distributions through a graph structure similar to that of a plan graph.
--
Chitta Baral, Professor
Dept of Computer Sc. and Engg.,
Arizona State University, Tempe, AZ 85287, USA.
chitta@asu.edu, http://www.public.asu.edu/~cbaral/
Ph: 480-727-6047, Fax: 480-965-2751