{"id":"https://openalex.org/W3209269749","doi":"https://doi.org/10.1016/j.artint.2021.103624","title":"Fast optimal and bounded suboptimal Euclidean pathfinding","display_name":"Fast optimal and bounded suboptimal Euclidean pathfinding","publication_year":2021,"publication_date":"2021-10-25","ids":{"openalex":"https://openalex.org/W3209269749","doi":"https://doi.org/10.1016/j.artint.2021.103624","mag":"3209269749"},"language":"en","primary_location":{"id":"doi:10.1016/j.artint.2021.103624","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.artint.2021.103624","pdf_url":null,"source":{"id":"https://openalex.org/S196139623","display_name":"Artificial Intelligence","issn_l":"0004-3702","issn":["0004-3702","1872-7921"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Artificial Intelligence","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/A5022748563","display_name":"Bojie Shen","orcid":"https://orcid.org/0000-0001-6551-5302"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Bojie Shen","raw_affiliation_strings":["Faculty of Information Technology, Monash University, Australia"],"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047549903","display_name":"Muhammad Aamir Cheema","orcid":"https://orcid.org/0000-0003-2139-9121"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Muhammad Aamir Cheema","raw_affiliation_strings":["Faculty of Information Technology, Monash University, Australia"],"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035664456","display_name":"Daniel Harabor","orcid":"https://orcid.org/0000-0001-6828-7712"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Daniel D. Harabor","raw_affiliation_strings":["Faculty of Information Technology, Monash University, Australia"],"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064839018","display_name":"Peter J. Stuckey","orcid":"https://orcid.org/0000-0003-2186-0459"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Peter J. Stuckey","raw_affiliation_strings":["Faculty of Information Technology, Monash University, Australia"],"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5022748563"],"corresponding_institution_ids":["https://openalex.org/I56590836"],"apc_list":{"value":3670,"currency":"USD","value_usd":3670},"apc_paid":null,"fwci":0.9607,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.77797386,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"302","issue":null,"first_page":"103624","last_page":"103624"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9983000159263611,"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.9983000159263611,"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.9922999739646912,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9787999987602234,"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/pathfinding","display_name":"Pathfinding","score":0.6827415227890015},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5839500427246094},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5720552206039429},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.535378098487854},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5057554244995117},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.44944384694099426},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.441635400056839},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4276130795478821},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.41651293635368347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30463385581970215},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.293610155582428},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.12380111217498779},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06897392868995667}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.6827415227890015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5839500427246094},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5720552206039429},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.535378098487854},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5057554244995117},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.44944384694099426},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.441635400056839},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4276130795478821},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.41651293635368347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30463385581970215},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.293610155582428},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.12380111217498779},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06897392868995667},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.artint.2021.103624","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.artint.2021.103624","pdf_url":null,"source":{"id":"https://openalex.org/S196139623","display_name":"Artificial Intelligence","issn_l":"0004-3702","issn":["0004-3702","1872-7921"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Artificial Intelligence","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.5600000023841858}],"awards":[{"id":"https://openalex.org/G4484521401","display_name":null,"funder_award_id":"DP190100013","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G5506695369","display_name":null,"funder_award_id":"FT180100140","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G6659126982","display_name":null,"funder_award_id":"DP180103411","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"}],"funders":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1514632510","https://openalex.org/W1622225657","https://openalex.org/W1969483458","https://openalex.org/W2013451793","https://openalex.org/W2014843742","https://openalex.org/W2081751185","https://openalex.org/W2135125135","https://openalex.org/W2152679156","https://openalex.org/W2163178194","https://openalex.org/W2201539200","https://openalex.org/W2403099801","https://openalex.org/W2515498963","https://openalex.org/W2611500512","https://openalex.org/W2614653677","https://openalex.org/W2617837836","https://openalex.org/W2733911228","https://openalex.org/W2900686218","https://openalex.org/W4206908526","https://openalex.org/W4240935049","https://openalex.org/W6600457160","https://openalex.org/W6603064294","https://openalex.org/W6631972861","https://openalex.org/W6635187633","https://openalex.org/W6637922572","https://openalex.org/W6679896305","https://openalex.org/W6680140934","https://openalex.org/W6681387049","https://openalex.org/W6682000589","https://openalex.org/W6682792703","https://openalex.org/W6687222037","https://openalex.org/W6713441206","https://openalex.org/W6714121795","https://openalex.org/W6731524659","https://openalex.org/W6735010133","https://openalex.org/W6741896678","https://openalex.org/W6766491377","https://openalex.org/W6779272418","https://openalex.org/W6779935770","https://openalex.org/W6780466236","https://openalex.org/W6797666147"],"related_works":["https://openalex.org/W4385882924","https://openalex.org/W2810620529","https://openalex.org/W3199145913","https://openalex.org/W4253588386","https://openalex.org/W2385402343","https://openalex.org/W1970871823","https://openalex.org/W2391412785","https://openalex.org/W2019177547","https://openalex.org/W2375280931","https://openalex.org/W3183360588"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}