Show simple item record

The use of abstraction in coordinating artificially intelligent agents.

dc.contributor.authorMontgomery, Thomas Anthonyen_US
dc.contributor.advisorDurfee, Edmund H.en_US
dc.date.accessioned2014-02-24T16:15:06Z
dc.date.available2014-02-24T16:15:06Z
dc.date.issued1993en_US
dc.identifier.other(UMI)AAI9319590en_US
dc.identifier.urihttp://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:9319590en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/103458
dc.description.abstractThe coordination of networked computer systems (and of other distributed intelligent agents) is becoming an increasingly important area of research. By viewing the process of coordination as a distributed search, we are able to adapt recent research on search--and how its complexity can be reduced through the use of abstraction--to the coordination of intelligent agents. We do this using a framework which allows our intelligent agents to reason and communicate at multiple levels of abstraction. Communication is necessary in a distributed search since each agent only searches a fraction of the overall space. By beginning dialogues at an abstract level, our intelligent agents can reduce the amount of information that they must communicate when coordinating their actions. Any reduction in information exchanged that is accomplished by this hierarchical communication reduces both the transmission load on the communication medium, and the processing load on the agents. However, since there is some overhead associated with sending abstract information, we describe the circumstances under which hierarchical communication results in the transmission of less information than the brute force approach of exchanging all details. Extending hierarchical communication to the level of teams of agents, and allowing the teams to negotiate in parallel, makes further efficiency gains possible. In general, the combined effects of parallelism and abstraction can reduce the complexity of an exponential search to logarithmic time. By recognizing that a hierarchical organization of teams of agents can map onto more common abstraction hierarchies in search, we are able to show how this complexity reduction can be applied to the coordination problem. We validate our analysis through empirical results at both the task-level (in the Towers of Hanoi problem domain) and meta-level (in the coordination of robots in a delivery task). Since this research requires the distinctions between schedules, plans, and organizations to be blurred, it is a step toward an interdisciplinary study of coordination that includes such diverse fields as operations research, artificial intelligence, and organization theory.en_US
dc.format.extent190 p.en_US
dc.subjectArtificial Intelligenceen_US
dc.subjectComputer Scienceen_US
dc.titleThe use of abstraction in coordinating artificially intelligent agents.en_US
dc.typeThesisen_US
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineComputer Science and Engineeringen_US
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studiesen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/103458/1/9319590.pdf
dc.description.filedescriptionDescription of 9319590.pdf : Restricted to UM users only.en_US
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.