2026-09-19T17:32:20Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/916952026-06-06T00:54:45Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Daniela Rus.
Layton, Todd Samuel
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2014-11-24T16:16:11Z
2014-11-24T16:16:11Z
2014
2014
http://hdl.handle.net/1721.1/91695
894240253
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
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 75-76).
We present an ecient algorithm for computing semantic environment models and activity patterns in terms of those models from long-term value trajectories defined as sensor data streams. We use an expectation-maximization approach to calculate a locally optimal set of path segments with minimal total error from the given data signal. This process reduces the raw data stream to an approximate semantic representation. The algorithm's speed is greatly improved by the use of lossless coresets during the iterative update step, as they can be calculated in constant amortized time to perform operations with otherwise linear runtimes. We evaluate the algorithm for two types of data, GPS points and video feature vectors, on several data sets collected from robots and human-directed agents. These experiments demonstrate the algorithm's ability to reliably and quickly produce a model which closely ts its input data, at a speed which is empirically no more than linear relative to the size of that data set. We analyze several topological maps and representative feature sets produced from these data sets.
by Todd Samuel Layton.
M.Eng.
76 pages
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
Electrical Engineering and Computer Science.
A generalized (k, m)-segment mean algorithm for long term modeling of traversable environments
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="762bf4fd-fd5d-477c-9160-37987bf96ea2">
<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>A generalized (k, m)-segment mean algorithm for long term modeling of traversable environments</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2014</PublicationDate>
<Authors>
<Author>
<DisplayName>Layton, Todd Samuel</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>Electrical Engineering and Computer Science.</Keyword>
<Abstract>We present an ecient algorithm for computing semantic environment models and activity patterns in terms of those models from long-term value trajectories defined as sensor data streams. We use an expectation-maximization approach to calculate a locally optimal set of path segments with minimal total error from the given data signal. This process reduces the raw data stream to an approximate semantic representation. The algorithm's speed is greatly improved by the use of lossless coresets during the iterative update step, as they can be calculated in constant amortized time to perform operations with otherwise linear runtimes. We evaluate the algorithm for two types of data, GPS points and video feature vectors, on several data sets collected from robots and human-directed agents. These experiments demonstrate the algorithm's ability to reliably and quickly produce a model which closely ts its input data, at a speed which is empirically no more than linear relative to the size of that data set. We analyze several topological maps and representative feature sets produced from these data sets.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>