Thesis: S.M., Massachusetts Institute of Technology, Department of Mechanical Engineering, 2017. / 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 (pages 113-116). / Autonomous (self-driving) vehicles are increasingly being tested on highways and city streets. But there is also a need for robots that can navigate through environments like sidewalks, buildings, and hallways. In these situations, the robots must interact and cooperate with pedestrians in a socially acceptable manner. The "rules of the road" no longer apply -- there are no lanes or street signs, and pedestrians don't use turn signals when cutting through crowds. This thesis describes the hardware and software architecture of a robot that was developed for this application. This thesis also proposes a 2nd generation robot with tighter budget and size constraints. Finally, this thesis presents a novel collision avoidance method that extends the Reciprocal Velocity Obstacle (RVO) framework to consider the impact of planning decisions on future world states. / by Michael F. Everett. / S.M.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/111698 |
| Date | January 2017 |
| Creators | Everett, Michael F |
| Contributors | Jonathan P. How., Massachusetts Institute of Technology. Department of Mechanical Engineering., Massachusetts Institute of Technology. Department of Mechanical Engineering. |
| Publisher | Massachusetts Institute of Technology |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | 116 pages, application/pdf |
| Rights | MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission., http://dspace.mit.edu/handle/1721.1/7582 |
Page generated in 0.0015 seconds