Learning High-Dimensional Critical Regions for Efficient Robot Planning
abstract: Robot motion planning requires computing a sequence of waypoints from an initial configuration of the robot to the goal configuration. Solving a motion planning problem optimally is proven to be NP-Complete. Sampling-based motion planners efficiently compute an approximation of the optimal...
| Other Authors: | |
|---|---|
| Format: | Dissertation |
| Language: | English |
| Published: |
2020
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2286/R.I.62738 |