{"id":"https://openalex.org/W7130589184","doi":"https://doi.org/10.1109/ictc66702.2025.11388267","title":"Search Tree Pruning in Monotonic Planning Domains for Efficient Heuristic Search","display_name":"Search Tree Pruning in Monotonic Planning Domains for Efficient Heuristic Search","publication_year":2025,"publication_date":"2025-10-14","ids":{"openalex":"https://openalex.org/W7130589184","doi":"https://doi.org/10.1109/ictc66702.2025.11388267"},"language":null,"primary_location":{"id":"doi:10.1109/ictc66702.2025.11388267","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ictc66702.2025.11388267","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 16th International Conference on Information and Communication Technology Convergence (ICTC)","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/A5066958999","display_name":"Joonmyun Cho","orcid":null},"institutions":[{"id":"https://openalex.org/I142401562","display_name":"Electronics and Telecommunications Research Institute","ror":"https://ror.org/03ysstz10","country_code":"KR","type":"facility","lineage":["https://openalex.org/I142401562","https://openalex.org/I2801339556","https://openalex.org/I4210144908","https://openalex.org/I4387152098"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Joonmyun Cho","raw_affiliation_strings":["Electronics and Telecommunications Research Institute (ETRI),Artificial Intelligence Creative Research Laboratory,Daejeon,Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electronics and Telecommunications Research Institute (ETRI),Artificial Intelligence Creative Research Laboratory,Daejeon,Korea","institution_ids":["https://openalex.org/I142401562"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066958999"],"corresponding_institution_ids":["https://openalex.org/I142401562"],"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":"77","last_page":"81"},"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.9911999702453613,"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.9911999702453613,"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.0017000000225380063,"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.001500000013038516,"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/pruning","display_name":"Pruning","score":0.8359000086784363},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6769000291824341},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.6628999710083008},{"id":"https://openalex.org/keywords/null-move-heuristic","display_name":"Null-move heuristic","score":0.6021000146865845},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.558899998664856},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5501000285148621},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5055000185966492},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4814999997615814}],"concepts":[{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.8359000086784363},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6769000291824341},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.6628999710083008},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.6021000146865845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5949000120162964},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.558899998664856},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5501000285148621},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5055000185966492},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4814999997615814},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4729999899864197},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4408999979496002},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.42809998989105225},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4271000027656555},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.42640000581741333},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.4099999964237213},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3928999900817871},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.3425000011920929},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.33000001311302185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32280001044273376},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3167000114917755},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.31450000405311584},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.31279999017715454},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.3028999865055084},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2937999963760376},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2815000116825104},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26589998602867126},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.25119999051094055}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ictc66702.2025.11388267","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ictc66702.2025.11388267","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 16th International Conference on Information and Communication Technology Convergence (ICTC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4183398187160492,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W54586021","https://openalex.org/W132584314","https://openalex.org/W1545688112","https://openalex.org/W2034983601","https://openalex.org/W2122054842","https://openalex.org/W2161414194","https://openalex.org/W2163854321","https://openalex.org/W4406355829"],"related_works":[],"abstract_inverted_index":{"Heuristic":[0],"search":[1,12,34,153],"is":[2,14,130],"a":[3,11,25,44,107],"widely":[4],"used":[5],"framework":[6],"in":[7,113,132],"automated":[8],"planning,":[9],"where":[10,52],"tree":[13],"constructed":[15],"to":[16,24,38,57],"find":[17],"an":[18,22],"action":[19,54,66],"sequence":[20],"from":[21],"initial":[23],"goal":[26,58],"state.":[27],"However,":[28],"the":[29,33,128,136,144],"exponential":[30],"growth":[31],"of":[32,146],"space":[35],"often":[36],"leads":[37],"scalability":[39],"issues.":[40],"This":[41],"paper":[42],"proposes":[43],"pruning":[45,63],"method":[46],"tailored":[47],"for":[48,138,150,157],"monotonic":[49,115],"planning":[50,120,159],"domains,":[51,134],"every":[53],"irreversibly":[55],"contributes":[56],"achievement.":[59],"We":[60],"introduce":[61],"two":[62],"strategies:":[64],"(1)":[65],"history":[67],"inclusion,":[68],"which":[69,84],"removes":[70],"nodes":[71,87],"that":[72,112],"are":[73,94],"subsumed":[74],"by":[75,162],"newly":[76],"generated":[77],"ones,":[78],"and":[79,96,122,154],"(2)":[80],"heuristic":[81,90],"gain":[82],"equivalence,":[83],"eliminates":[85],"sibling":[86],"with":[88],"similar":[89],"effects.":[91],"These":[92],"techniques":[93],"lightweight":[95],"can":[97],"be":[98],"integrated":[99],"into":[100],"standard":[101],"planners.":[102],"Experiments":[103],"on":[104],"six":[105],"domains\u2014including":[106],"real-world":[108],"manufacturing":[109],"scenario\u2014":[110],"show":[111],"strictly":[114],"settings,":[116],"our":[117],"methods":[118],"reduce":[119],"time":[121],"node":[123],"count":[124],"significantly.":[125],"In":[126],"contrast,":[127],"impact":[129],"limited":[131],"non-monotonic":[133],"underscoring":[135],"need":[137],"structural":[139],"compatibility.":[140],"Our":[141],"findings":[142],"highlight":[143],"utility":[145],"exploiting":[147],"domain":[148],"structure":[149],"more":[151],"efficient":[152],"open":[155],"possibilities":[156],"adaptive":[158],"strategies":[160],"guided":[161],"monotonicity.":[163]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-02-20T00:00:00"}