{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81870"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81870","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Market-Based Coordination and Auditing Mechanisms for Self-Interested Multi-Robot Systems","abstract":"We conduct both physical robot experiments and software agent simulations for the coordinated task allocation mechanisms. The experimental results suggest that the proposed mechanisms are scalable and fault-tolerant and work in physical robot systems. We compare the proposed methods to control methods with various performance metrics and the results suggest that the performance can be enhanced by the proposed approaches. We observe and analyze issues such as deadlock, pingpong-bidding, pingpong-swapping, and others. We analyze the auditing mechanism with mathematical analysis and software simulations on the behavior of the mechanism. The results from both analysis and simulations suggest that the auditing mechanism can detect cheating attempts with high probability without excessive communication overheads in various conditions. We also suggest an adaptive mechanism to be included in the auditing mechanism so that each robot or peer can tune the communication overheads and detection probability according to the dynamic environments. The analysis and simulations of the evolutionary game theory on the behaviors of peers or robots suggest that the auditing mechanism can discourage free-riding and cheating attempts effectively without harming the popularity of systems with auditing mechanisms. The analysis shows that a strategy where nodes behave honestly and contribute properly is evolutionarily stable and the simulations show that such a strategy takes the dominance even if the strategy had minor initial population.","abstract_html":"We conduct both physical robot experiments and software agent simulations for the coordinated task allocation mechanisms. The experimental results suggest that the proposed mechanisms are scalable and fault-tolerant and work in physical robot systems. We compare the proposed methods to control methods with various performance metrics and the results suggest that the performance can be enhanced by the proposed approaches. We observe and analyze issues such as deadlock, pingpong-bidding, pingpong-swapping, and others. We analyze the auditing mechanism with mathematical analysis and software simulations on the behavior of the mechanism. The results from both analysis and simulations suggest that the auditing mechanism can detect cheating attempts with high probability without excessive communication overheads in various conditions. We also suggest an adaptive mechanism to be included in the auditing mechanism so that each robot or peer can tune the communication overheads and detection probability according to the dynamic environments. The analysis and simulations of the evolutionary game theory on the behaviors of peers or robots suggest that the auditing mechanism can discourage free-riding and cheating attempts effectively without harming the popularity of systems with auditing mechanisms. The analysis shows that a strategy where nodes behave honestly and contribute properly is evolutionarily stable and the simulations show that such a strategy takes the dominance even if the strategy had minor initial population.","abstract_has_math":false,"creators":["Ham, MyungJoo"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Agha, Gul A."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:20:46Z","date_published":"2015-09-25T20:20:46Z","updated_at":"2026-07-22T22:26:17Z","subjects":["Engineering, Robotics"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3395570"],"render_values":[{"text":"(MiAaPQ)AAI3395570","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81870","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Agha, Gul A."]},{"key":"dc:creator","label":"Author","values":["Ham, MyungJoo"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:20:46Z","10000-01-01","2009"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, Robotics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81870","(MiAaPQ)AAI3395570"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We conduct both physical robot experiments and software agent simulations for the coordinated task allocation mechanisms. The experimental results suggest that the proposed mechanisms are scalable and fault-tolerant and work in physical robot systems. We compare the proposed methods to control methods with various performance metrics and the results suggest that the performance can be enhanced by the proposed approaches. We observe and analyze issues such as deadlock, pingpong-bidding, pingpong-swapping, and others. We analyze the auditing mechanism with mathematical analysis and software simulations on the behavior of the mechanism. The results from both analysis and simulations suggest that the auditing mechanism can detect cheating attempts with high probability without excessive communication overheads in various conditions. We also suggest an adaptive mechanism to be included in the auditing mechanism so that each robot or peer can tune the communication overheads and detection probability according to the dynamic environments. The analysis and simulations of the evolutionary game theory on the behaviors of peers or robots suggest that the auditing mechanism can discourage free-riding and cheating attempts effectively without harming the popularity of systems with auditing mechanisms. The analysis shows that a strategy where nodes behave honestly and contribute properly is evolutionarily stable and the simulations show that such a strategy takes the dominance even if the strategy had minor initial population.","Made available in DSpace on 2015-09-25T20:20:46Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3395570.pdf: 6086699 bytes, checksum: 8aefcbb4a4a00125fd097ecd363ee801 (MD5) Previous issue date: 2009","Embargo set by: Seth Robbins for item 83151 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","119 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009."]},{"key":"dc:title","label":"Title","values":["Market-Based Coordination and Auditing Mechanisms for Self-Interested Multi-Robot Systems"]}]}],"canonical_facts":{"dc:contributor":["Agha, Gul A."],"dc:creator":["Ham, MyungJoo"],"dc:date":["2015-09-25T20:20:46Z","10000-01-01","2009"],"dc:description":["We conduct both physical robot experiments and software agent simulations for the coordinated task allocation mechanisms. The experimental results suggest that the proposed mechanisms are scalable and fault-tolerant and work in physical robot systems. We compare the proposed methods to control methods with various performance metrics and the results suggest that the performance can be enhanced by the proposed approaches. We observe and analyze issues such as deadlock, pingpong-bidding, pingpong-swapping, and others. We analyze the auditing mechanism with mathematical analysis and software simulations on the behavior of the mechanism. The results from both analysis and simulations suggest that the auditing mechanism can detect cheating attempts with high probability without excessive communication overheads in various conditions. We also suggest an adaptive mechanism to be included in the auditing mechanism so that each robot or peer can tune the communication overheads and detection probability according to the dynamic environments. The analysis and simulations of the evolutionary game theory on the behaviors of peers or robots suggest that the auditing mechanism can discourage free-riding and cheating attempts effectively without harming the popularity of systems with auditing mechanisms. The analysis shows that a strategy where nodes behave honestly and contribute properly is evolutionarily stable and the simulations show that such a strategy takes the dominance even if the strategy had minor initial population.","Made available in DSpace on 2015-09-25T20:20:46Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3395570.pdf: 6086699 bytes, checksum: 8aefcbb4a4a00125fd097ecd363ee801 (MD5) Previous issue date: 2009","Embargo set by: Seth Robbins for item 83151 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","119 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009."],"dc:identifier":["http://hdl.handle.net/2142/81870","(MiAaPQ)AAI3395570"],"dc:language":["eng"],"dc:subject":["Engineering, Robotics"],"dc:title":["Market-Based Coordination and Auditing Mechanisms for Self-Interested Multi-Robot Systems"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:17Z"}