{"id":"https://openalex.org/W4414360494","doi":"https://doi.org/10.24963/ijcai.2025/1004","title":"Attractor-based Closed List Search: Sparsifying the Closed List for Efficient Memory-Constrained Planning","display_name":"Attractor-based Closed List Search: Sparsifying the Closed List for Efficient Memory-Constrained Planning","publication_year":2025,"publication_date":"2025-09-01","ids":{"openalex":"https://openalex.org/W4414360494","doi":"https://doi.org/10.24963/ijcai.2025/1004"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2025/1004","is_oa":false,"landing_page_url":"https://doi.org/10.24963/ijcai.2025/1004","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","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/A5119679447","display_name":"Alvin Zou","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alvin Zou","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034152539","display_name":"Muhammad Suhail Saleem","orcid":"https://orcid.org/0000-0002-5698-6759"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Muhammad Suhail Saleem","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103257510","display_name":"Maxim Likhachev","orcid":"https://orcid.org/0000-0002-9539-2398"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maxim Likhachev","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11670376,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"9031","last_page":"9038"},"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.9975000023841858,"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.9975000023841858,"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.9894000291824341,"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/T11106","display_name":"Data Management and Algorithms","score":0.9847000241279602,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6197999715805054},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.42489999532699585},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.42089998722076416},{"id":"https://openalex.org/keywords/attractor","display_name":"Attractor","score":0.3718000054359436},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.35409998893737793},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3167000114917755},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.31630000472068787}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7717000246047974},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6197999715805054},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.42489999532699585},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42089998722076416},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.375},{"id":"https://openalex.org/C164380108","wikidata":"https://www.wikidata.org/wiki/Q507187","display_name":"Attractor","level":2,"score":0.3718000054359436},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36469998955726624},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.35409998893737793},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3167000114917755},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.31630000472068787},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.31139999628067017},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3034999966621399},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29350000619888306},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2913999855518341},{"id":"https://openalex.org/C164953516","wikidata":"https://www.wikidata.org/wiki/Q320357","display_name":"Closed set","level":2,"score":0.2799000144004822},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.25780001282691956},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.25360000133514404}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2025/1004","is_oa":false,"landing_page_url":"https://doi.org/10.24963/ijcai.2025/1004","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Best-first":[0],"search":[1],"algorithms":[2],"such":[3,25,65],"as":[4,26],"A*":[5,8],"and":[6,33,163,171,176,207],"Weighted":[7,161],"are":[9],"widely":[10],"used":[11,156],"tools.":[12],"However,":[13,64],"their":[14],"high":[15],"memory":[16,188],"requirements":[17],"often":[18,67],"make":[19],"them":[20],"impractical":[21],"for":[22,29,76],"memory-constrained":[23],"applications,":[24],"on-board":[27],"planning":[28,148,205],"interplanetary":[30],"rovers,":[31],"drones,":[32],"embedded":[34],"systems.":[35],"One":[36],"popular":[37],"strategy":[38],"among":[39],"memory-efficient":[40],"approaches":[41],"developed":[42],"to":[43,48],"address":[44],"this":[45,80],"challenge":[46],"is":[47],"eliminate":[49],"or":[50],"sparsify":[51],"the":[52,62,95,124,127,139,152,194],"Closed":[53,85,96,200],"list,":[54,201],"a":[55,89,99,112,133,199],"structure":[56],"that":[57,92,114,184],"tracks":[58],"states":[59,110,143,195],"explored":[60],"by":[61],"search.":[63],"methods":[66],"incur":[68],"substantial":[69],"overhead":[70],"in":[71,111,157,198],"runtime,":[72],"requiring":[73],"recursive":[74],"searches":[75,165],"solution":[77,117],"reconstruction.":[78],"In":[79],"work,":[81],"we":[82,130],"propose":[83],"Attractor-based":[84],"List":[86],"Search":[87],"(ACLS),":[88],"novel":[90],"framework":[91],"sparsely":[93],"represents":[94],"list":[97],"using":[98],"small":[100],"subset":[101],"of":[102,126,141,154,178,193],"states,":[103],"termed":[104],"attractors.":[105],"ACLS":[106,155,185],"intelligently":[107],"identifies":[108],"attractor":[109,142],"way":[113],"enables":[115],"efficient":[116],"reconstruction":[118],"while":[119,202],"preserving":[120],"theoretical":[121],"guarantees":[122],"on":[123],"quality":[125],"solution.":[128],"Furthermore,":[129],"also":[131],"introduce":[132],"lazy":[134],"variant,":[135],"Lazy-ACLS,":[136],"which":[137],"defers":[138],"computation":[140],"until":[144],"necessary,":[145],"substantially":[146],"improving":[147],"speed.":[149],"We":[150],"demonstrate":[151,183],"efficacy":[153],"conjunction":[158],"with":[159],"A*,":[160,162],"Dijkstra\u2019s":[164],"across":[166],"multiple":[167],"domains":[168],"including":[169],"2D":[170],"3D":[172],"navigation,":[173],"Sliding":[174],"Tiles,":[175],"Towers":[177],"Hanoi.":[179],"Our":[180],"experimental":[181],"results":[182],"significantly":[186],"reduces":[187],"usage,":[189],"maintaining":[190],"only":[191],"9%":[192],"typically":[196],"stored":[197],"achieving":[203],"comparable":[204],"times":[206],"outperforming":[208],"state-of-the-art":[209],"approaches.":[210],"Source":[211],"code":[212],"can":[213],"be":[214],"found":[215],"at":[216],"github.com/alvin-ruihua-zou/ACLS.":[217]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}