{"id":"https://openalex.org/W7138917050","doi":"https://doi.org/10.1609/aaai.v40i43.41004","title":"MeshA*: Efficient Path Planning with Motion Primitives","display_name":"MeshA*: Efficient Path Planning with Motion Primitives","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7138917050","doi":"https://doi.org/10.1609/aaai.v40i43.41004"},"language":"en","primary_location":{"id":"doi:10.1609/aaai.v40i43.41004","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.41004","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/41004/44965","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/AAAI/article/download/41004/44965","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129853979","display_name":"Marat Agranovskiy","orcid":null},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Marat Agranovskiy","raw_affiliation_strings":["St. Petersburg State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"St. Petersburg State University","institution_ids":["https://openalex.org/I172901346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5129931513","display_name":"Konstantin Yakovlev","orcid":null},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Konstantin Yakovlev","raw_affiliation_strings":["St. Petersburg State University\nCogAILab"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"St. Petersburg State University\nCogAILab","institution_ids":["https://openalex.org/I172901346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I172901346"],"apc_list":null,"apc_paid":null,"fwci":38.1828,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.99667134,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"40","issue":"43","first_page":"36785","last_page":"36792"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9194999933242798,"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.9194999933242798,"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.03440000116825104,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.008700000122189522,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/motion-planning","display_name":"Motion planning","score":0.7139999866485596},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5248000025749207},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48980000615119934},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4765999913215637},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.46790000796318054},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4618000090122223},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.45509999990463257}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7139999866485596},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5248000025749207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5054000020027161},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48980000615119934},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4765999913215637},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.46790000796318054},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4618000090122223},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.45509999990463257},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4415000081062317},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4341000020503998},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.42730000615119934},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42089998722076416},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.40709999203681946},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.35420000553131104},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3479999899864197},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.32589998841285706},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.31929999589920044},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.30880001187324524},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3012999892234802},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.25850000977516174},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2554999887943268}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1609/aaai.v40i43.41004","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.41004","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/41004/44965","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:ojs.aaai.org:article/41004","is_oa":false,"landing_page_url":"https://ojs.aaai.org/index.php/AAAI/article/view/41004","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2159-5399","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v40i43.41004","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.41004","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/41004/44965","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7453819513320923,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320324632","display_name":"Ministero dello Sviluppo Economico","ror":"https://ror.org/011z3ff80"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7138917050.pdf","grobid_xml":"https://content.openalex.org/works/W7138917050.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"a":[2,14,34,45,52,72,93],"path":[3],"planning":[4,146],"problem":[5],"where":[6],"the":[7,22,26,48,62,77,98,103,112,116,128,135,150,153],"possible":[8,113],"move":[9],"actions":[10],"are":[11],"represented":[12,43],"as":[13,44],"finite":[15],"set":[16],"of":[17,25,38,47,51,100,115],"motion":[18,37,117],"primitives":[19,67,118],"aligned":[20],"with":[21],"grid":[23,104],"representation":[24],"environment.":[27],"That":[28],"is,":[29],"each":[30],"primitive":[31],"corresponds":[32],"to":[33,70,76,141],"short":[35],"kinodynamically-feasible":[36],"an":[39],"agent":[40],"and":[41,132,138],"is":[42,59,139],"sequence":[46],"swept":[49],"cells":[50,105],"grid.":[53],"Typically,":[54],"heuristic":[55],"search,":[56],"i.e.":[57],"A*,":[58],"conducted":[60],"over":[61,102],"lattice":[63],"induced":[64],"by":[65],"these":[66,120],"(lattice-based":[68],"planning)":[69],"find":[71],"path.":[73],"However,":[74],"due":[75],"large":[78],"branching":[79],"factor,":[80],"such":[81],"search":[82],"may":[83],"be":[84],"inefficient":[85],"in":[86,97,107,149],"practice.":[87],"To":[88],"this":[89],"end,":[90],"we":[91],"suggest":[92],"novel":[94],"technique":[95],"rooted":[96],"idea":[99],"searching":[101],"(as":[106],"vanilla":[108],"A*)":[109],"simultaneously":[110],"fitting":[111],"sequences":[114],"into":[119],"cells.":[121],"The":[122],"resultant":[123],"algorithm,":[124],"MeshA*,":[125],"provably":[126],"preserves":[127],"guarantees":[129],"on":[130,134,152],"completeness":[131],"optimality,":[133],"one":[136],"hand,":[137],"shown":[140],"notably":[142],"outperform":[143],"conventional":[144],"lattice-based":[145],"(x1.5-x2":[147],"decrease":[148],"runtime),":[151],"other":[154],"hand.":[155]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-08-08T07:41:36.138363","created_date":"2026-03-20T00:00:00"}