{"id":"https://openalex.org/W2889564040","doi":"https://doi.org/10.1109/icra.2018.8460652","title":"Topological Hotspot Identification for Informative Path Planning with a Marine Robot","display_name":"Topological Hotspot Identification for Informative Path Planning with a Marine Robot","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2889564040","doi":"https://doi.org/10.1109/icra.2018.8460652","mag":"2889564040"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2018.8460652","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8460652","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Automation (ICRA)","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/A5062751548","display_name":"Seth McCammon","orcid":"https://orcid.org/0000-0002-9004-989X"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seth McCammon","raw_affiliation_strings":["Collaborative Robotics and Intelligent Systems (CoRIS) Institute, Oregon State University, Corvallis, OR"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Collaborative Robotics and Intelligent Systems (CoRIS) Institute, Oregon State University, Corvallis, OR","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023976625","display_name":"Geoffrey A. Hollinger","orcid":"https://orcid.org/0000-0001-6502-8950"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Geoffrey A. Hollinger","raw_affiliation_strings":["Collaborative Robotics and Intelligent Systems (CoRIS) Institute, Oregon State University, Corvallis, OR"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Collaborative Robotics and Intelligent Systems (CoRIS) Institute, Oregon State University, Corvallis, OR","institution_ids":["https://openalex.org/I131249849"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I131249849"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4865","last_page":"4872"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11192","display_name":"Underwater Vehicles and Communication Systems","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11192","display_name":"Underwater Vehicles and Communication Systems","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9945999979972839,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/motion-planning","display_name":"Motion planning","score":0.7293846607208252},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6562147736549377},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5803724527359009},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.5459782481193542},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.5379512906074524},{"id":"https://openalex.org/keywords/topological-map","display_name":"Topological map","score":0.5026004314422607},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4895952343940735},{"id":"https://openalex.org/keywords/segmentation","display_name":"Segmentation","score":0.4531947374343872},{"id":"https://openalex.org/keywords/thresholding","display_name":"Thresholding","score":0.44085994362831116},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.43547219038009644},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4309951961040497},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4193163216114044},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4071160852909088},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3661642372608185},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.3632076382637024},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35872572660446167},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3558398187160492},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27212825417518616},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25565171241760254},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09256678819656372}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7293846607208252},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6562147736549377},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5803724527359009},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.5459782481193542},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.5379512906074524},{"id":"https://openalex.org/C199538142","wikidata":"https://www.wikidata.org/wiki/Q573980","display_name":"Topological map","level":4,"score":0.5026004314422607},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4895952343940735},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.4531947374343872},{"id":"https://openalex.org/C191178318","wikidata":"https://www.wikidata.org/wiki/Q2256906","display_name":"Thresholding","level":3,"score":0.44085994362831116},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.43547219038009644},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4309951961040497},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4193163216114044},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4071160852909088},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3661642372608185},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.3632076382637024},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35872572660446167},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3558398187160492},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27212825417518616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25565171241760254},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09256678819656372},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2018.8460652","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8460652","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/14","score":0.8399999737739563,"display_name":"Life below water"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320311401","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W301805053","https://openalex.org/W637527836","https://openalex.org/W1238092070","https://openalex.org/W1525030250","https://openalex.org/W1837811515","https://openalex.org/W1967005434","https://openalex.org/W2018020586","https://openalex.org/W2019965290","https://openalex.org/W2030021468","https://openalex.org/W2053460888","https://openalex.org/W2069277547","https://openalex.org/W2100269650","https://openalex.org/W2113873983","https://openalex.org/W2124294571","https://openalex.org/W2142501961","https://openalex.org/W2146500120","https://openalex.org/W2212622954","https://openalex.org/W2410369356","https://openalex.org/W2569196086","https://openalex.org/W6610558371","https://openalex.org/W6620459526","https://openalex.org/W6654561490","https://openalex.org/W6681003332","https://openalex.org/W6688337918"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3184816460","https://openalex.org/W4220669546","https://openalex.org/W2053123342","https://openalex.org/W2140766902","https://openalex.org/W2078615166","https://openalex.org/W4321017759","https://openalex.org/W4281644489","https://openalex.org/W4379470677","https://openalex.org/W2384011474"],"abstract_inverted_index":{"In":[0,102],"this":[1,27],"work,":[2],"we":[3,30,76,105],"present":[4],"a":[5,10,21,32,58,64,73,88,99,111,137],"novel":[6],"method":[7,86,109,131],"for":[8,40],"constructing":[9],"topological":[11,28,112],"map":[12],"of":[13,51,66,90,136],"biological":[14],"hotspots":[15],"in":[16,87,119,140],"an":[17,80],"aquatic":[18],"environment":[19,121],"using":[20],"Fast":[22],"Marching-based":[23],"Voronoi":[24],"segmentation.":[25],"Using":[26,72],"map,":[29],"develop":[31],"closed":[33],"form":[34],"solution":[35],"to":[36,56,149,153],"the":[37,45,49,67,120,134,141],"scheduling":[38],"problem":[39,145],"any":[41],"single":[42],"path":[43,61,143],"through":[44],"graph.":[46],"Searching":[47],"over":[48],"space":[50],"all":[52],"paths":[53],"allows":[54],"us":[55],"compute":[57,79],"maximally":[59],"informative":[60,81,142,151],"that":[62,107,129],"traverses":[63],"subset":[65],"hotspots,":[68],"given":[69],"some":[70],"budget.":[71],"greedy-coverage":[74,138],"algorithm":[75,139],"can":[77,132],"then":[78],"path.":[82],"We":[83,127],"evaluate":[84],"our":[85,108,130],"set":[89],"simulated":[91],"trials,":[92,104],"both":[93],"with":[94],"randomly":[95],"generated":[96],"environments":[97],"and":[98],"real-world":[100],"environment.":[101],"these":[103],"show":[106,128],"produces":[110],"graph":[113],"which":[114],"more":[115],"accurately":[116],"captures":[117],"features":[118],"than":[122],"standard":[123],"thresholding":[124],"techniques.":[125],"Additionally,":[126],"improve":[133],"performance":[135],"planning":[144],"by":[146],"guiding":[147],"it":[148,155],"different":[150],"areas":[152],"help":[154],"escape":[156],"from":[157],"local":[158],"maxima.":[159]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}