Online strategies with applications to search and exploration
published: Oct. 3, 2014, recorded: September 2014, views: 1965
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
This sequence of lectures will focus on online strategies for exploration and search in combinatorial environments. We introduce the concept of competitive analysis with some simple examples, including list updates in linear sequences. Competitive analysis has become the main tool for analyzing the worst case behaviour of online strategies for exploration and search. We exhibit some results on online search and exploration including searching for a target point on a line with a single agent, searching for a target on multiple lines with several agents, geometric exploration of simple polygons with a single agent and some results on exploration of trees with multiple agents.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !