{"id":"https://openalex.org/W2126888775","doi":"https://doi.org/10.1109/tro.2012.2227216","title":"Risky Planning on Probabilistic Costmaps for Path Planning in Outdoor Environments","display_name":"Risky Planning on Probabilistic Costmaps for Path Planning in Outdoor Environments","publication_year":2012,"publication_date":"2012-11-29","ids":{"openalex":"https://openalex.org/W2126888775","doi":"https://doi.org/10.1109/tro.2012.2227216","mag":"2126888775"},"language":"en","primary_location":{"id":"doi:10.1109/tro.2012.2227216","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2012.2227216","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1941-0468"],"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 Transactions on Robotics","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/A5112687719","display_name":"Liz Murphy","orcid":null},"institutions":[{"id":"https://openalex.org/I160993911","display_name":"Queensland University of Technology","ror":"https://ror.org/03pnv4752","country_code":"AU","type":"education","lineage":["https://openalex.org/I160993911"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Liz Murphy","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Queensland University of Technology, Brisbane, Qld, Australia","School of Electrical Engineering and Computer Science, Queensland University of Technology , Brisbane, Australia"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Queensland University of Technology, Brisbane, Qld, Australia","institution_ids":["https://openalex.org/I160993911"]},{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Queensland University of Technology , Brisbane, Australia","institution_ids":["https://openalex.org/I160993911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055299977","display_name":"Paul Newman","orcid":"https://orcid.org/0000-0001-6562-8454"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]},{"id":"https://openalex.org/I4210146410","display_name":"Science Oxford","ror":"https://ror.org/04j8yhy50","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I4210146410"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Paul Newman","raw_affiliation_strings":["Mobile Robotics Group, Department of Engineering Science, University of Oxford, Oxford, UK","[Mobile Robotics Group, Department of Engineering Science, University of Oxford, Oxford, U.K.]"],"affiliations":[{"raw_affiliation_string":"Mobile Robotics Group, Department of Engineering Science, University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I4210146410","https://openalex.org/I40120149"]},{"raw_affiliation_string":"[Mobile Robotics Group, Department of Engineering Science, University of Oxford, Oxford, U.K.]","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112687719"],"corresponding_institution_ids":["https://openalex.org/I160993911"],"apc_list":null,"apc_paid":null,"fwci":2.7756,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.91849057,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"29","issue":"2","first_page":"445","last_page":"457"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9803000092506409,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9473999738693237,"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/precomputation","display_name":"Precomputation","score":0.7800321578979492},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7589859366416931},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7294111847877502},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.5654822587966919},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.5636974573135376},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5374084115028381},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5204944014549255},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5189518928527832},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4989309310913086},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4181153476238251},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3837687373161316},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3556920886039734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3497680425643921},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2603498101234436},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.09119853377342224},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06657719612121582}],"concepts":[{"id":"https://openalex.org/C159379195","wikidata":"https://www.wikidata.org/wiki/Q7239568","display_name":"Precomputation","level":3,"score":0.7800321578979492},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7589859366416931},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7294111847877502},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.5654822587966919},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.5636974573135376},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5374084115028381},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5204944014549255},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5189518928527832},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4989309310913086},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4181153476238251},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3837687373161316},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3556920886039734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3497680425643921},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2603498101234436},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.09119853377342224},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06657719612121582},{"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/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tro.2012.2227216","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2012.2227216","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1941-0468"],"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 Transactions on Robotics","raw_type":"journal-article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:0b27828a-3fee-4102-8b4a-e2a41a46c8c9","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:0b27828a-3fee-4102-8b4a-e2a41a46c8c9","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements at Oxford","raw_type":"Journal article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7400000095367432}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W36989131","https://openalex.org/W198732646","https://openalex.org/W649985962","https://openalex.org/W1484113995","https://openalex.org/W1487146975","https://openalex.org/W1532688806","https://openalex.org/W1561255266","https://openalex.org/W1622225657","https://openalex.org/W1646038686","https://openalex.org/W1969483458","https://openalex.org/W1971937094","https://openalex.org/W1983644984","https://openalex.org/W2014889099","https://openalex.org/W2016131180","https://openalex.org/W2029629075","https://openalex.org/W2035601288","https://openalex.org/W2036300381","https://openalex.org/W2042872950","https://openalex.org/W2085245641","https://openalex.org/W2099144379","https://openalex.org/W2099430963","https://openalex.org/W2107349834","https://openalex.org/W2109215935","https://openalex.org/W2123910366","https://openalex.org/W2124825847","https://openalex.org/W2127859636","https://openalex.org/W2134348961","https://openalex.org/W2134634502","https://openalex.org/W2142624263","https://openalex.org/W2148319469","https://openalex.org/W2156257350","https://openalex.org/W2168359464","https://openalex.org/W2169528473","https://openalex.org/W2171707538","https://openalex.org/W2294319407","https://openalex.org/W2296385533","https://openalex.org/W2963889160","https://openalex.org/W2999729612","https://openalex.org/W3021035068","https://openalex.org/W3162817847","https://openalex.org/W4211049957","https://openalex.org/W4236251699","https://openalex.org/W6601500136","https://openalex.org/W6621585471","https://openalex.org/W6631864160","https://openalex.org/W6636732284"],"related_works":["https://openalex.org/W126258643","https://openalex.org/W2157769033","https://openalex.org/W2096978683","https://openalex.org/W2687399516","https://openalex.org/W2543067032","https://openalex.org/W2170398238","https://openalex.org/W3029113864","https://openalex.org/W2020308516","https://openalex.org/W414359703","https://openalex.org/W4242327143"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,54,82,112],"framework":[4],"for":[5],"path":[6],"planning":[7],"over":[8,115,141],"probabilistic":[9,44,67,72],"costmaps":[10,45],"of":[11,42,57,65,74,90,95,127,131,138],"outdoor":[12],"terrain":[13],"that":[14,86,104,121],"is":[15,107],"compatible":[16],"with":[17,39],"fast":[18],"grid-based":[19],"planners":[20],"such":[21,58],"as":[22],"A":[23],"<formula":[24,31],"formulatype=\"inline\"":[25,32],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[26,33],"xmlns:xlink=\"http://www.w3.org/1999/xlink\"><tex":[27,34],"Notation=\"TeX\">$^*$</tex></formula>":[28,35],"and":[29,49,120,134],"D":[30],".":[36],"We":[37],"begin":[38],"an":[40],"exemplar":[41],"how":[43,52],"may":[46],"be":[47,146],"constructed":[48],"then":[50],"show":[51],"the":[53,63,71,78,88,105,116,125],"priori":[55],"availability":[56],"maps":[59],"lends":[60],"itself":[61],"to":[62,80,109],"precomputation":[64],"exact":[66,118],"heuristics.":[68],"In":[69],"turn,":[70],"nature":[73],"these":[75],"heuristics":[76],"allow":[77],"user":[79],"employ":[81],"bounded":[83],"speed\u2013accuracy":[84],"tradeoff":[85],"characterizes":[87],"risk":[89],"paths":[91],"returned":[92],"not":[93],"being":[94],"optimal":[96],"shortest-path":[97],"length.":[98],"Results":[99],"are":[100],"shown":[101],"which":[102],"demonstrate":[103],"method":[106],"able":[108],"closely":[110],"approximate":[111],"probability":[113],"distribution":[114],"underlying":[117],"distance":[119,143],"efficiency":[122],"increases":[123],"on":[124],"order":[126],"90%":[128],"in":[129,136],"terms":[130,137],"nodes":[132],"expanded,":[133],"60%":[135],"search":[139],"time":[140],"Euclidean":[142],"heuristics,":[144],"can":[145],"achieved.":[147]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}