Campus Event Calendar
Event Entry
What and Who
Approximation of curvature-constrained shortest paths through a sequence of points
Jae-Ha Lee
Max-Planck-Institut für Informatik - AG 1
AG1 Mittagsseminar (own work)
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 20 March 2000
13:30
-- Not specified --
46
024
Saarbrücken
Abstract
Let B be a point robot moving in the plane, whose path is
constrained to have curvature at most 1, and let X denote
a sequence of n points.
We are interested in a shortest path for B that visits the
points in X in the given order. We discusses the online
algorithm and offline approximation algorithm.
Contact
Jae Ha Lee
--email hidden
passcode not visible
logged in users only