{"id":"https://openalex.org/W2892285963","doi":"https://doi.org/10.1109/ict.2018.8464849","title":"Efficient Scheduling for Planned Robot Networks","display_name":"Efficient Scheduling for Planned Robot Networks","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2892285963","doi":"https://doi.org/10.1109/ict.2018.8464849","mag":"2892285963"},"language":"en","primary_location":{"id":"doi:10.1109/ict.2018.8464849","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ict.2018.8464849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 25th International Conference on Telecommunications (ICT)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065512344","display_name":"Farid Benbadis","orcid":null},"institutions":[{"id":"https://openalex.org/I4210140930","display_name":"Thales (France)","ror":"https://ror.org/04emwm605","country_code":"FR","type":"company","lineage":["https://openalex.org/I4210140930"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Farid Benbadis","raw_affiliation_strings":["Thales communications & Security Gennevilliers, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Thales communications & Security Gennevilliers, France","institution_ids":["https://openalex.org/I4210140930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061273994","display_name":"Hicham Khalif\u00e9","orcid":null},"institutions":[{"id":"https://openalex.org/I4210140930","display_name":"Thales (France)","ror":"https://ror.org/04emwm605","country_code":"FR","type":"company","lineage":["https://openalex.org/I4210140930"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Hicham Khalife","raw_affiliation_strings":["Thales communications & Security Gennevilliers, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Thales communications & Security Gennevilliers, France","institution_ids":["https://openalex.org/I4210140930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005394112","display_name":"Catherine Lamy\u2013Bergot","orcid":"https://orcid.org/0000-0001-7525-074X"},"institutions":[{"id":"https://openalex.org/I4210140930","display_name":"Thales (France)","ror":"https://ror.org/04emwm605","country_code":"FR","type":"company","lineage":["https://openalex.org/I4210140930"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Catherine Lamy-Bergot","raw_affiliation_strings":["Thales communications & Security Gennevilliers, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Thales communications & Security Gennevilliers, France","institution_ids":["https://openalex.org/I4210140930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210140930"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09782931,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":null,"first_page":"319","last_page":"323"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/patrolling","display_name":"Patrolling","score":0.890539288520813},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7782703638076782},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.660711944103241},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5879989862442017},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5149974822998047},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5107994079589844},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5046602487564087},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4809119701385498},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4670146107673645},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3390875458717346},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.1129300594329834},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10986000299453735},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10514026880264282},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.08242493867874146}],"concepts":[{"id":"https://openalex.org/C110698143","wikidata":"https://www.wikidata.org/wiki/Q651389","display_name":"Patrolling","level":2,"score":0.890539288520813},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7782703638076782},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.660711944103241},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5879989862442017},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5149974822998047},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5107994079589844},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5046602487564087},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4809119701385498},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4670146107673645},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3390875458717346},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.1129300594329834},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10986000299453735},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10514026880264282},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.08242493867874146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ict.2018.8464849","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ict.2018.8464849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 25th International Conference on Telecommunications (ICT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1982459859","https://openalex.org/W1989667750","https://openalex.org/W2026768864","https://openalex.org/W2097177265","https://openalex.org/W2127617835","https://openalex.org/W2143818739","https://openalex.org/W2157503093","https://openalex.org/W2161723303","https://openalex.org/W2273515758","https://openalex.org/W2539096940","https://openalex.org/W2582115406","https://openalex.org/W4234068324","https://openalex.org/W6647706458","https://openalex.org/W6674760131","https://openalex.org/W6677266452","https://openalex.org/W6683563753"],"related_works":["https://openalex.org/W170273588","https://openalex.org/W2337788814","https://openalex.org/W2092973197","https://openalex.org/W2404411151","https://openalex.org/W2163146706","https://openalex.org/W3206391274","https://openalex.org/W167683769","https://openalex.org/W2332242917","https://openalex.org/W2095900292","https://openalex.org/W2149245348"],"abstract_inverted_index":{"We":[0],"propose":[1],"in":[2,34,79,103],"this":[3],"paper":[4],"a":[5,21,38,80],"scheduling":[6,58],"solution":[7,25,92],"for":[8,41,109],"networks":[9],"of":[10,18,30,69,90],"autonomous":[11],"robots":[12],"that":[13,45,120],"exploits":[14],"the":[15,27,42,62,66,76,128],"store-and-forward":[16],"capability":[17],"nodes":[19],"during":[20],"patrolling":[22],"mission.":[23],"Our":[24],"leverages":[26],"deterministic":[28],"behavior":[29],"these":[31],"mobile":[32],"vehicles":[33],"order":[35,104],"to":[36,49,74,82,97,105,133],"construct":[37],"connectivity":[39],"graph":[40],"whole":[43],"mission":[44],"will":[46],"be":[47],"exploited":[48],"schedule":[50],"communications":[51,102],"requests":[52],"upon":[53],"their":[54],"arrival.":[55],"Then":[56],"our":[57,91,123],"algorithm,":[59],"based":[60],"on":[61],"capacity":[63,96],"demand":[64],"and":[65,135],"priority":[67,100,137],"level":[68],"each":[70],"demand,":[71],"is":[72],"able":[73],"place":[75],"arriving":[77,111],"request":[78],"way":[81],"guarantee":[83],"its":[84,95],"delivery":[85],"deadline.":[86],"A":[87],"key":[88],"feature":[89],"stems":[93],"from":[94],"preempt":[98],"lower":[99,136],"ongoing":[101],"create":[106],"enough":[107],"space":[108],"newly":[110],"ones":[112],"with":[113],"higher":[114],"priority.":[115],"Through":[116],"simulations,":[117],"we":[118,125],"show":[119],"by":[121,131,140],"using":[122],"solution,":[124],"can":[126],"increase":[127],"conveyed":[129],"traffic":[130,138],"up":[132],"40%":[134],"amount":[139],"10%.":[141]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}