############################################################ Seminar Announcement Department of Computer Science, FEIT The Australian National University ############################################################ Date: Wednesday, 22 June 2005 Time: 4:00 pm to 5:00 pm Venue: Room N101, CSIT Building [108] Speaker: Mr Iain Little, PhD Student, Computer Science Lab Title: Prottle: A Probabilistic Temporal Planner Abstract: Planning with concurrent durative actions and probabilistic effects, or probabilistic temporal planning, is a relatively new area of research. The challenge is to replicate the success of modern temporal and probabilistic planners with domains that exhibit an interaction between time and uncertainty. We present a general framework for probabilistic temporal planning in which effects, the time at which they occur, and action durations are all probabilistic. This framework includes a search space that is designed for solving probabilistic temporal planning problems via heuristic search, an algorithm that has been tailored to work with it, and an effective heuristic based on an extension of the planning graph data structure. Prottle is a planner that implements this framework, and can solve problems expressed in an extension of PDDL. This talk will be split into two halves: the first will give an introduction to automated planning, and the second will present the titled paper. The paper is to appear at the 20th American National Conference on Artificial Intelligence (AAAI-05). Reference http://users.rsise.anu.edu.au/~thiebaux/papers/aaai05.pdf Biography: Iain Little completed his BSEng with first class honours at ANU in 2004 and now is working towards his PhD. The paper he will be presenting at AAAI is based on his honours thesis. URL: http://cs.anu.edu.au/lib/seminars/seminars05/dept20050622 ############################################################ Seminars homepage: http://cs.anu.edu.au/seminars/ If you like to give a seminar please contact: seminars-admin [at] cs.anu.edu.au ############################################################