Sampling and Searching Methods for Practical Motion Planning Algorithms
Yershova, Ganna
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/81838
Description
Title
Sampling and Searching Methods for Practical Motion Planning Algorithms
Author(s)
Yershova, Ganna
Issue Date
2008
Doctoral Committee Chair(s)
LaValle, Steven M.
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Robotics
Language
eng
Abstract
In its original conception, the motion planning problem considered the search of a robot path from an initial to a goal configuration. The study of motion planning has advanced significantly in recent years, in large part due to the development of highly successful sampling and searching techniques. Recent advances have influenced sampling-based motion planning algorithms to be used in disparate areas such as humanoid robotics, automotive manufacturing, spacecraft navigation, architecture, computational geography, computer graphics, and computational biology. Many of these methods work well on a large set of problems, however, they have weaknesses and limitations. This thesis expands the basic motion planning techniques to include critical concerns that are not covered by the motion planning algorithms that are in widespread use now. The technical approach is organized around three main thrusts: (1) the development of efficient nearest neighbor searching techniques for spaces arising in motion planning; (2) the development of uniform sampling techniques on these spaces to allow resolution completeness in sampling-based planning algorithms; and (3) the development of guided sampling techniques for efficient exploration on such spaces. Addressing these core issues in motion planning does not only lead to a more fundamental understanding of the problem, but also to more efficient practical algorithms.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
