Sample-based motion planning in high-dimensional and differentially-constrained systems

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010. === This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. === Cataloged from student submit...

Full description

Bibliographic Details
Main Author: Shkolnik, Alexander C
Other Authors: Russ Tedrake.
Format: Others
Language:English
Published: Massachusetts Institute of Technology 2010
Subjects:
Online Access:http://hdl.handle.net/1721.1/57537
id ndltd-MIT-oai-dspace.mit.edu-1721.1-57537
record_format oai_dc
spelling ndltd-MIT-oai-dspace.mit.edu-1721.1-575372019-05-02T16:03:59Z Sample-based motion planning in high-dimensional and differentially-constrained systems Shkolnik, Alexander C Russ Tedrake. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010. This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Cataloged from student submitted PDF version of thesis. Includes bibliographical references (p. 115-124). State of the art sample-based path planning algorithms, such as the Rapidly-exploring Random Tree (RRT), have proven to be effective in path planning for systems subject to complex kinematic and geometric constraints. The performance of these algorithms, however, degrade as the dimension of the system increases. Furthermore, sample-based planners rely on distance metrics which do not work well when the system has differential constraints. Such constraints are particularly challenging in systems with non-holonomic and underactuated dynamics. This thesis develops two intelligent sampling strategies to help guide the search process. To reduce sensitivity to dimension, sampling can be done in a low-dimensional task space rather than in the high-dimensional state space. Altering the sampling strategy in this way creates a Voronoi Bias in task space, which helps to guide the search, while the RRT continues to verify trajectory feasibility in the full state space. Fast path planning is demonstrated using this approach on a 1500-link manipulator. To enable task-space biasing for underactuated systems, a hierarchical task space controller is developed by utilizing partial feedback linearization. Another sampling strategy is also presented, where the local reachability of the tree is approximated, and used to bias the search, for systems subject to differential constraints. Reachability guidance is shown to improve search performance of the RRT by an order of magnitude when planning on a pendulum and non-holonomic car. The ideas of task-space biasing and reachability guidance are then combined for demonstration of a motion planning algorithm implemented on LittleDog, a quadruped robot. The motion planning algorithm successfully planned bounding trajectories over extremely rough terrain. by Alexander C. Shkolnik. Ph.D. 2010-08-26T15:20:02Z 2010-08-26T15:20:02Z 2010 2010 Thesis http://hdl.handle.net/1721.1/57537 635459246 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 124 p. application/pdf Massachusetts Institute of Technology
collection NDLTD
language English
format Others
sources NDLTD
topic Electrical Engineering and Computer Science.
spellingShingle Electrical Engineering and Computer Science.
Shkolnik, Alexander C
Sample-based motion planning in high-dimensional and differentially-constrained systems
description Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010. === This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. === Cataloged from student submitted PDF version of thesis. === Includes bibliographical references (p. 115-124). === State of the art sample-based path planning algorithms, such as the Rapidly-exploring Random Tree (RRT), have proven to be effective in path planning for systems subject to complex kinematic and geometric constraints. The performance of these algorithms, however, degrade as the dimension of the system increases. Furthermore, sample-based planners rely on distance metrics which do not work well when the system has differential constraints. Such constraints are particularly challenging in systems with non-holonomic and underactuated dynamics. This thesis develops two intelligent sampling strategies to help guide the search process. To reduce sensitivity to dimension, sampling can be done in a low-dimensional task space rather than in the high-dimensional state space. Altering the sampling strategy in this way creates a Voronoi Bias in task space, which helps to guide the search, while the RRT continues to verify trajectory feasibility in the full state space. Fast path planning is demonstrated using this approach on a 1500-link manipulator. To enable task-space biasing for underactuated systems, a hierarchical task space controller is developed by utilizing partial feedback linearization. Another sampling strategy is also presented, where the local reachability of the tree is approximated, and used to bias the search, for systems subject to differential constraints. Reachability guidance is shown to improve search performance of the RRT by an order of magnitude when planning on a pendulum and non-holonomic car. The ideas of task-space biasing and reachability guidance are then combined for demonstration of a motion planning algorithm implemented on LittleDog, a quadruped robot. The motion planning algorithm successfully planned bounding trajectories over extremely rough terrain. === by Alexander C. Shkolnik. === Ph.D.
author2 Russ Tedrake.
author_facet Russ Tedrake.
Shkolnik, Alexander C
author Shkolnik, Alexander C
author_sort Shkolnik, Alexander C
title Sample-based motion planning in high-dimensional and differentially-constrained systems
title_short Sample-based motion planning in high-dimensional and differentially-constrained systems
title_full Sample-based motion planning in high-dimensional and differentially-constrained systems
title_fullStr Sample-based motion planning in high-dimensional and differentially-constrained systems
title_full_unstemmed Sample-based motion planning in high-dimensional and differentially-constrained systems
title_sort sample-based motion planning in high-dimensional and differentially-constrained systems
publisher Massachusetts Institute of Technology
publishDate 2010
url http://hdl.handle.net/1721.1/57537
work_keys_str_mv AT shkolnikalexanderc samplebasedmotionplanninginhighdimensionalanddifferentiallyconstrainedsystems
_version_ 1719033940457553920