Show simple item record

dc.contributor.advisorTron, Robertoen_US
dc.contributor.authorZhang, Xinweien_US
dc.date.accessioned2020-05-08T12:29:45Z
dc.date.issued2020
dc.identifier.urihttps://hdl.handle.net/2144/40695
dc.description.abstractSample-based motion planning algorithms can be applied to a broad range of circumstances in motion planning of robotics. Though sample-based algorithms are able to generate collision-free paths without the information of obstacles, they still have two weaknesses: one is that it is challenging to pass through narrow passages, which might result in path generation failures; the other is that a fixed search scope might lead to a waste of computational resource, which would result in low efficiency. In order to limit the search scope and improve the efficiency of paths generation of narrow passages, obstacles in the configuration space can be used to constrain the sampling scope and guide sampling. This thesis develops Obstacle Activation to identify polygonal obstacles that can be used to limit the search scope and Obstacle Exploration to obtain free points in a non-polygonal configuration space. These two methods are combined with several improved sampling-based algorithms to achieve the acceleration of the shortest path and feasible path generation. Finally, through a large number of simulations, it is verified that Obstacle Activation and Obstacle Exploration can effectively improve the speed of sampling-based algorithms significantly on both challenging scenarios with narrow passages and general cases.en_US
dc.language.isoen_US
dc.rightsAttribution 4.0 Internationalen_US
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.subjectMechanical engineeringen_US
dc.titleExtensions of motion planning algorithmsen_US
dc.typeThesis/Dissertationen_US
dc.date.updated2020-05-07T19:02:07Z
dc.description.embargo2022-05-07T00:00:00Z
etd.degree.nameMaster of Scienceen_US
etd.degree.levelmastersen_US
etd.degree.disciplineMechanical Engineeringen_US
etd.degree.grantorBoston Universityen_US
dc.identifier.orcidhttps://orcid.org/0000-0002-9087-6625


This item appears in the following Collection(s)

Show simple item record

Attribution 4.0 International
Except where otherwise noted, this item's license is described as Attribution 4.0 International