<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-18T22:33:45Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/118701" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/118701</identifier><datestamp>2022-01-13T07:54:05Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Harry Asada.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Shikari, Abbas (Abbas M.)</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Department of Mechanical Engineering.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Mechanical Engineering</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2018-10-22T18:45:33Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2018-10-22T18:45:33Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2018</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2018</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/118701</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">1056960029</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis: S.M., Massachusetts Institute of Technology, Department of Mechanical Engineering, 2018.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Cataloged from PDF version of thesis.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (pages 41-42).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Final assembly, inspection, and maintenance of aircrafts, automobiles, and industrial equipment often requires a robot to reach confined areas that are difficult to access. While a robot can move freely in open space, the last one foot to a target site in a manufacturing environment is often cluttered with complex obstacles. Here we present a novel solution to the last one foot problem. Inspired by plant stem growth, a new design concept for an expandable arm, the Triple Scissor Extender Robot Arm (TSERA), is developed to access a confined area through a narrow channel. The robot consists of a series of expandable segments each of which is able to extend and tilt. Thus, the robot can elongate its structure along a narrow, winding space. The new design concept is accompanied by a new algorithm for path planning, the Sequential Expansion Algorithm. Unlike traditional algorithms for articulated robot path planning, TSERA's Sequential Expansion Algorithm reduces the otherwise computationally expensive multi body path planning problem to a single rigid body kinematics problem. Exploiting the serial nature of expandable structure, we can compute arm motion by sequentially solving a simple inverse kinematics problem for each segment.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Abbas Shikari.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">S.M.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">42 pages</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">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.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Mechanical Engineering.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">The Triple Scissor Extender Robot Arm : solving the last one foot problem in robotic manipulation</dim:field>
   <dim:field mdschema="dc" element="title" qualifier="alternative" lang="en_US">Solving the last one foot problem in robotic manipulation</dim:field>
   <dim:field mdschema="dc" element="title" qualifier="alternative" lang="en_US">TSERA solving the last one foot problem in robotic manipulation</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="27e68703-83ea-4132-8487-8aeebae8097b">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>The Triple Scissor Extender Robot Arm : solving the last one foot problem in robotic manipulation&lt;/Title>
   	&lt;Subtitle>Solving the last one foot problem in robotic manipulation&lt;/Subtitle>
   	&lt;Subtitle>TSERA solving the last one foot problem in robotic manipulation&lt;/Subtitle>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2018&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Shikari, Abbas (Abbas M.)&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Mechanical Engineering.&lt;/Keyword>
   	&lt;Abstract>Final assembly, inspection, and maintenance of aircrafts, automobiles, and industrial equipment often requires a robot to reach confined areas that are difficult to access. While a robot can move freely in open space, the last one foot to a target site in a manufacturing environment is often cluttered with complex obstacles. Here we present a novel solution to the last one foot problem. Inspired by plant stem growth, a new design concept for an expandable arm, the Triple Scissor Extender Robot Arm (TSERA), is developed to access a confined area through a narrow channel. The robot consists of a series of expandable segments each of which is able to extend and tilt. Thus, the robot can elongate its structure along a narrow, winding space. The new design concept is accompanied by a new algorithm for path planning, the Sequential Expansion Algorithm. Unlike traditional algorithms for articulated robot path planning, TSERA&amp;apos;s Sequential Expansion Algorithm reduces the otherwise computationally expensive multi body path planning problem to a single rigid body kinematics problem. Exploiting the serial nature of expandable structure, we can compute arm motion by sequentially solving a simple inverse kinematics problem for each segment.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>