{"id":"https://openalex.org/W4236241812","doi":"https://doi.org/10.1109/ecmr.2017.8098693","title":"Algorithms for limited-buffer shortest path problems in communication-restricted environments","display_name":"Algorithms for limited-buffer shortest path problems in communication-restricted environments","publication_year":2017,"publication_date":"2017-09-01","ids":{"openalex":"https://openalex.org/W4236241812","doi":"https://doi.org/10.1109/ecmr.2017.8098693"},"language":"en","primary_location":{"id":"doi:10.1109/ecmr.2017.8098693","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecmr.2017.8098693","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 European Conference on Mobile Robots (ECMR)","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/A5038958521","display_name":"Alessandro Riva","orcid":null},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alessandro Riva","raw_affiliation_strings":["Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008552962","display_name":"Jacopo Banfi","orcid":"https://orcid.org/0000-0001-9660-4869"},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Jacopo Banfi","raw_affiliation_strings":["Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091548678","display_name":"Arlind Rufi","orcid":null},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Arlind Rufi","raw_affiliation_strings":["Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028729032","display_name":"Francesco Amigoni","orcid":"https://orcid.org/0000-0001-8146-6213"},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesco Amigoni","raw_affiliation_strings":["Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy","institution_ids":["https://openalex.org/I93860229"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I93860229"],"apc_list":null,"apc_paid":null,"fwci":0.4496,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60572614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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.9914000034332275,"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/T11498","display_name":"Security in Wireless Sensor Networks","score":0.982699990272522,"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/computer-science","display_name":"Computer science","score":0.7820998430252075},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6529477834701538},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6482221484184265},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6341030597686768},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5901775360107422},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.43928828835487366},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.38279443979263306},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3176792860031128},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22068914771080017},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17857801914215088},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09865203499794006}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7820998430252075},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6529477834701538},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6482221484184265},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6341030597686768},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5901775360107422},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.43928828835487366},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38279443979263306},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3176792860031128},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22068914771080017},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17857801914215088},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09865203499794006}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ecmr.2017.8098693","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecmr.2017.8098693","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 European Conference on Mobile Robots (ECMR)","raw_type":"proceedings-article"},{"id":"pmh:oai:re.public.polimi.it:11311/1039636","is_oa":false,"landing_page_url":"http://hdl.handle.net/11311/1039636","pdf_url":null,"source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W311217234","https://openalex.org/W1424654272","https://openalex.org/W1935926926","https://openalex.org/W2002792327","https://openalex.org/W2003282559","https://openalex.org/W2003808711","https://openalex.org/W2011039300","https://openalex.org/W2037034267","https://openalex.org/W2130626677","https://openalex.org/W2143376550","https://openalex.org/W2169528473","https://openalex.org/W2253376374","https://openalex.org/W2296618433","https://openalex.org/W2566869048","https://openalex.org/W2808979013","https://openalex.org/W3170972998","https://openalex.org/W6691605879","https://openalex.org/W6752935761"],"related_works":["https://openalex.org/W8302103","https://openalex.org/W3171631314","https://openalex.org/W3118505512","https://openalex.org/W2674584172","https://openalex.org/W2967743314","https://openalex.org/W2606825221","https://openalex.org/W2184085865","https://openalex.org/W2064245428","https://openalex.org/W2170721890","https://openalex.org/W2122871747"],"abstract_inverted_index":{"In":[0,91],"several":[1],"applications,":[2],"a":[3,7,10,22,26,37,75,80,100,124,156],"robot":[4,30,115],"moving":[5],"from":[6],"start":[8],"to":[9,15,42,49,53,74,110,139],"goal":[11],"location":[12],"is":[13,87,133],"required":[14],"gather":[16],"data":[17,57,73,138],"along":[18,118],"its":[19,34,119],"path":[20,105],"(e.g.,":[21],"video":[23],"feed":[24],"in":[25,47,85],"monitoring":[27],"scenario).":[28],"The":[29],"can":[31],"have":[32],"at":[33],"disposal":[35],"only":[36],"limited":[38,125],"amount":[39],"of":[40,62,69,102],"memory":[41,126],"store":[43],"the":[44,60,67,72,103,114,140],"collected":[45],"data,":[46],"order":[48],"contain":[50],"costs":[51],"or":[52],"avoid":[54],"that":[55,130],"sensible":[56],"fall":[58],"into":[59,123],"hands":[61],"an":[63,146,151],"attacker.":[64],"This":[65],"poses":[66],"need":[68],"periodically":[70,136],"delivering":[71],"Base":[76],"Station":[77],"(BS)":[78],"through":[79],"deployed":[81],"communication":[82],"infrastructure":[83],"that,":[84],"general,":[86],"not":[88],"available":[89],"everywhere.":[90],"this":[92,96],"paper,":[93],"we":[94,108],"study":[95],"scenario":[97],"by":[98,135],"considering":[99],"variant":[101],"shortest":[104],"problem":[106],"(which":[107],"prove":[109],"be":[111],"NP-hard)":[112],"where":[113],"acquires":[116],"information":[117,132],"path,":[120],"stores":[121],"it":[122],"buffer,":[127],"and":[128,144,155],"ensures":[129],"no":[131],"lost":[134],"communicating":[137],"BS.":[141],"We":[142],"present":[143],"evaluate":[145],"optimal":[147],"exponential":[148],"time":[149,158],"algorithm,":[150],"efficient":[152],"feasibility":[153],"test,":[154],"polynomial":[157],"heuristic":[159],"algorithm.":[160]},"counts_by_year":[{"year":2019,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}