<?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-19T04:43:59Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/28550" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/28550</identifier><datestamp>2022-01-13T07:54:29Z</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">Leslie P. Kaelbling and David Barrett.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">McLurkin, James D. (James Dwight), 1972-</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2005-09-27T16:57:21Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2005-09-27T16:57:21Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2004</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2004</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/28550</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">57402161</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Page 127 blank.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 123-126).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">As robots become ubiquitous, multiple robots dedicated to a single task will become commonplace. Groups of robots can solve problems in fundamentally different ways than individuals while achieving higher levels of performance, but present unique challenges for programming and coordination. This work presents a set of communication techniques and a library of behaviors useful for programming large groups, or swarms, of robots to work together. The gradient-flood communications algorithms presented are resilient to the constantly changing network topology of the Swarm. They provide real-time information that is used to communicate data and to guide robots around the physical environment. Special attention is paid to ensure orderly removal of messages. Decomposing swarm actions into individual behaviors is a daunting task. Complex and subtle local interactions among individuals produce global behaviors, sometimes unexpectedly so. The behavior library presented provides group behavior "building blocks" that interact in predictable manner and can be combined to build complex applications. The underlying distributed algorithms are scaleable, robust, and self-stabilizing. The library of behaviors is designed with an eye towards practical applications, such as exploration, searching, and coordinated motion. All algorithms have been developed and tested on a swarm of 100 physical robots. Data is presented on algorithm correctness and efficiency. stabilizing. The library of behaviors is designed with an eye towards practical applications, such as exploration, searching, and coordinated motion. All algorithms have been developed and tested on a swarm of 100 physical robots. Data is presented on algorithm correctness and efficiency.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by James D. McLurkin.</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">127 p.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">11680192 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">11695973 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en_US</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">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.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Stupid robot tricks : a behavior-based distributed algorithm library for programming swarms of robots</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="452e081c-7398-4580-8ebc-c8618e0dcdc1">
	&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>en_US&lt;/Language>
   	&lt;Title>Stupid robot tricks : a behavior-based distributed algorithm library for programming swarms of robots&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2004&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>McLurkin, James D. (James Dwight), 1972-&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>Electrical Engineering and Computer Science.&lt;/Keyword>
   	&lt;Abstract>As robots become ubiquitous, multiple robots dedicated to a single task will become commonplace. Groups of robots can solve problems in fundamentally different ways than individuals while achieving higher levels of performance, but present unique challenges for programming and coordination. This work presents a set of communication techniques and a library of behaviors useful for programming large groups, or swarms, of robots to work together. The gradient-flood communications algorithms presented are resilient to the constantly changing network topology of the Swarm. They provide real-time information that is used to communicate data and to guide robots around the physical environment. Special attention is paid to ensure orderly removal of messages. Decomposing swarm actions into individual behaviors is a daunting task. Complex and subtle local interactions among individuals produce global behaviors, sometimes unexpectedly so. The behavior library presented provides group behavior &amp;quot;building blocks&amp;quot; that interact in predictable manner and can be combined to build complex applications. The underlying distributed algorithms are scaleable, robust, and self-stabilizing. The library of behaviors is designed with an eye towards practical applications, such as exploration, searching, and coordinated motion. All algorithms have been developed and tested on a swarm of 100 physical robots. Data is presented on algorithm correctness and efficiency. stabilizing. The library of behaviors is designed with an eye towards practical applications, such as exploration, searching, and coordinated motion. All algorithms have been developed and tested on a swarm of 100 physical robots. Data is presented on algorithm correctness and efficiency.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>