{"id":"https://openalex.org/W3035324306","doi":"https://doi.org/10.24963/ijcai.2020/584","title":"Euclidean Pathfinding with Compressed Path Databases","display_name":"Euclidean Pathfinding with Compressed Path Databases","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3035324306","doi":"https://doi.org/10.24963/ijcai.2020/584","mag":"3035324306"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2020/584","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2020/584","pdf_url":"https://www.ijcai.org/proceedings/2020/0584.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2020/0584.pdf","any_repository_has_fulltext":true},"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":false,"raw_author_name":"Bojie Shen","raw_affiliation_strings":["Monash University, Melbourne, Australia","Faculty of Information Technology, Monash University, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Monash University, Melbourne, Australia","institution_ids":["https://openalex.org/I56590836"]},{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Melbourne, 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":["Monash University, Melbourne, Australia","Faculty of Information Technology, Monash University, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Monash University, Melbourne, Australia","institution_ids":["https://openalex.org/I56590836"]},{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Melbourne, 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 Harabor","raw_affiliation_strings":["Monash University, Melbourne, Australia","Faculty of Information Technology, Monash University, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Monash University, Melbourne, Australia","institution_ids":["https://openalex.org/I56590836"]},{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Melbourne, 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":["Monash University, Melbourne, Australia","Faculty of Information Technology, Monash University, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Monash University, Melbourne, Australia","institution_ids":["https://openalex.org/I56590836"]},{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Melbourne, Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I56590836"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4229","last_page":"4235"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9959999918937683,"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.9959999918937683,"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.987500011920929,"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.9725000262260437,"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.889724850654602},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7267639636993408},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6932647228240967},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6212945580482483},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.614047110080719},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4849262535572052},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4702754616737366},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.46743860840797424},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.42544087767601013},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4213530123233795},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.4175284504890442},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3508185148239136},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.3255684971809387},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.21884426474571228},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21293297410011292},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.1616901159286499},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1558522880077362},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.1179475486278534},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0846838653087616},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07687151432037354}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.889724850654602},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7267639636993408},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6932647228240967},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6212945580482483},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.614047110080719},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4849262535572052},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4702754616737366},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.46743860840797424},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.42544087767601013},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4213530123233795},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.4175284504890442},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3508185148239136},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.3255684971809387},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.21884426474571228},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21293297410011292},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.1616901159286499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1558522880077362},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.1179475486278534},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0846838653087616},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07687151432037354},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.0},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.24963/ijcai.2020/584","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2020/584","pdf_url":"https://www.ijcai.org/proceedings/2020/0584.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},{"id":"pmh:oai:monash.edu:publications/e4b7e3e9-4ffb-4619-b435-f426fed656ac","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85097336030&partnerID=8YFLogxK","pdf_url":"https://researchmgt.monash.edu/ws/files/333058900/330802971_oa.pdf","source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"contributionToPeriodical"},{"id":"pmh:oai:monash.edu:openaire/e4b7e3e9-4ffb-4619-b435-f426fed656ac","is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/e4b7e3e9-4ffb-4619-b435-f426fed656ac","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2020/584","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2020/584","pdf_url":"https://www.ijcai.org/proceedings/2020/0584.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3035324306.pdf","grobid_xml":"https://content.openalex.org/works/W3035324306.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1484225231","https://openalex.org/W1514632510","https://openalex.org/W1533193441","https://openalex.org/W1622225657","https://openalex.org/W1969483458","https://openalex.org/W2133989630","https://openalex.org/W2135125135","https://openalex.org/W2145585184","https://openalex.org/W2189503459","https://openalex.org/W2201539200","https://openalex.org/W2403099801","https://openalex.org/W2403965215","https://openalex.org/W2566652907","https://openalex.org/W2741438308","https://openalex.org/W2953083820","https://openalex.org/W2966216482","https://openalex.org/W3103759471"],"related_works":["https://openalex.org/W2512285581","https://openalex.org/W4402599120","https://openalex.org/W2605563323","https://openalex.org/W2383519316","https://openalex.org/W3088868185","https://openalex.org/W2350354796","https://openalex.org/W2356287045","https://openalex.org/W78690942","https://openalex.org/W2974085611","https://openalex.org/W4221129498"],"abstract_inverted_index":{"We":[0],"consider":[1],"optimal":[2,90],"and":[3,34,39,50,66,86],"anytime":[4,118],"algorithms":[5],"for":[6,46,89,117],"the":[7,37,73,79,92],"Euclidean":[8],"Shortest":[9],"Path":[10,41],"Problem":[11],"(ESPP)":[12],"in":[13],"two":[14,21],"dimensions.":[15],"Our":[16],"approach":[17],"leverages":[18],"ideas":[19],"from":[20,107],"recent":[22,101],"works:":[23],"Polyanya,":[24],"a":[25,43,62,98],"mesh-based":[26],"ESPP":[27,102],"planner":[28],"which":[29,53],"we":[30,54,69,126],"use":[31],"to":[32,56,84,110],"represent":[33],"reason":[35],"about":[36],"environment,":[38],"Compressed":[40],"Databases,":[42],"speedup":[44],"technique":[45],"pathfinding":[47],"on":[48],"grids":[49],"spatial":[51],"networks,":[52],"exploit":[55],"compute":[57],"fast":[58],"candidate":[59],"paths.":[60],"In":[61],"range":[63,99],"of":[64,100,114],"experiments":[65],"empirical":[67],"comparisons":[68],"show":[70],"that:":[71],"(i)":[72],"auxiliary":[74],"data":[75],"structures":[76],"required":[77],"by":[78],"new":[80,93],"method":[81],"are":[82,123],"cheap":[83],"build":[85],"store;":[87],"(ii)":[88],"search,":[91,119],"algorithm":[94],"is":[95],"faster":[96],"than":[97],"planners,":[103],"with":[104],"speedups":[105],"ranging":[106],"several":[108],"factors":[109],"over":[111],"one":[112],"order":[113],"magnitude;":[115],"(iii)":[116],"where":[120],"feasible":[121],"solutions":[122],"needed":[124],"fast,":[125],"report":[127],"even":[128],"better":[129],"runtimes.":[130]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}