The First International Symposium on Search Techniques in Artificial Intelligence and Robotics

Main Symposium page 


Note that each paper presentation is 25 minutes long (including questions), and each poster ad is 5 minutes long.

9:00-9:10 Introductory remarks
9:10-9:30 Overview of Search in AI and Robotics
Sven Koenig
9:30-10:30 Invited Talk: Solving Hard Planning Problems in Robotics with Simple A*-like Searches
Maxim Likhachev
10:30-11:00 Coffee break
11:00-12:30 Poster Ads:
12:30-2:00 Lunch
2:00-3:00 Invited Talk: Automatically Deriving Abstraction Heuristics
Malte Helmert
3:00-3:30 Poster Ad:
3:30-4:00 Coffee break
5:15-5:20 Stretch break
6:10-8:00 Dinner and discussion about conference in 2009
8:50-9:00 Logistical remarks
9:00-10:00 Invited Talk: Search in Embodied AI and Computational Biology
Oliver Brock
10:00-10:30 Poster Ad:
10:30-11:00 Coffee break
11:00-12:10 Poster Ads:
  • Toward Optimal Configuration Space Sampling
    Brendan Burns and Oliver Brock
  • On Heavy-tailed Runtimes and Restarts in Rapidly-exploring Random Trees
    Nathan Wedge and Michael Branicky
  • Tr-FSP: Forward Stochastic Planning using Probabilistic Reachability
    Florent Teichteil and Guillaume Infantes
  • Using Swamps to Improve Optimal Pathfinding
    Nir Pochter, Aviv Zohar and Jeffrey Rosenschein
12:10-12:30 Discussion about conference in 2009
12:30-2:00 Lunch
2:00-3:30 Poster Ads:
3:30-4:00 Coffee break
4:00-6:00 Poster session