{"id":"https://openalex.org/W2152272310","doi":"https://doi.org/10.1109/wowmom.2008.4594888","title":"Towards autonomous data ferry route design through reinforcement learning","display_name":"Towards autonomous data ferry route design through reinforcement learning","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2152272310","doi":"https://doi.org/10.1109/wowmom.2008.4594888","mag":"2152272310"},"language":"en","primary_location":{"id":"doi:10.1109/wowmom.2008.4594888","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wowmom.2008.4594888","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","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/A5039562413","display_name":"Daniel Henkel","orcid":null},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Henkel","raw_affiliation_strings":["University of Colorado, Boulder, CO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Colorado, Boulder, CO, USA","institution_ids":["https://openalex.org/I188538660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091627069","display_name":"Timothy X. Brown","orcid":"https://orcid.org/0000-0002-0670-0935"},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Timothy X. Brown","raw_affiliation_strings":["University of Colorado, Boulder, CO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Colorado, Boulder, CO, USA","institution_ids":["https://openalex.org/I188538660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I188538660"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":1.0,"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":1.0,"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.9988999962806702,"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/T13553","display_name":"Age of Information Optimization","score":0.9977999925613403,"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/reinforcement-learning","display_name":"Reinforcement learning","score":0.8273191452026367},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7583535313606262},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.7409206628799438},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.7105939984321594},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5517020225524902},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5379515290260315},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4965844750404358},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.49009931087493896},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48031705617904663},{"id":"https://openalex.org/keywords/delay-tolerant-networking","display_name":"Delay-tolerant networking","score":0.46335840225219727},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4329751133918762},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4276618957519531},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.4012709856033325},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39913925528526306},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26904457807540894},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2012084722518921},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1435832679271698},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11716538667678833},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1093640923500061},{"id":"https://openalex.org/keywords/optimized-link-state-routing-protocol","display_name":"Optimized Link State Routing Protocol","score":0.09881711006164551},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07294997572898865},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.06982004642486572}],"concepts":[{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.8273191452026367},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7583535313606262},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.7409206628799438},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.7105939984321594},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5517020225524902},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5379515290260315},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4965844750404358},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.49009931087493896},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48031705617904663},{"id":"https://openalex.org/C53264328","wikidata":"https://www.wikidata.org/wiki/Q55320","display_name":"Delay-tolerant networking","level":5,"score":0.46335840225219727},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4329751133918762},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4276618957519531},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4012709856033325},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39913925528526306},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26904457807540894},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2012084722518921},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1435832679271698},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11716538667678833},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1093640923500061},{"id":"https://openalex.org/C204739117","wikidata":"https://www.wikidata.org/wiki/Q1368373","display_name":"Optimized Link State Routing Protocol","level":4,"score":0.09881711006164551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07294997572898865},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.06982004642486572},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wowmom.2008.4594888","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wowmom.2008.4594888","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1572481965","https://openalex.org/W1576452626","https://openalex.org/W1601974704","https://openalex.org/W2035446426","https://openalex.org/W2093897069","https://openalex.org/W2097625638","https://openalex.org/W2104269843","https://openalex.org/W2107493996","https://openalex.org/W2111630330","https://openalex.org/W2121863487","https://openalex.org/W2132283527","https://openalex.org/W2136420233","https://openalex.org/W2400458653","https://openalex.org/W2489939061","https://openalex.org/W4214717370","https://openalex.org/W4298856952","https://openalex.org/W6634082847","https://openalex.org/W6635991215"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2054495636","https://openalex.org/W4306878646","https://openalex.org/W2164188042","https://openalex.org/W3005108979","https://openalex.org/W187740018","https://openalex.org/W2162286586","https://openalex.org/W4255368532"],"abstract_inverted_index":{"Communication":[0],"in":[1,39,50],"delay":[2,38,125],"tolerant":[3],"networks":[4],"can":[5],"be":[6],"facilitated":[7],"by":[8],"the":[9,27,35,40,57,64,86,96,109,118],"use":[10],"of":[11],"dedicated":[12],"mobile":[13],"ldquoferriesrdquo":[14],"which":[15,33,46],"physically":[16],"transport":[17],"data":[18],"packets":[19],"between":[20],"network":[21],"nodes.":[22],"The":[23],"goal":[24],"is":[25],"for":[26],"ferry":[28,73,97,110],"to":[29,56,107,111,129],"autonomously":[30],"find":[31],"routes":[32,120],"minimize":[34],"average":[36,66,123],"packet":[37,67,124],"network.":[41],"We":[42,69,84,103],"prove":[43],"that":[44],"paths":[45],"visit":[47],"all":[48],"nodes":[49],"a":[51,91],"round-trip":[52],"fashion,":[53],"i.e.,":[54],"solutions":[55,127],"traveling":[58],"salesman":[59],"problem,":[60],"do":[61],"not":[62],"yield":[63],"lowest":[65],"delay.":[68],"propose":[70],"two":[71],"novel":[72],"path":[74,87],"planning":[75,88],"algorithms":[76],"based":[77],"on":[78],"stochastic":[79],"modeling":[80],"and":[81],"machine":[82],"learning.":[83],"model":[85],"task":[89],"as":[90,99],"Markov":[92],"decision":[93],"process":[94],"with":[95],"acting":[98],"an":[100],"independent":[101],"agent.":[102],"apply":[104],"reinforcement":[105],"learning":[106],"enable":[108],"make":[112],"optimal":[113],"decisions.":[114],"Simulation":[115],"experiments":[116],"show":[117],"resulting":[119],"have":[121],"lower":[122],"than":[126],"known":[128],"date.":[130]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}