{"id":"https://openalex.org/W4387171431","doi":"https://doi.org/10.3233/faia230569","title":"A Landmark-Cut Heuristic for Lifted Optimal Planning","display_name":"A Landmark-Cut Heuristic for Lifted Optimal Planning","publication_year":2023,"publication_date":"2023-09-28","ids":{"openalex":"https://openalex.org/W4387171431","doi":"https://doi.org/10.3233/faia230569"},"language":"en","primary_location":{"id":"doi:10.3233/faia230569","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3233/faia230569","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA230569","source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA230569","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068500036","display_name":"Julia Wichlacz","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Julia Wichlacz","raw_affiliation_strings":["Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065705708","display_name":"Daniel H\u00f6ller","orcid":"https://orcid.org/0000-0002-2776-9288"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel H\u00f6ller","raw_affiliation_strings":["Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039603974","display_name":"Daniel Fi\u0161er","orcid":"https://orcid.org/0000-0003-2383-9477"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Fi\u0161er","raw_affiliation_strings":["Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076532681","display_name":"J\u00f6rg Hoffmann","orcid":"https://orcid.org/0000-0003-1590-5876"},"institutions":[{"id":"https://openalex.org/I33256026","display_name":"German Research Centre for Artificial Intelligence","ror":"https://ror.org/01ayc5b57","country_code":"DE","type":"funder","lineage":["https://openalex.org/I33256026"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J\u00f6rg Hoffmann","raw_affiliation_strings":["German Research Center for Artificial Intelligence (DFKI), Saarbr\u00fccken, Germany","Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"German Research Center for Artificial Intelligence (DFKI), Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I33256026"]},{"raw_affiliation_string":"Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068500036"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.35462337,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9990000128746033,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9812999963760376,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9535999894142151,"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/heuristic","display_name":"Heuristic","score":0.8420138955116272},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6104754209518433},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.587736964225769},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.574508547782898},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5650076270103455},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5465091466903687},{"id":"https://openalex.org/keywords/satisficing","display_name":"Satisficing","score":0.5083696246147156},{"id":"https://openalex.org/keywords/landmark","display_name":"Landmark","score":0.5048330426216125},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4969816505908966},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.4892110824584961},{"id":"https://openalex.org/keywords/null-move-heuristic","display_name":"Null-move heuristic","score":0.48063865303993225},{"id":"https://openalex.org/keywords/forward-chaining","display_name":"Forward chaining","score":0.4717061221599579},{"id":"https://openalex.org/keywords/chaining","display_name":"Chaining","score":0.4562155306339264},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35584330558776855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31627586483955383},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.2775533199310303},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26828473806381226},{"id":"https://openalex.org/keywords/expert-system","display_name":"Expert system","score":0.1370217502117157},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.10474079847335815},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.05955609679222107}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.8420138955116272},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6104754209518433},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.587736964225769},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.574508547782898},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5650076270103455},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5465091466903687},{"id":"https://openalex.org/C94822996","wikidata":"https://www.wikidata.org/wiki/Q1777902","display_name":"Satisficing","level":2,"score":0.5083696246147156},{"id":"https://openalex.org/C2780297707","wikidata":"https://www.wikidata.org/wiki/Q4895393","display_name":"Landmark","level":2,"score":0.5048330426216125},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4969816505908966},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.4892110824584961},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.48063865303993225},{"id":"https://openalex.org/C142614401","wikidata":"https://www.wikidata.org/wiki/Q777433","display_name":"Forward chaining","level":3,"score":0.4717061221599579},{"id":"https://openalex.org/C49020025","wikidata":"https://www.wikidata.org/wiki/Q1059099","display_name":"Chaining","level":2,"score":0.4562155306339264},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35584330558776855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31627586483955383},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.2775533199310303},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26828473806381226},{"id":"https://openalex.org/C58328972","wikidata":"https://www.wikidata.org/wiki/Q184609","display_name":"Expert system","level":2,"score":0.1370217502117157},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.10474079847335815},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.05955609679222107},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/faia230569","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3233/faia230569","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA230569","source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},{"id":"doi:10.22028/d291-48305","is_oa":true,"landing_page_url":"https://doi.org/10.22028/d291-48305","pdf_url":null,"source":{"id":"https://openalex.org/S4377196499","display_name":"Publications of the UdS (Saarland University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I91712215","host_organization_name":"Saarland University","host_organization_lineage":["https://openalex.org/I91712215"],"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":"Collection"}],"best_oa_location":{"id":"doi:10.3233/faia230569","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3233/faia230569","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA230569","source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7599999904632568}],"awards":[{"id":"https://openalex.org/G1951765764","display_name":null,"funder_award_id":"SFB 1102","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G737504480","display_name":"SFB 1102: Informationsdichte und sprachliche Kodierung","funder_award_id":"232722074","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4387171431.pdf","grobid_xml":"https://content.openalex.org/works/W4387171431.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W4789806","https://openalex.org/W53694208","https://openalex.org/W132584314","https://openalex.org/W171084703","https://openalex.org/W1501886372","https://openalex.org/W1504269031","https://openalex.org/W1545688112","https://openalex.org/W2097465719","https://openalex.org/W2122054842","https://openalex.org/W2130831265","https://openalex.org/W2161759936","https://openalex.org/W2163854321","https://openalex.org/W2211525523","https://openalex.org/W2623293810","https://openalex.org/W2908250557","https://openalex.org/W2966727130","https://openalex.org/W3037734777","https://openalex.org/W3101355526","https://openalex.org/W3106271432","https://openalex.org/W3176339341","https://openalex.org/W3190409297","https://openalex.org/W4283793299","https://openalex.org/W4283793735","https://openalex.org/W4312667754"],"related_works":["https://openalex.org/W3027955895","https://openalex.org/W2886511220","https://openalex.org/W3159334695","https://openalex.org/W2621131456","https://openalex.org/W4238340239","https://openalex.org/W2613924724","https://openalex.org/W4321015609","https://openalex.org/W4319659930","https://openalex.org/W4296096530","https://openalex.org/W2472912427"],"abstract_inverted_index":{"Lifted":[0],"planning":[1],"\u2013":[2,11],"finding":[3],"plans":[4],"directly":[5],"on":[6,45],"the":[7,17,22,34,66,87,98,107,116],"PDDL":[8],"input":[9],"model":[10],"has":[12,43,70],"attracted":[13],"renewed":[14],"attention":[15],"during":[16],"last":[18],"years.":[19],"This":[20],"avoids":[21],"process":[23],"of":[24,37,91,115],"grounding,":[25],"which":[26,69],"can":[27],"become":[28],"computationally":[29],"prohibitive":[30],"very":[31,72],"easily.":[32],"However,":[33,95],"main":[35],"focus":[36],"recent":[38],"research":[39],"in":[40,74,135],"this":[41,104],"area":[42],"been":[44,71],"satisficing,":[46],"i.e.,":[47],"(potentially)":[48],"suboptimal":[49],"planning.":[50,59,77],"We":[51,125],"present":[52],"a":[53,136],"novel":[54],"heuristic":[55,109,118,129],"for":[56,112],"optimal":[57,76,138],"lifted":[58],"Our":[60],"basic":[61],"idea":[62],"is":[63,101,120,130],"inspired":[64],"by":[65],"LM-cut":[67,117],"heuristic,":[68],"successful":[73],"grounded":[75,93],"Like":[78],"LM-cut,":[79],"we":[80],"generate":[81],"cut-based":[82],"landmarks":[83],"via":[84],"back-chaining":[85],"from":[86],"goal,":[88],"generating":[89],"cuts":[90],"partially":[92],"actions.":[94],"exactly":[96],"mimicking":[97],"ground":[99],"formulation":[100],"not":[102],"feasible,":[103],"includes":[105],"computing":[106],"hmax":[108],"several":[110],"times":[111],"one":[113],"computation":[114],"(which":[119],"already":[121],"NP-hard":[122],"to":[123],"compute).":[124],"show":[126],"that":[127],"our":[128],"admissible":[131],"and":[132],"evaluate":[133],"it":[134],"cost":[137],"setting.":[139]},"counts_by_year":[],"updated_date":"2026-08-14T07:06:38.338062","created_date":"2025-10-10T00:00:00"}