{"id":"https://openalex.org/W2107349834","doi":"https://doi.org/10.1109/icra.2011.5980124","title":"Risky planning: Path planning over costmaps with a probabilistically bounded speed-accuracy tradeoff","display_name":"Risky planning: Path planning over costmaps with a probabilistically bounded speed-accuracy tradeoff","publication_year":2011,"publication_date":"2011-05-01","ids":{"openalex":"https://openalex.org/W2107349834","doi":"https://doi.org/10.1109/icra.2011.5980124","mag":"2107349834"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2011.5980124","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2011.5980124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Robotics and Automation","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/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 Engineering Systems, Queensland University of Technology, Australia","[School of Engineering Systems, Queensland University of Technology, Australia]"],"affiliations":[{"raw_affiliation_string":"School of Engineering Systems, Queensland University of Technology, Australia","institution_ids":["https://openalex.org/I160993911"]},{"raw_affiliation_string":"[School of Engineering Systems, Queensland University of Technology, 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/I2802123492","display_name":"Oxford Research Group","ror":"https://ror.org/00z4w4f29","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I2802123492"]},{"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"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Paul Newman","raw_affiliation_strings":["Mobile Robotics Group, Oxford University, UK","[Oxford University Mobile Robotics Group, UK]"],"affiliations":[{"raw_affiliation_string":"Mobile Robotics Group, Oxford University, UK","institution_ids":["https://openalex.org/I2802123492","https://openalex.org/I40120149"]},{"raw_affiliation_string":"[Oxford University Mobile Robotics Group, UK]","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":1.5682,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.86174555,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"3727","last_page":"3732"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9907000064849854,"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"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9753000140190125,"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/heuristics","display_name":"Heuristics","score":0.9047642350196838},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7416173815727234},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6534699201583862},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.619443416595459},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6129609942436218},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6127704977989197},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5460328459739685},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.47156044840812683},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.4383801221847534},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39908528327941895},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3453786373138428},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32713133096694946},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2609702944755554},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.23304417729377747}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.9047642350196838},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7416173815727234},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6534699201583862},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.619443416595459},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6129609942436218},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6127704977989197},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5460328459739685},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47156044840812683},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.4383801221847534},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39908528327941895},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3453786373138428},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32713133096694946},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2609702944755554},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.23304417729377747},{"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/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra.2011.5980124","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2011.5980124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:bab50cec-29ae-485f-b395-bb5f4e3181ad","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:bab50cec-29ae-485f-b395-bb5f4e3181ad","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.44999998807907104}],"awards":[{"id":"https://openalex.org/G6834514017","display_name":null,"funder_award_id":"EP/I005021/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W36989131","https://openalex.org/W198732646","https://openalex.org/W1487146975","https://openalex.org/W1561255266","https://openalex.org/W1646038686","https://openalex.org/W1969483458","https://openalex.org/W1983644984","https://openalex.org/W2014889099","https://openalex.org/W2042872950","https://openalex.org/W2099144379","https://openalex.org/W2161076907","https://openalex.org/W2294319407","https://openalex.org/W2319958627","https://openalex.org/W2403671276","https://openalex.org/W4236251699","https://openalex.org/W6601500136","https://openalex.org/W6608150121","https://openalex.org/W6633653409","https://openalex.org/W6654186649","https://openalex.org/W6696955428"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W1536056491","https://openalex.org/W2041180560","https://openalex.org/W2740367979","https://openalex.org/W4302010637"],"abstract_inverted_index":{"This":[0],"paper":[1],"is":[2],"about":[3],"generating":[4],"plans":[5],"over":[6,29,123],"uncertain":[7],"maps":[8,42,50],"quickly.":[9],"Our":[10],"approach":[11],"combines":[12],"the":[13,19,62,80,108,112],"ALT":[14,63,102],"(A*":[15],"search,":[16],"landmarks":[17],"and":[18,23,46,59,75,114],"triangle":[20],"inequality)":[21],"algorithm":[22],"risk":[24,81],"heuristics":[25,53,67],"to":[26,51,85,107],"guide":[27],"search":[28,77,89,126],"probabilistic":[30,40],"cost":[31,41,49],"maps.":[32],"We":[33,71],"build":[34],"on":[35],"previous":[36],"work":[37],"which":[38,99,115],"generates":[39],"from":[43],"aerial":[44],"imagery":[45],"use":[47],"these":[48],"precompute":[52],"for":[54],"searches":[55],"such":[56],"as":[57],"A*":[58],"D*":[60],"using":[61],"technique.":[64],"The":[65],"resulting":[66],"are":[68,83,97],"probability":[69],"distributions.":[70],"can":[72],"speed":[73],"up":[74],"direct":[76],"by":[78],"characterising":[79],"we":[82],"prepared":[84],"take":[86],"in":[87,119],"gaining":[88],"efficiency":[90,117],"while":[91],"sacrificing":[92],"optimal":[93],"path":[94],"length.":[95],"Results":[96],"shown":[98],"demonstrate":[100],"that":[101],"provides":[103],"a":[104],"good":[105],"approximation":[106],"true":[109],"distribution":[110],"of":[111,121],"heuristic,":[113],"show":[116],"increases":[118],"excess":[120],"70%":[122],"normal":[124],"heuristic":[125],"methods.":[127]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}