{"id":"https://openalex.org/W3115205491","doi":"https://doi.org/10.2312/pg.20201228","title":"Using Landmarks for Near-Optimal Pathfinding on the CPU and GPU","display_name":"Using Landmarks for Near-Optimal Pathfinding on the CPU and GPU","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3115205491","doi":"https://doi.org/10.2312/pg.20201228","mag":"3115205491"},"language":"en","primary_location":{"id":"doi:10.2312/pg.20201228","is_oa":true,"landing_page_url":"https://doi.org/10.2312/pg.20201228","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/pg.20201228","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102795424","display_name":"Maximilian Reischl","orcid":"https://orcid.org/0000-0002-1635-2380"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Reischl, Maximilian","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003621581","display_name":"Christian Knauer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Knauer, Christian","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5037008068","display_name":"Michael Guthe","orcid":"https://orcid.org/0000-0002-9472-2535"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guthe, Michael","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102795424"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15486993,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"37","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9825999736785889,"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.9825999736785889,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.6773956418037415},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6664361357688904},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.510321319103241},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.433625191450119},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.40181228518486023},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36616069078445435},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1191948652267456}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.6773956418037415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6664361357688904},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.510321319103241},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.433625191450119},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.40181228518486023},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36616069078445435},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1191948652267456},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2312/pg.20201228","is_oa":true,"landing_page_url":"https://doi.org/10.2312/pg.20201228","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:3115205491","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/pg/pg2020s.html#ReischlKG20","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.2312/pg.20201228","is_oa":true,"landing_page_url":"https://doi.org/10.2312/pg.20201228","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1533802931","https://openalex.org/W3101919183","https://openalex.org/W2116721352","https://openalex.org/W1578378833","https://openalex.org/W2760148299","https://openalex.org/W2074140323","https://openalex.org/W1884976205","https://openalex.org/W1610698205","https://openalex.org/W3129915534","https://openalex.org/W2990999343","https://openalex.org/W2342373291","https://openalex.org/W2119141695","https://openalex.org/W3141054651","https://openalex.org/W2059667767","https://openalex.org/W2007000019","https://openalex.org/W2225892715","https://openalex.org/W2939965008","https://openalex.org/W2483136543","https://openalex.org/W2036022226","https://openalex.org/W2024443272"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,57,71],"new":[3],"approach":[4,44,84],"for":[5,48],"path":[6],"finding":[7],"in":[8],"weighted":[9],"graphs":[10],"using":[11,64],"pre-computed":[12],"minimal":[13,21,75],"distance":[14,22],"fields.":[15],"By":[16,69],"selecting":[17],"the":[18,37,82,86,91],"most":[19],"promising":[20],"field":[23],"at":[24],"any":[25],"given":[26],"node":[27],"and":[28,52,55,74],"switching":[29],"between":[30],"them,":[31],"our":[32],"algorithm":[33],"tries":[34],"to":[35,80],"find":[36],"shortest":[38],"path.":[39],"As":[40],"we":[41,77],"show,":[42],"this":[43],"scales":[45],"very":[46],"well":[47],"different":[49],"topologies,":[50],"hardware":[51],"graph":[53],"sizes":[54],"has":[56],"mean":[58],"length":[59],"error":[60],"below":[61],"1%":[62],"while":[63],"reasonable":[65],"amounts":[66],"of":[67],"memory.":[68],"keeping":[70],"simple":[72],"structure":[73],"backtracking,":[76],"are":[78],"able":[79],"use":[81],"same":[83],"on":[85],"massively":[87],"parallel":[88],"GPU,":[89],"reducing":[90],"run":[92],"time":[93],"even":[94],"further.":[95]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}