{"id":"https://openalex.org/W4390701408","doi":"https://doi.org/10.1177/02783649231225474","title":"Lane-level route planning for autonomous vehicles","display_name":"Lane-level route planning for autonomous vehicles","publication_year":2024,"publication_date":"2024-01-10","ids":{"openalex":"https://openalex.org/W4390701408","doi":"https://doi.org/10.1177/02783649231225474"},"language":"en","primary_location":{"id":"doi:10.1177/02783649231225474","is_oa":false,"landing_page_url":"https://doi.org/10.1177/02783649231225474","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","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/A5012548113","display_name":"Mitchell Jones","orcid":"https://orcid.org/0000-0003-2971-398X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mitchell Jones","raw_affiliation_strings":["Nuro, Mountain View, CA, USA"],"raw_orcid":"https://orcid.org/0000-0003-2971-398X","affiliations":[{"raw_affiliation_string":"Nuro, Mountain View, CA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025783176","display_name":"Maximilian Haas-Heger","orcid":"https://orcid.org/0000-0002-1982-0549"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maximilian Haas-Heger","raw_affiliation_strings":["Nuro, Mountain View, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nuro, Mountain View, CA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108617083","display_name":"Jur van den Berg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jur van den Berg","raw_affiliation_strings":["Nuro, Mountain View, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nuro, Mountain View, CA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5012548113"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4925,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.59330526,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"43","issue":"9","first_page":"1425","last_page":"1440"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T10524","display_name":"Traffic control and management","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10698","display_name":"Transportation Planning and Optimization","score":0.9713000059127808,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6974467635154724},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6609584093093872},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6280380487442017},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6176092624664307},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5138530731201172},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5075110793113708},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.49780702590942383},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.46622681617736816},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4646897315979004},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4612836241722107},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4560118317604065},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4131825566291809},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.23171082139015198},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1628221869468689},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14462825655937195},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.10406908392906189},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09672719240188599},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08914065361022949},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08695119619369507}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6974467635154724},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6609584093093872},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6280380487442017},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6176092624664307},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5138530731201172},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5075110793113708},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.49780702590942383},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.46622681617736816},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4646897315979004},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4612836241722107},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4560118317604065},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4131825566291809},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.23171082139015198},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1628221869468689},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14462825655937195},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10406908392906189},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09672719240188599},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08914065361022949},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08695119619369507},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/02783649231225474","is_oa":false,"landing_page_url":"https://doi.org/10.1177/02783649231225474","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W108082272","https://openalex.org/W1424654272","https://openalex.org/W1585104299","https://openalex.org/W1969483458","https://openalex.org/W1976699101","https://openalex.org/W1999244633","https://openalex.org/W2003522422","https://openalex.org/W2081287319","https://openalex.org/W2102323131","https://openalex.org/W2103345739","https://openalex.org/W2104317982","https://openalex.org/W2105757562","https://openalex.org/W2116731623","https://openalex.org/W2131482590","https://openalex.org/W2134634502","https://openalex.org/W2168148394","https://openalex.org/W2343568200","https://openalex.org/W2561843528","https://openalex.org/W2592489447","https://openalex.org/W2904357966","https://openalex.org/W2922329393","https://openalex.org/W3045084777","https://openalex.org/W3047375952","https://openalex.org/W3103644247","https://openalex.org/W3210386208","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2379764279","https://openalex.org/W2018691209","https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2413828414","https://openalex.org/W2367222340","https://openalex.org/W187740018","https://openalex.org/W2162286586","https://openalex.org/W4255368532"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2,148,159],"algorithm":[3,32],"that,":[4],"given":[5,26],"a":[6,9,16,25,72,91,125],"representation":[7],"of":[8,70],"road":[10],"network":[11],"in":[12,64,79,96,113],"lane-level":[13],"detail,":[14],"computes":[15],"route":[17,161],"that":[18],"minimizes":[19],"the":[20,38,58,68,80],"expected":[21],"cost":[22],"to":[23,35,44,50,55,108,111,128,151,162],"reach":[24],"destination.":[27,164],"In":[28,115],"doing":[29],"so,":[30],"our":[31],"allows":[33],"us":[34],"solve":[36,112,129],"for":[37],"complex":[39],"trade-offs":[40],"encountered":[41],"when":[42,54],"trying":[43],"decide":[45],"not":[46,76],"just":[47],"which":[48,97],"roads":[49],"follow,":[51],"but":[52],"also":[53],"change":[56,99],"between":[57],"lanes":[59],"making":[60],"up":[61],"these":[62],"roads,":[63],"order":[65],"to\u2014for":[66],"example\u2014reduce":[67],"likelihood":[69],"missing":[71],"left":[73],"exit":[74],"while":[75],"unnecessarily":[77],"driving":[78],"leftmost":[81],"lane.":[82],"This":[83,146],"routing":[84],"problem":[85],"can":[86,123],"naturally":[87],"be":[88,109],"formulated":[89],"as":[90,155],"Markov":[92],"Decision":[93],"Process":[94],"(MDP),":[95],"lane":[98],"actions":[100],"have":[101],"stochastic":[102,131],"outcomes.":[103],"However,":[104],"MDPs":[105],"are":[106],"known":[107],"time-consuming":[110],"general.":[114],"this":[116,130],"paper,":[117],"we":[118],"show":[119],"that\u2014under":[120],"reasonable":[121],"assumptions\u2014we":[122],"use":[124],"Dijkstra-like":[126],"approach":[127],"problem,":[132],"and":[133],"benefit":[134],"from":[135],"its":[136,163],"efficient":[137],"O":[138],"(":[139],"n":[140,142],"log":[141],")":[143],"running":[144],"time.":[145],"enables":[147],"autonomous":[149],"vehicle":[150],"exhibit":[152],"lane-selection":[153],"behavior":[154],"it":[156],"efficiently":[157],"plans":[158],"optimal":[160]},"counts_by_year":[{"year":2025,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}