Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/13579
Title: | Greedy extension of localized auction based protocols for wireless robot-robot coordination | Authors: | Mezei, Ivan Malbaša, Vuk Stojmenovic I. |
Issue Date: | 1-Dec-2009 | Journal: | SISY 2009 - 7th International Symposium on Intelligent Systems and Informatics | Abstract: | We assume that an event was reported to one of robots, and a response by one robot is required. The goal of robot-robot coordination for task assignment is to select the best robot for responding to a reported event so that communication cost for selecting, and response time for performing the task are minimized. Existing solutions, except those recently proposed in [3], are either centralized, neglecting communication cost, assuming complete graph, or based on flooding with individual responses to robot decision maker (simple auction protocol - SAP), ignoring communication cost and response time bound. This article proposes greedy improvement to previously proposed (in [3]) k-hop simple auction protocol (k-SAP) and k-hop simple auction aggregation protocol (k-SAAP) for task assignment in multi-hop wireless robot networks. After decision about the best robot is made by k-SAP or k-SAAP, new 1-SAP greedy auction is initiated by that robot in order to search for possibly better robot in 1-hop neighborhood. Such greedy approach proceeds until no better robot is found. Improvement of new k-SAPG and k-SAAPG over k-SAP and k-SAAP by applying greedy approach is shown by simulation results. © 2009 IEEE. | URI: | https://open.uns.ac.rs/handle/123456789/13579 | ISBN: | 9781424453498 | DOI: | 10.1109/SISY.2009.5291121 |
Appears in Collections: | FTN Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
3
checked on May 20, 2023
Page view(s)
21
Last Week
9
9
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.