{"id":"https://openalex.org/W4401413812","doi":"https://doi.org/10.1109/icra57147.2024.10610493","title":"Generating Sparse Probabilistic Graphs for Efficient Planning in Uncertain Environments","display_name":"Generating Sparse Probabilistic Graphs for Efficient Planning in Uncertain Environments","publication_year":2024,"publication_date":"2024-05-13","ids":{"openalex":"https://openalex.org/W4401413812","doi":"https://doi.org/10.1109/icra57147.2024.10610493"},"language":"en","primary_location":{"id":"doi:10.1109/icra57147.2024.10610493","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icra57147.2024.10610493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-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/A5106364707","display_name":"Yasmin Veys","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yasmin Veys","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology,Cambridge,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology,Cambridge,USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113325496","display_name":"Martina Stadler Kurtz","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martina Stadler Kurtz","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology,Cambridge,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology,Cambridge,USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103263485","display_name":"Nicholas Roy","orcid":"https://orcid.org/0000-0001-9307-4196"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicholas Roy","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology,Cambridge,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology,Cambridge,USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2187,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48805174,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"133","last_page":"139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7456570863723755},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7178988456726074},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3917147219181061},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38915836811065674}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7456570863723755},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7178988456726074},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3917147219181061},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38915836811065674}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra57147.2024.10610493","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icra57147.2024.10610493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320316514","display_name":"Arm","ror":"https://ror.org/04mmhzs81"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W144764141","https://openalex.org/W1537258144","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W1974909294","https://openalex.org/W1976930960","https://openalex.org/W1992876208","https://openalex.org/W2004100691","https://openalex.org/W2016584965","https://openalex.org/W2053833381","https://openalex.org/W2064755319","https://openalex.org/W2108234048","https://openalex.org/W2109212155","https://openalex.org/W2126888775","https://openalex.org/W2127772657","https://openalex.org/W2128990851","https://openalex.org/W2133844819","https://openalex.org/W2808970843","https://openalex.org/W2963439114","https://openalex.org/W3004352543","https://openalex.org/W3102121895","https://openalex.org/W4242246215","https://openalex.org/W4285741752","https://openalex.org/W4382866712","https://openalex.org/W4401416191","https://openalex.org/W6676301642"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W1497573972","https://openalex.org/W2071659383","https://openalex.org/W1846253165"],"abstract_inverted_index":{"Environments":[0],"with":[1,11,32],"regions":[2],"of":[3,66,74,86,95],"uncertain":[4,37],"traversability":[5,87],"can":[6],"be":[7,42,126],"modeled":[8],"as":[9],"roadmaps":[10,24,142],"probabilistic":[12],"edges":[13,54,75],"for":[14,152],"efficient":[15],"planning":[16,47,150],"under":[17,63],"uncertainty.":[18,69],"We":[19,91,131],"would":[20],"like":[21],"to":[22,28,58,60,76,78,119,128],"generate":[23],"that":[25,45,55,98,139],"enable":[26],"planners":[27],"efficiently":[29],"find":[30],"paths":[31],"expected":[33,104,112],"low":[34],"costs":[35],"through":[36],"environments.":[38],"The":[39],"roadmap":[40,80],"must":[41],"sparse":[43],"so":[44],"the":[46,67,71,79,93,100,103,111,129,157],"problem":[48],"is":[49,89],"tractable,":[50],"but":[51],"still":[52],"contain":[53],"are":[56],"likely":[57],"contribute":[59],"low-cost":[61],"plans":[62],"various":[64],"realizations":[65],"environmental":[68],"Determining":[70],"optimal":[72,117],"set":[73],"add":[77],"without":[81],"considering":[82],"an":[83,116],"exponential":[84],"number":[85],"scenarios":[88],"challenging.":[90],"propose":[92],"use":[94],"a":[96,122],"heuristic":[97],"bounds":[99],"ratio":[101],"between":[102,146],"path":[105,113],"cost":[106,114],"in":[107,115,135,156],"our":[108,133,140],"graph":[109,118],"and":[110,149],"determine":[120],"whether":[121],"given":[123],"edge":[124],"should":[125],"added":[127],"roadmap.":[130],"test":[132],"approach":[134],"several":[136],"environments,":[137],"demonstrating":[138],"uncertainty-aware":[141,153],"effectively":[143],"trade":[144],"off":[145],"plan":[147],"quality":[148],"efficiency":[151],"agents":[154],"navigating":[155],"graph.":[158]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}