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

Main Symposium page

Schedule

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

Sunday 7/13/2008	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	Using Inconsistent Heuristics on A Search* Nathan Sturtevant, Zhifu Zhang, Rob Holte and Jonathan Schaeffer Fast and Loose in Bounded Suboptimal Heuristic Search Jordan Thayer, Wheeler Ruml and Ephrat Bitton Combining Breadth-First and Depth-First Strategies in Searching for Treewidth Rong Zhou and Eric Hansen Poster Ads: Learning from Multiple Heuristics Mehdi Samadi, Ariel Felner and Jonathan Schaeffer Efficient Algorithms to Rank and Unrank Permutations in Lexicographic Order Blai Bonet Exploring Infeasibility for Abstraction-Based Heuristics Fan Yang
	12:30-2:00	Lunch
	2:00-3:00	Invited Talk: Automatically Deriving Abstraction Heuristics Malte Helmert
	3:00-3:30	Multiple Symmetries in Sliding Puzzles: First Experiments Cesar Romero, Julio Castillo and Blai Bonet. Poster Ad: Planning in The Face of Frequent Exogenous Events Christian Fritz and Sheila McIlraith
	3:30-4:00	Coffee break
	4:00-5:15	MAP Search in Bayesian Networks Using Joint Bounds Changhe Yuan and Eric Hansen Heuristic Search for Target-Value Path Problem Lukas Kuhn, Bob Price, Johan de Kleer, Tim Schmidt, Rong Zhou and Minh Do Search Techniques for Fourier-Based Learning Adam Drake and Dan Ventura
	5:15-5:20	Stretch break
	5:20-6:10	Practical Search Techniques in Path Planning for Autonomous Driving Dmitri Dolgov, Sebastian Thrun, Michael Montemerlo and James Diebel Planning Long Dynamically-Feasible Maneuvers for Autonomous Vehicles Maxim Likhachev and Dave Ferguson
	6:10-8:00	Dinner and discussion about conference in 2009
Monday 7/14/2008	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	Recent Results in Analyzing the Performance of Heuristic Search Teresa Breyer and Richard Korf Poster Ad: Predicting the Performance of IDA with Conditional Distributions* Uzi Zahavi, Ariel Felner, Neil Burch and Rob Holte
	10:30-11:00	Coffee break
	11:00-12:10	Transition-based RRT for Path Planning in Continuous Cost Spaces Léonard Jaillet, Juan Cortés and Thierry Siméon Informed and Probabilistically Complete Search for Motion Planning under Differential Constraints Kostas Bekris and Lydia Kavraki 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	Combining Lookahead and Propagation in Real-Time Heuristic Search Carlos Hernandez and Pedro Meseguer Speeding up Moving-Target Search Sven Koenig, Maxim Likhachev and Xiaoxun Sun A Fresh Look at Sensor-Based Navigation, Navigation with Sensing Costs Zahy Bnaya, Ariel Felner, Solomon Eyal Shimony, Gal Kaminka and Efi Merdler Poster Ads: Learned Value-Ordering Heuristics for Constraint Satisfaction Zhijun Zhang and Susan L. Epstein Online Search Cost Estimation for SAT Solvers Shai Haim and Toby Walsh Applying Probabilistic Inference to Heuristic Search Eric Hsu, Christian Muise, Chris Beck and Sheila McIlraith
	3:30-4:00	Coffee break
	4:00-6:00	Poster session