CS 201 | How to Cross a Desert of Unknown Width, RICHARD KORF, UCLA – Computer Science Department

Speaker: Richard Korf
Affiliation: UCLA - Computer Science Department

ABSTRACT:

The classic jeep problem concerns crossing a desert wider than the range of the jeep, with the aid of preplaced fuel caches. One version of this problem is over a thousand years old, and it was solved optimally over 75 years ago. All previous work assumes that we know the width of the desert in advance, but we consider the case where we don’t know the distance. The answer ends up being rather surprising.

BIO:

Richard Korf is a professor of computer science at UCLA. He received his B.S. from M.I.T. in 1977, and his M.S. and Ph.D. from Carnegie-Mellon University in 1980 and 1983, respectively. From 1983 to 1985, he was an assistant professor at Columbia University, and has been at UCLA since 1985. His research is in the areas of problem solving, planning, and heuristic search in artificial intelligence. In his free time, he enjoys applying both gradient ascent and gradient descent methods in the physical world.

Date/Time:
Date(s) - Jun 08, 2023
4:15 pm - 5:45 pm

Location:
3400 Boelter Hall
420 Westwood Plaza Los Angeles California 90095