<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.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-19T17:14:33Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/81056" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/81056</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_8888</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_8887</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Francesco Bullo</dc:contributor>
          <dc:creator>Ganguli, Anurag</dc:creator>
          <dc:date>2015-09-25T20:09:26Z</dc:date>
          <dc:date>2015-09-25T20:09:26Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2007</dc:date>
          <dc:date>2007</dc:date>
          <dc:description>Third, we address problem (ii) by proposing a novel motion coordination algorithm for a group of robotic agents to achieve rendezvous, that is, to move to a common location inside a nonconvex environment. The robots move synchronously in discrete time, they have a range-limited visibility sensor, and no communication ability is required. The algorithm is designed using the notions of robust visibility, connectivity-preserving constraint sets, and proximity graphs. We rigorously establish the correctness of the algorithm and we illustrate through simulations the algorithm's performance in asynchronous setups with sensor measurement and control errors.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:09:26Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3301134.pdf: 5810544 bytes, checksum: 6e0f9505f2f1080247bcfc6394bedc49 (MD5)
  Previous issue date: 2007</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 82338
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>159 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/81056</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI3301134</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Engineering, Robotics</dc:subject>
          <dc:title>Motion Coordination for Mobile Robotic Networks With Visibility Sensors</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Electrical and Computer Engineering</department>
            <discipline>Electrical and Computer Engineering</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
