2026-09-20T01:49:31Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/671972022-01-13T07:54:11Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Jonathan P. How.
Wu, Albert (Albert Puming)
Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
2011-11-18T20:59:23Z
2011-11-18T20:59:23Z
2011
2011
http://hdl.handle.net/1721.1/67197
758675504
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2011.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 113-116).
Dynamic obstacle avoidance is an important, ubiquitous, and often challenging problem for autonomous mobile robots. This thesis presents a new method to guarantee collision avoidance with respect to moving obstacles that have constrained dynamics but move unpredictably. Velocity Obstacles have been widely used to plan trajectories that avoid collisions with obstacles under the assumption that the path of the objects are either known or can be accurately predicted ahead of time. However, for real systems, this predicted path will typically only be accurate over short time-horizons. To achieve safety over longer time periods, the method introduced here instead considers the set of all reachable points by an obstacle assuming that the dynamics fit the unicycle model, which has known constant forward speed and a maximum turn rate (sometimes called the Dubins car model). This thesis extends the Velocity Obstacle formulation by using reachability sets in place of a single "known" trajectory to find matching constraints in velocity space, called Velocity Obstacle Sets. The Velocity Obstacle Set for each obstacle is equivalent to the union of all velocity obstacles corresponding to any dynamically feasible future trajectory, given the obstacle's current state. This region remains bounded as the time horizon is increased to infinity, and by choosing control inputs that lie outside of these Velocity Obstacle Sets, it is guaranteed that the host agent can always actively avoid collisions with the obstacles, even without knowing their exact future paths. It thus follows that, subject to certain initial conditions, an iterative planner under these constraints guarantees safety for all time. Finally, the an iterative planner is repeatedly tested and analyzed in simulation under various conditions. If the time horizon is set to some finite value, the guaranteed collision avoidance is lost, but the planned trajectories generally become more direct. This effect of varying this time scale also depends on the presence of static obstacles in the environment and on the dynamic limitations of the host robot.
by Albert Wu.
S.M.
116 p.
eng
Massachusetts Institute of Technology
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
Aeronautics and Astronautics.
Guaranteed avoidance of unpredictable, dynamically constrained obstacles using velocity obstacle sets
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="2261ac37-6aa7-4f01-8179-9b22e8ec55cd">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Guaranteed avoidance of unpredictable, dynamically constrained obstacles using velocity obstacle sets</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2011</PublicationDate>
<Authors>
<Author>
<DisplayName>Wu, Albert (Albert Puming)</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Aeronautics and Astronautics.</Keyword>
<Abstract>Dynamic obstacle avoidance is an important, ubiquitous, and often challenging problem for autonomous mobile robots. This thesis presents a new method to guarantee collision avoidance with respect to moving obstacles that have constrained dynamics but move unpredictably. Velocity Obstacles have been widely used to plan trajectories that avoid collisions with obstacles under the assumption that the path of the objects are either known or can be accurately predicted ahead of time. However, for real systems, this predicted path will typically only be accurate over short time-horizons. To achieve safety over longer time periods, the method introduced here instead considers the set of all reachable points by an obstacle assuming that the dynamics fit the unicycle model, which has known constant forward speed and a maximum turn rate (sometimes called the Dubins car model). This thesis extends the Velocity Obstacle formulation by using reachability sets in place of a single "known" trajectory to find matching constraints in velocity space, called Velocity Obstacle Sets. The Velocity Obstacle Set for each obstacle is equivalent to the union of all velocity obstacles corresponding to any dynamically feasible future trajectory, given the obstacle's current state. This region remains bounded as the time horizon is increased to infinity, and by choosing control inputs that lie outside of these Velocity Obstacle Sets, it is guaranteed that the host agent can always actively avoid collisions with the obstacles, even without knowing their exact future paths. It thus follows that, subject to certain initial conditions, an iterative planner under these constraints guarantees safety for all time. Finally, the an iterative planner is repeatedly tested and analyzed in simulation under various conditions. If the time horizon is set to some finite value, the guaranteed collision avoidance is lost, but the planned trajectories generally become more direct. This effect of varying this time scale also depends on the presence of static obstacles in the environment and on the dynamic limitations of the host robot.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>