{"id":"https://openalex.org/W3118715781","doi":"https://doi.org/10.1117/12.2587614","title":"Local path planning algorithm for autonomous vehicle based on multi-objective trajectory optimization in state lattice","display_name":"Local path planning algorithm for autonomous vehicle based on multi-objective trajectory optimization in state lattice","publication_year":2021,"publication_date":"2021-01-04","ids":{"openalex":"https://openalex.org/W3118715781","doi":"https://doi.org/10.1117/12.2587614","mag":"3118715781"},"language":"en","primary_location":{"id":"doi:10.1117/12.2587614","is_oa":false,"landing_page_url":"https://doi.org/10.1117/12.2587614","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Thirteenth International Conference on Machine Vision","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/A5096797966","display_name":"Ivan Kornev","orcid":null},"institutions":[{"id":"https://openalex.org/I4210107660","display_name":"Institute for Information Transmission Problems","ror":"https://ror.org/013w2d378","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210097085","https://openalex.org/I4210107660"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Ivan Kornev","raw_affiliation_strings":["EvoCargo LLC (Russian Federation)","Institute for Information Transmission Problems, RAS (Russian Federation)"],"affiliations":[{"raw_affiliation_string":"EvoCargo LLC (Russian Federation)","institution_ids":[]},{"raw_affiliation_string":"Institute for Information Transmission Problems, RAS (Russian Federation)","institution_ids":["https://openalex.org/I4210107660"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047195071","display_name":"Vladislav Kibalov","orcid":null},"institutions":[{"id":"https://openalex.org/I4210107660","display_name":"Institute for Information Transmission Problems","ror":"https://ror.org/013w2d378","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210097085","https://openalex.org/I4210107660"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Vladislav Kibalov","raw_affiliation_strings":["EvoCargo LLC (Russian Federation)","Institute for Information Transmission Problems, RAS (Russian Federation)"],"affiliations":[{"raw_affiliation_string":"EvoCargo LLC (Russian Federation)","institution_ids":[]},{"raw_affiliation_string":"Institute for Information Transmission Problems, RAS (Russian Federation)","institution_ids":["https://openalex.org/I4210107660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088831582","display_name":"Oleg Shipitko","orcid":"https://orcid.org/0000-0003-1266-8828"},"institutions":[{"id":"https://openalex.org/I4210107660","display_name":"Institute for Information Transmission Problems","ror":"https://ror.org/013w2d378","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210097085","https://openalex.org/I4210107660"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Oleg Shipitko","raw_affiliation_strings":["EvoCargo LLC (Russian Federation)","Institute for Information Transmission Problems, RAS (Russian Federation)"],"affiliations":[{"raw_affiliation_string":"EvoCargo LLC (Russian Federation)","institution_ids":[]},{"raw_affiliation_string":"Institute for Information Transmission Problems, RAS (Russian Federation)","institution_ids":["https://openalex.org/I4210107660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5096797966"],"corresponding_institution_ids":["https://openalex.org/I4210107660"],"apc_list":null,"apc_paid":null,"fwci":0.1833,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.46092892,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"72","last_page":"72"},"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.9900000095367432,"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.9900000095367432,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9894999861717224,"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/T14082","display_name":"Modeling, Simulation, and Optimization","score":0.9803000092506409,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.7321075201034546},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5942988395690918},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5642900466918945},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5635226964950562},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.5349757671356201},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5319452881813049},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5292460322380066},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5029987692832947},{"id":"https://openalex.org/keywords/nonholonomic-system","display_name":"Nonholonomic system","score":0.48690807819366455},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.4446971118450165},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43065983057022095},{"id":"https://openalex.org/keywords/kinematics","display_name":"Kinematics","score":0.42340749502182007},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4190010130405426},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.35393309593200684},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3322458863258362},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2582845687866211},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.22075608372688293},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19181305170059204}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7321075201034546},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5942988395690918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5642900466918945},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5635226964950562},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.5349757671356201},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5319452881813049},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5292460322380066},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5029987692832947},{"id":"https://openalex.org/C138632511","wikidata":"https://www.wikidata.org/wiki/Q2478109","display_name":"Nonholonomic system","level":4,"score":0.48690807819366455},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.4446971118450165},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43065983057022095},{"id":"https://openalex.org/C39920418","wikidata":"https://www.wikidata.org/wiki/Q11476","display_name":"Kinematics","level":2,"score":0.42340749502182007},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4190010130405426},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.35393309593200684},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3322458863258362},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2582845687866211},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.22075608372688293},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19181305170059204},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1117/12.2587614","is_oa":false,"landing_page_url":"https://doi.org/10.1117/12.2587614","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Thirteenth International Conference on Machine Vision","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7900000214576721,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4285687848","https://openalex.org/W223921116","https://openalex.org/W4402599120","https://openalex.org/W2982088850","https://openalex.org/W3216780016","https://openalex.org/W2912253819","https://openalex.org/W2906354749","https://openalex.org/W2766846319","https://openalex.org/W4293157163","https://openalex.org/W2376328589"],"abstract_inverted_index":{"The":[0,40,62,75,100,114,138],"paper":[1],"presents":[2],"an":[3,17,121],"algorithm":[4,126,139],"for":[5,10],"constructing":[6],"a":[7,11,24,36,52,91,108,131,143,152,157,162],"local":[8,21,164,181,200],"path":[9,22,49,132,155,165,170],"vehicle":[12],"with":[13],"nonholonomic":[14],"kinematics":[15],"of":[16,26,31,57,64,72,77,83,94,219],"automobile":[18],"type.":[19],"A":[20],"is":[23,42,88,118,127,172],"sequence":[25],"transitions":[27],"in":[28,51,133,174,186],"the":[29,47,70,81,84,134,195,198,210,216,220],"graph":[30,41,73,86],"possible":[32],"maneuvers":[33],"that":[34,179],"minimizes":[35,104],"given":[37,153,211],"cost":[38,102],"function.":[39],"constructed":[43],"by":[44],"duplicating":[45],"along":[46],"global":[48,154,212],"pre-calculated":[50],"curvilinear":[53],"coordinate":[54],"system":[55],"set":[56],"kinematically":[58],"feasible":[59],"motion":[60,66],"primitives.":[61],"use":[63],"pre-computed":[65],"primitives":[67],"significantly":[68],"reduces":[69],"time":[71],"construction.":[74],"weight":[76],"each":[78],"maneuver":[79],"\u2013":[80,87],"edge":[82],"transition":[85],"calculated":[89],"as":[90],"weighted":[92,135],"sum":[93],"costs":[95],"based":[96],"on":[97,142,203,206],"several":[98],"criteria.":[99],"specified":[101],"function":[103],"maneuvering":[105],"and":[106,156],"maintains":[107],"safe":[109,163,180],"distance":[110],"to":[111,129],"static":[112,158],"obstacles.":[113],"information":[115],"about":[116],"obstacles":[117],"extracted":[119],"from":[120],"occupancy":[122],"grid":[123],"map.":[124],"Dijkstra\u2018s":[125],"used":[128],"search":[130,171],"directed":[136],"graph.":[137],"was":[140,191],"tested":[141],"dataset":[144],"containing":[145],"real":[146],"road":[147],"scenes.":[148],"Each":[149],"scene":[150],"represents":[151],"environment":[159],"model":[160],"where":[161,189],"must":[166],"be":[167],"found.":[168],"Local":[169],"performed":[173],"real-time.":[175],"Experiments":[176],"have":[177,183],"shown":[178],"paths":[182,201,213],"been":[184],"found":[185],"all":[187],"scenes":[188],"it":[190],"physically":[192],"possible.":[193],"At":[194],"same":[196],"time,":[197],"obtained":[199],"were":[202],"average":[204],"only":[205],"1:3%":[207],"longer":[208],"than":[209],"which":[214],"demonstrate":[215],"high":[217],"applicability":[218],"proposed":[221],"algorithm.":[222]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}