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 条
  • [31] Performance of the Thresholding Greedy Algorithm with larger greedy sums
    Chu, Hung Viet
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2023, 525 (01)
  • [32] Rules of Designing Routing Metrics for Greedy, Face, and Combined Greedy-Face Routing
    Li, Yujun
    Yang, Yaling
    Lu, Xianliang
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2010, 9 (04) : 582 - 595
  • [33] Comparison of Pure Greedy Algorithm with Pure Greedy Algorithm in a Pair of Dictionaries
    Orlova, A. S.
    MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2023, 78 (02) : 57 - 66
  • [34] Bayesian Inference and Greedy Task Allocation for Edge Computing Systems with Uncertainty
    Kong, Linglin
    Shum, Kenneth W.
    Sung, Chi Wan
    ICC 2023-IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2023, : 2798 - 2803
  • [35] Greedy algorithm for dynamic resource allocation in downlink of OFDMA system
    Najeh, S
    Besbes, H
    Bouallègue, A
    2ND INTERNATIONAL SYMPOSIUM ON WIRELESS COMMUNICATIONS SYSTEMS 2005 (ISWCS 2005), 2005, : 475 - 479
  • [36] Carousel greedy: A generalized greedy algorithm with applications in optimization
    Cerrone, Carmine
    Cerulli, Raffaele
    Golden, Bruce
    COMPUTERS & OPERATIONS RESEARCH, 2017, 85 : 97 - 112
  • [37] Comparison of Pure Greedy Algorithm with Pure Greedy Algorithm in a Pair of Dictionaries
    A. S. Orlova
    Moscow University Mathematics Bulletin, 2023, 78 : 57 - 66
  • [38] A Greedy Algorithm for Task Offloading in Mobile Edge Computing System
    Feng Wei
    Sixuan Chen
    Weixia Zou
    中国通信, 2018, 15 (11) : 149 - 157
  • [39] A Greedy Algorithm for Task Offloading in Mobile Edge Computing System
    Wei, Feng
    Chen, Sixuan
    Zou, Weixia
    CHINA COMMUNICATIONS, 2018, 15 (11) : 149 - 157
  • [40] Optimal Bit and Power Direct Allocation Algorithm in OFDM Systems Based on the Regularity of Greedy Allocation Result
    Zheng, Laibo
    Stueber, Gordon L.
    Wang, Deqiang
    Cao, Yewen
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2012, 11 (09) : 3388 - 3397
12345