Robot Task Allocation based on Greedy-Face-Greedy Algorithm

被引：1

作者：

Stanulovic, Jelena ^{[1
,2
]}

Mitton, Nathalie ^{[3
]}

Mezei, Ivan ^{[4
,5
]}

机构：

[1] Intel Austria Gmbh, Europastr 8, A-9500 Villach, Austria

[2] Univ Novi Sad, FTN, Trg Dositeja Obradovica 6, Novi Sad 21000, Serbia

[3] INRIA, Rocquencourt, France

[4] Univ Novi Sad, Fac Tech Sci, FTN, Trg Dositeja Obradovica 6, Novi Sad, Serbia

[5] UNSPMF, Fac Sci, Trg Dositeja Obradovica 3, Novi Sad 21000, Serbia

来源：

2019 27TH TELECOMMUNICATIONS FORUM (TELFOR 2019) | 2019年

基金：

欧盟地平线“2020”;

关键词：

face routing; GFG routing; greedy routing; wireless sensor and robot networks; AD HOC; DELIVERY;

D O I：

10.1109/telfor48224.2019.8971163

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

Two new algorithms (GFGF1 and GFGF2) for event finding in wireless sensor and robot networks based on the Greedy-Face-Greedy (GFG) routing are proposed in this paper. The purpose of finding the event (reported by sensors) is to allocate the task to the closest robot to act upon the event. Using two scenarios (event in or out of the network) and two topologies (random and random with hole) it is shown that GFGF1 always find the closest robot to the event but with more than twice higher communication cost compared to GFG, especially for the outside of the network scenario. GFGF2 features more than 4 times communication cost reduction compared to GFG but with percentage of finding the closest robot up to 90%.

引用

页码：213 / 216

页数：4

共 50 条

[41] Conical Greedy Algorithm
Valov, M. A.
MATHEMATICAL NOTES, 2022, 112 (1-2) : 171 - 176
[42] A framework for the greedy algorithm
Vince, A
DISCRETE APPLIED MATHEMATICS, 2002, 121 (1-3) : 247 - 260
[43] A NOTE ON THE GREEDY ALGORITHM
ALLINEY, S
BOLLETTINO DELLA UNIONE MATEMATICA ITALIANA, 1992, 6B (04): : 873 - 886
[44] A greedy algorithm for scheduling fork-join task graphs
Zhang, JJ
Ruan, YL
Li, QH
Yang, SD
2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, : 1969 - 1971
[45] Greedy algorithm with gaps
Oikhberg, T.
JOURNAL OF APPROXIMATION THEORY, 2018, 225 : 176 - 190
[46] Projection Greedy Algorithm
Borodin, P. A.
Konyagin, S. V.
MATHEMATICAL NOTES, 2021, 110 (1-2) : 16 - 25
[47] Enhanced Greedy Algorithm based Dynamic Subcarrier Allocation for Single Carrier FDMA Systems
Nwamadi, Obilor
Zhu, Xu
Nandi, Asoke K.
2009 IEEE WIRELESS COMMUNICATIONS & NETWORKING CONFERENCE, VOLS 1-5, 2009, : 335 - 340
[48] Model and approximation algorithm for dynamic wagon-flow allocation based on Greedy strategy
Guo, Rui
Guo, Jin
Su, Yuebin
Ma, Liang
Xinan Jiaotong Daxue Xuebao/Journal of Southwest Jiaotong University, 2014, 49 (04): : 712 - 719
[49] On the recursive greedy algorithm
Livshits, E. D.
IZVESTIYA MATHEMATICS, 2006, 70 (01) : 87 - 108
[50] Conical Greedy Algorithm
M. A. Valov
Mathematical Notes, 2022, 112 : 171 - 176

← 1 2 3 4 5 →