{"id":"https://openalex.org/W7163169485","doi":"https://doi.org/10.48550/arxiv.2606.02438","title":"LLM-Evolved Pattern Generators for Optimal Classical Planning","display_name":"LLM-Evolved Pattern Generators for Optimal Classical Planning","publication_year":2026,"publication_date":"2026-06-01","ids":{"openalex":"https://openalex.org/W7163169485","doi":"https://doi.org/10.48550/arxiv.2606.02438"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.02438","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.02438","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.02438","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5118844667","display_name":"Windy Phung","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Phung, Windy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137689278","display_name":"Dominik Drexler","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Drexler, Dominik","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137642456","display_name":"Arnaud Lequen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lequen, Arnaud","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5031089257","display_name":"Jendrik Seipp","orcid":"https://orcid.org/0000-0002-2498-8020"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Seipp, Jendrik","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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.9922000169754028,"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.9922000169754028,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.0015999999595806003,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.0013000000035390258,"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/heuristics","display_name":"Heuristics","score":0.8838000297546387},{"id":"https://openalex.org/keywords/satisficing","display_name":"Satisficing","score":0.6901000142097473},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6211000084877014},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5674999952316284},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5088000297546387},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5016000270843506},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4765999913215637}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8838000297546387},{"id":"https://openalex.org/C94822996","wikidata":"https://www.wikidata.org/wiki/Q1777902","display_name":"Satisficing","level":2,"score":0.6901000142097473},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6211000084877014},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.580299973487854},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5674999952316284},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5418999791145325},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5088000297546387},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5016000270843506},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4765999913215637},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4645000100135803},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.43149998784065247},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3610999882221222},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.36010000109672546},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.30820000171661377},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.2996000051498413},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29840001463890076},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2937999963760376},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.28690001368522644},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.274399995803833},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2574000060558319},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2565000057220459}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.02438","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.02438","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.02438","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.02438","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Learned":[0],"heuristics":[1,11,43,131],"have":[2],"recently":[3],"become":[4],"a":[5,61,90,94],"competitive":[6],"alternative":[7],"to":[8,66,71,85],"traditional":[9],"domain-independent":[10,138],"for":[12,31,40,87,97],"satisficing":[13],"planning.":[14,34],"Existing":[15],"approaches,":[16],"however,":[17],"focus":[18],"on":[19,140],"improving":[20],"search":[21],"guidance":[22],"rather":[23],"than":[24],"guaranteeing":[25],"admissibility,":[26],"which":[27],"makes":[28],"them":[29],"unsuitable":[30],"optimal":[32],"classical":[33],"We":[35,78],"present":[36],"the":[37,52,106,115,134],"first":[38],"method":[39],"learning":[41,60],"domain-dependent":[42],"that":[44,74,92,101,132],"are":[45],"admissible":[46,76],"by":[47],"design":[48],"and":[49,103,129],"thus":[50],"preserve":[51],"optimality":[53],"guarantees":[54],"of":[55,59,136],"A*":[56],"search.":[57],"Instead":[58],"direct":[62],"mapping":[63],"from":[64],"states":[65],"heuristic":[67],"values,":[68],"we":[69,104],"learn":[70],"construct":[72],"abstractions":[73],"induce":[75],"heuristics.":[77],"use":[79],"an":[80],"LLM-driven":[81],"evolutionary":[82],"program-synthesis":[83],"framework":[84],"obtain,":[86],"each":[88,145],"domain,":[89,102],"program":[91],"produces":[93],"pattern":[95],"collection":[96],"any":[98],"task":[99],"in":[100],"combine":[105],"resulting":[107],"patterns":[108],"admissibly":[109],"via":[110],"saturated":[111],"cost":[112],"partitioning.":[113],"Empirically,":[114],"learned":[116],"programs":[117],"encode":[118],"interpretable":[119],"domain-specific":[120],"insights,":[121],"run":[122],"with":[123],"negligible":[124],"overhead":[125],"at":[126],"test":[127],"time":[128],"yield":[130],"match":[133],"coverage":[135],"state-of-the-art":[137],"baselines":[139],"several":[141],"domains":[142],"while":[143],"evaluating":[144],"state":[146],"substantially":[147],"faster.":[148]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-03T00:00:00"}