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 条
  • [11] Channel Allocation Scheme Based on Greedy Algorithm in Cognitive Vehicular Networks
    Li, Ruifang
    Zhu, PuSheng
    Jin, Lisha
    PROCEEDINGS OF 2019 IEEE 3RD INFORMATION TECHNOLOGY, NETWORKING, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (ITNEC 2019), 2019, : 803 - 807
  • [12] Approximation algorithm based on greedy approach for face recognition with partial occlusion
    Multimedia Tools and Applications, 2019, 78 : 27511 - 27531
  • [13] A dynamic task offloading algorithm based on greedy matching in vehicle network
    Tian, Shujuan
    Deng, Xianghong
    Chen, Pengpeng
    Pei, Tingrui
    Oh, Sangyoon
    Xue, Weiping
    AD HOC NETWORKS, 2021, 123
  • [14] Comparison of Purely Greedy and Orthogonal Greedy Algorithm
    Vishnevetskiy, K. S.
    MATHEMATICAL NOTES, 2024, 115 (1-2) : 37 - 43
  • [15] Tabu Search and Greedy Algorithm Adaptation to Logistic Task
    Musial, Kamil
    Kotowska, Joanna
    Gornicka, Dagmara
    Burduk, Anna
    COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL MANAGEMENT (CISIM 2017), 2017, 10244 : 39 - 49
  • [16] An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems
    Kang, Qinma
    He, Hong
    Wei, Jun
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2013, 73 (08) : 1106 - 1115
  • [17] Routing Metric Designs for Greedy, Face and Combined-Greedy-Face Routing
    Li, Yujun
    Yang, Yaling
    Lu, Xianliang
    IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 64 - +
  • [18] LF-GFG: Location-Free Greedy-Face-Greedy Routing With Guaranteed Delivery and Lightweight Maintenance Cost in a Wireless Sensor Network With Changing Topology
    Cheng, Yuan-Po
    Tang, Yao-Jen
    Tsai, Ming-Jer
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2014, 13 (12) : 7025 - 7036
  • [19] A Hop Count Based Greedy Face Greedy Routing Protocol on Localized Geometric Spanners
    Du, Jingzhe
    Kranakis, Evangelos
    Nayak, Amiya
    2009 FIFTH INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR NETWORKS, 2009, : 231 - +
  • [20] The thresholding greedy algorithm, greedy bases, and duality
    Dilworth, SJ
    Kalton, NJ
    Kutzarova, D
    Temlyakov, VN
    CONSTRUCTIVE APPROXIMATION, 2003, 19 (04) : 575 - 597
12345