Show simple item record

dc.contributor.advisorNamuduri, Kameswaraen_US
dc.contributor.authorZaccagni, Zachary James
dc.date.accessioned2009-05-23T19:14:14Z
dc.date.available2009-05-23T19:14:14Z
dc.date.copyright2008en
dc.date.issued2008-08
dc.identifier.othert08052
dc.identifier.urihttp://hdl.handle.net/10057/2017
dc.descriptionThesis (M.S.)--Wichita State University, College of Engineering, Dept. of Computer Scienceen
dc.descriptionIncludes bibliographic references (leaves 56-57)en
dc.description.abstractThis research presents two methods for a group of Garcia robots to collaboratively decide which task to attend to, and to move to their respective locations. One method allows for a needed flexibility and dynamic analysis in this distributed system of any number of robots coupled with any number of target locations, but is tied too closely to distance measurements. The other method is the implementation of Peter Molnar’s approach, which is free from any specificity for determining preferences, but is shown to have some other limitations. The packet loss problem inherent of broadcast communications is addressed, as well. The robots make decisions interdependently with the other robots after the initial setup from a host computer of common environment variables such as a map, robot and target locations. A distributed network was established first for the robots so that information could be shared. Beacon messages were broadcasted at random intervals, while the robots handled TCP and UDP messages in separate threads. Once the needed data was acquired, each robot began their task scheduling decision-making process. If additional information was required from another robot still, a robot requested it. Our algorithm for task scheduling converged to an agreement rapidly, and resolved any possible gridlocks that occurred when two robots are exactly the same distance and with the highest preference for a single target. This method is found to be too closely tied into distance measures being used for preferences. Changes in the environment, such as new robots or targets, are handled during subsequent calls to decide for both methods. The result of this thesis shows two flexible and quick methods for task scheduling and assignment.en
dc.format.extentxi, 149 leaves, ill.en
dc.format.extent1670379 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen
dc.publisherWichita State Universityen
dc.rightsCopyright 2008 by Zachary James Zaccagni. All Rights Reserveden
dc.subject.lcshElectronic dissertationsen
dc.titleFlexible autonomous robotic task scheduling using advanced RISC machinesen
dc.typeThesisen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record