{"id":"https://openalex.org/W1985209393","doi":"https://doi.org/10.1145/1496984.1496987","title":"Combining heuristic and landmark search for path planning","display_name":"Combining heuristic and landmark search for path planning","publication_year":2008,"publication_date":"2008-11-03","ids":{"openalex":"https://openalex.org/W1985209393","doi":"https://doi.org/10.1145/1496984.1496987","mag":"1985209393"},"language":"en","primary_location":{"id":"doi:10.1145/1496984.1496987","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1496984.1496987","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 Conference on Future Play: Research, Play, Share","raw_type":"proceedings-article"},"type":"conference-paper","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/A5101806154","display_name":"Kevin Grant","orcid":"https://orcid.org/0000-0001-8961-8293"},"institutions":[{"id":"https://openalex.org/I107949126","display_name":"University of Lethbridge","ror":"https://ror.org/044j76961","country_code":"CA","type":"education","lineage":["https://openalex.org/I107949126"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kevin Grant","raw_affiliation_strings":["University of Lethbridge, Lethbridge, AB, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Lethbridge, Lethbridge, AB, Canada","institution_ids":["https://openalex.org/I107949126"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007423253","display_name":"David Mould","orcid":"https://orcid.org/0000-0001-5779-484X"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"David Mould","raw_affiliation_strings":["Carleton University, Ottawa, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carleton University, Ottawa, ON, Canada","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.05736288,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"9","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.998199999332428,"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.998199999332428,"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.992900013923645,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.968999981880188,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.8330895900726318},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.795985221862793},{"id":"https://openalex.org/keywords/null-move-heuristic","display_name":"Null-move heuristic","score":0.7772291898727417},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.753176212310791},{"id":"https://openalex.org/keywords/landmark","display_name":"Landmark","score":0.7244689464569092},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6211854815483093},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5920185446739197},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.5872146487236023},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5690122842788696},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4756971299648285},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.45039552450180054},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4389024078845978},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40328776836395264},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.40095070004463196},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32390427589416504},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24130931496620178}],"concepts":[{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.8330895900726318},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.795985221862793},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.7772291898727417},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.753176212310791},{"id":"https://openalex.org/C2780297707","wikidata":"https://www.wikidata.org/wiki/Q4895393","display_name":"Landmark","level":2,"score":0.7244689464569092},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6211854815483093},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5920185446739197},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.5872146487236023},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5690122842788696},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4756971299648285},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.45039552450180054},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4389024078845978},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40328776836395264},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.40095070004463196},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32390427589416504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24130931496620178},{"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.1145/1496984.1496987","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1496984.1496987","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 Conference on Future Play: Research, Play, Share","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"No poverty","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/1"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1561255266","https://openalex.org/W1969483458","https://openalex.org/W2007572995","https://openalex.org/W2014889099","https://openalex.org/W2022980325","https://openalex.org/W2122410182","https://openalex.org/W2169528473","https://openalex.org/W4240825905","https://openalex.org/W6678087030","https://openalex.org/W6685290738"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W2400861930","https://openalex.org/W3111117784","https://openalex.org/W2224555876","https://openalex.org/W1622225657","https://openalex.org/W4399426282","https://openalex.org/W2038323771","https://openalex.org/W2885402535","https://openalex.org/W4302010637","https://openalex.org/W2402589461"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,23,66],"hybridization":[3],"of":[4,26,43,55,99,112],"heuristic":[5,14,34,45,71,84],"search":[6,15,35],"and":[7,21],"the":[8,33,38,44,53,56,59,70,76,83,88,96,110,113],"LPI":[9,100],"algorithm.":[10],"Our":[11],"approach":[12],"uses":[13],"to":[16,19,29,61],"find":[17],"paths":[18],"landmarks,":[20],"employs":[22],"small":[24],"amount":[25],"landmark":[27],"information":[28],"correct":[30],"itself":[31],"when":[32,82],"deviates":[36],"from":[37],"shortest":[39],"path.":[40],"The":[41],"use":[42,54],"allows":[46],"lower":[47],"memory":[48,97],"usage":[49,98],"than":[50,106],"LPI,":[51],"while":[52,108],"landmarks":[57],"permits":[58],"algorithm":[60,77,89],"operate":[62],"effectively":[63],"even":[64],"with":[65],"poor":[67],"heuristic.":[68],"When":[69],"accuracy":[72,85,111],"is":[73,86],"very":[74],"high,":[75],"tends":[78,90],"towards":[79,91],"greedy":[80],"search;":[81],"low,":[87],"LPI.":[92],"Experiments":[93],"show":[94],"that":[95],"can":[101],"be":[102],"reduced":[103],"by":[104],"more":[105],"half":[107],"preserving":[109],"solutions.":[114]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}