{"id":"https://openalex.org/W3146429287","doi":"https://doi.org/10.1109/lra.2021.3068935","title":"Optimizing Non-Markovian Information Gain Under Physics-Based Communication Constraints","display_name":"Optimizing Non-Markovian Information Gain Under Physics-Based Communication Constraints","publication_year":2021,"publication_date":"2021-03-25","ids":{"openalex":"https://openalex.org/W3146429287","doi":"https://doi.org/10.1109/lra.2021.3068935","mag":"3146429287"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2021.3068935","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2021.3068935","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},"type":"article","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/A5032074517","display_name":"Matthew A. Schack","orcid":"https://orcid.org/0000-0001-5877-2028"},"institutions":[{"id":"https://openalex.org/I167576493","display_name":"Colorado School of Mines","ror":"https://ror.org/04raf6v53","country_code":"US","type":"education","lineage":["https://openalex.org/I167576493"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew A. Schack","raw_affiliation_strings":["Department of Computer Science, Colorado School of Mines, Littleton, CO, USA"],"raw_orcid":"https://orcid.org/0000-0001-5877-2028","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Colorado School of Mines, Littleton, CO, USA","institution_ids":["https://openalex.org/I167576493"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101870284","display_name":"John G. Rogers","orcid":"https://orcid.org/0000-0002-6074-0823"},"institutions":[{"id":"https://openalex.org/I166416128","display_name":"DEVCOM Army Research Laboratory","ror":"https://ror.org/011hc8f90","country_code":"US","type":"government","lineage":["https://openalex.org/I1304082316","https://openalex.org/I1330347796","https://openalex.org/I166416128","https://openalex.org/I2802705668","https://openalex.org/I4210154437"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John G. Rogers","raw_affiliation_strings":["United States Army Research Laboratory, Adelphi, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"United States Army Research Laboratory, Adelphi, MD, USA","institution_ids":["https://openalex.org/I166416128"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101494992","display_name":"Qi Han","orcid":"https://orcid.org/0000-0002-5856-383X"},"institutions":[{"id":"https://openalex.org/I167576493","display_name":"Colorado School of Mines","ror":"https://ror.org/04raf6v53","country_code":"US","type":"education","lineage":["https://openalex.org/I167576493"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qi Han","raw_affiliation_strings":["Department of Computer Science, Colorado School of Mines, Littleton, CO, USA"],"raw_orcid":"https://orcid.org/0000-0002-5856-383X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Colorado School of Mines, Littleton, CO, USA","institution_ids":["https://openalex.org/I167576493"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029447901","display_name":"Neil T. Dantam","orcid":"https://orcid.org/0000-0002-0907-2241"},"institutions":[{"id":"https://openalex.org/I167576493","display_name":"Colorado School of Mines","ror":"https://ror.org/04raf6v53","country_code":"US","type":"education","lineage":["https://openalex.org/I167576493"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neil Dantam","raw_affiliation_strings":["Department of Computer Science, Colorado School of Mines, Littleton, CO, USA"],"raw_orcid":"https://orcid.org/0000-0002-0907-2241","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Colorado School of Mines, Littleton, CO, USA","institution_ids":["https://openalex.org/I167576493"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5423,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.62137146,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":97},"biblio":{"volume":"6","issue":"3","first_page":"4813","last_page":"4819"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10249","display_name":"Distributed Control Multi-Agent Systems","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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/information-gain","display_name":"Information gain","score":0.6927700638771057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6070131659507751},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5587612986564636},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5246613025665283},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5038625597953796},{"id":"https://openalex.org/keywords/classification-of-discontinuities","display_name":"Classification of discontinuities","score":0.4978506565093994},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.49241411685943604},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4764300286769867},{"id":"https://openalex.org/keywords/interaction-information","display_name":"Interaction information","score":0.44346883893013},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4398070275783539},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42957425117492676},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4242866635322571},{"id":"https://openalex.org/keywords/baseline","display_name":"Baseline (sea)","score":0.42168113589286804},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.401662141084671},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2796518802642822},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.24833598732948303},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2248533070087433}],"concepts":[{"id":"https://openalex.org/C2983203078","wikidata":"https://www.wikidata.org/wiki/Q255166","display_name":"Information gain","level":2,"score":0.6927700638771057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6070131659507751},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5587612986564636},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5246613025665283},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5038625597953796},{"id":"https://openalex.org/C15627037","wikidata":"https://www.wikidata.org/wiki/Q541961","display_name":"Classification of discontinuities","level":2,"score":0.4978506565093994},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.49241411685943604},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4764300286769867},{"id":"https://openalex.org/C38764148","wikidata":"https://www.wikidata.org/wiki/Q17098245","display_name":"Interaction information","level":2,"score":0.44346883893013},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4398070275783539},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42957425117492676},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4242866635322571},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.42168113589286804},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.401662141084671},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2796518802642822},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.24833598732948303},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2248533070087433},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C127313418","wikidata":"https://www.wikidata.org/wiki/Q1069","display_name":"Geology","level":0,"score":0.0},{"id":"https://openalex.org/C111368507","wikidata":"https://www.wikidata.org/wiki/Q43518","display_name":"Oceanography","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2021.3068935","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2021.3068935","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W1488303885","https://openalex.org/W1562003885","https://openalex.org/W1587069062","https://openalex.org/W1950970151","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W1974676331","https://openalex.org/W2004139909","https://openalex.org/W2019965290","https://openalex.org/W2023292064","https://openalex.org/W2039216363","https://openalex.org/W2058006523","https://openalex.org/W2059061256","https://openalex.org/W2060799405","https://openalex.org/W2063801303","https://openalex.org/W2070113904","https://openalex.org/W2075675490","https://openalex.org/W2075793174","https://openalex.org/W2099893201","https://openalex.org/W2110762409","https://openalex.org/W2112294828","https://openalex.org/W2115842933","https://openalex.org/W2135524320","https://openalex.org/W2141664020","https://openalex.org/W2142224528","https://openalex.org/W2146158437","https://openalex.org/W2147125977","https://openalex.org/W2161076907","https://openalex.org/W2165718261","https://openalex.org/W2283534560","https://openalex.org/W2483480475","https://openalex.org/W2495871221","https://openalex.org/W2544195598","https://openalex.org/W2621460277","https://openalex.org/W2773205132","https://openalex.org/W2807539957","https://openalex.org/W2911679274","https://openalex.org/W2939777172","https://openalex.org/W2967029387","https://openalex.org/W2973864946","https://openalex.org/W3100948105","https://openalex.org/W6605295560","https://openalex.org/W6629359923","https://openalex.org/W6635324423","https://openalex.org/W6683620479","https://openalex.org/W7005955626"],"related_works":["https://openalex.org/W2050283641","https://openalex.org/W4313429060","https://openalex.org/W181490901","https://openalex.org/W2954668464","https://openalex.org/W4367692293","https://openalex.org/W2347586617","https://openalex.org/W4205619203","https://openalex.org/W2008794359","https://openalex.org/W4287553507","https://openalex.org/W3111660818"],"abstract_inverted_index":{"In":[0],"many":[1],"exploration":[2],"scenarios,":[3],"it":[4],"is":[5,43,59],"important":[6],"for":[7],"robots":[8,19,93],"to":[9,27,62,90,101,105],"efficiently":[10],"explore":[11],"new":[12],"areas":[13],"and":[14,23,73,84,94],"constantly":[15],"communicate":[16],"results.":[17],"Mobile":[18],"inherently":[20],"couple":[21],"motion":[22],"network":[24,39,71],"topology":[25],"due":[26,61],"the":[28,63],"effects":[29],"of":[30,47,66],"position":[31],"on":[32],"wireless":[33],"propagation-e.g.":[34],"distance":[35],"or":[36],"obstacles":[37],"between":[38],"nodes.":[40],"Information":[41],"gain":[42,55],"a":[44],"useful":[45],"measure":[46],"exploration.":[48],"However,":[49],"finding":[50],"paths":[51],"that":[52],"maximize":[53],"information":[54,67,99],"while":[56],"preserving":[57],"communication":[58],"challenging":[60],"non-Markovian":[64],"nature":[65],"gain,":[68],"discontinuities":[69],"in":[70],"topology,":[72],"zero-reward":[74],"local":[75],"optima.":[76],"We":[77],"address":[78],"these":[79],"challenges":[80],"through":[81],"an":[82],"optimization":[83],"sampling-based":[85],"algorithm.":[86],"Our":[87],"algorithm":[88],"scales":[89],"50%":[91],"more":[92,98],"obtains":[95],"2-5":[96],"times":[97],"relative":[100],"path":[102],"cost":[103],"compared":[104],"baseline":[106],"planning":[107],"approaches.":[108]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}