46 search results - page 10 / 10 » Kinodynamic Motion Planning Amidst Moving Obstacles |
154
click to vote
SIAMCOMP
2008
15 years 5 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...