Swarm Robotics: Measurement and Sorting
| dc.contributor.advisor | McLurkin, James D. | |
| dc.contributor.committeeMember | Kavraki, Lydia E | |
| dc.contributor.committeeMember | Chaudhuri, Swarat | |
| dc.creator | Zhou, Yu | |
| dc.date.accessioned | 2016-02-05T21:30:54Z | |
| dc.date.available | 2016-02-05T21:30:54Z | |
| dc.date.created | 2015-05 | |
| dc.date.issued | 2015-04-24 | |
| dc.date.submitted | May 2015 | |
| dc.date.updated | 2016-02-05T21:30:54Z | |
| dc.description.abstract | To measure is an important ability for robots to sense the environment and nearby robots. Although camera, laser, and ultrasonic provide very accurate measurements, they are expensive and not scalable for large swarm of low-cost robots. The r-one robot designed at Rice University is equipped with infrared transmitters and receivers, which are designed for remote control and are very inexpensive in mass production. They are a good solution for short-range communication, since the signal attenuates at about 1 to 2 meters with appropriate voltage. This work describes my results in using them to measure bearing, orientation, and distance between nearby robots. However, infrared receivers are not designed for this kind of use, so I present a variable transmit power approach to allow useful and efficient local geometry measurements. With the ability to measure bearing and distance, I am able to solve the problem of sorting a group of n robots in a two-dimensional space. I want to organize robots into a sorted and equally-spaced path between the robots with lowest and highest label, while maintaining a connected communication network throughout the process. I begin with a straightforward geometry-based version of sorting algorithm, and point out there are many difficulties when communication range becomes limited. Then I describe a topology-based distributed algorithm for this task. I introduce operations to break the symmetry between minimum and maximum, in order to keep time, travel distance, and communication costs low without using central control. I run a set of algorithms (leader election, tree formation, path formation, path modification, and geometric straightening) in parallel. I show that my overall approach is safe, correct, and efficient. It is robust to population changes, network connectivity changes, and sensor errors. I validate my theoretical results with simulation results. My algorithm implementation uses communication messages of fixed size and constant memory on each robot, and is a practical solution for large populations of low-cost robots. | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | Zhou, Yu. "Swarm Robotics: Measurement and Sorting." (2015) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/88413">https://hdl.handle.net/1911/88413</a>. | |
| dc.identifier.uri | https://hdl.handle.net/1911/88413 | |
| dc.language.iso | eng | |
| dc.rights | Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder. | |
| dc.subject | Swarm Robotics | |
| dc.subject | Physical Sorting | |
| dc.subject | Distributed Algorithms | |
| dc.title | Swarm Robotics: Measurement and Sorting | |
| dc.type | Thesis | |
| dc.type.material | Text | |
| thesis.degree.department | Computer Science | |
| thesis.degree.discipline | Engineering | |
| thesis.degree.grantor | Rice University | |
| thesis.degree.level | Masters | |
| thesis.degree.name | Master of Science |
Files
Original bundle
1 - 1 of 1