{"id":"https://openalex.org/W4405778243","doi":"https://doi.org/10.1109/iros58592.2024.10801607","title":"Multi-Stage Monte Carlo Tree Search for Non-Monotone Object Rearrangement Planning in Narrow Confined Environments","display_name":"Multi-Stage Monte Carlo Tree Search for Non-Monotone Object Rearrangement Planning in Narrow Confined Environments","publication_year":2024,"publication_date":"2024-10-14","ids":{"openalex":"https://openalex.org/W4405778243","doi":"https://doi.org/10.1109/iros58592.2024.10801607"},"language":"en","primary_location":{"id":"doi:10.1109/iros58592.2024.10801607","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros58592.2024.10801607","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5032846386","display_name":"Hanwen Ren","orcid":"https://orcid.org/0000-0003-3308-3706"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hanwen Ren","raw_affiliation_strings":["Purdue University,Department of Computer Science,West Lafayette,IN,USA,47907"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University,Department of Computer Science,West Lafayette,IN,USA,47907","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056336556","display_name":"Ahmed H. Qureshi","orcid":"https://orcid.org/0000-0003-2104-2333"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ahmed H. Qureshi","raw_affiliation_strings":["Purdue University,Department of Computer Science,West Lafayette,IN,USA,47907"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University,Department of Computer Science,West Lafayette,IN,USA,47907","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":17.785,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.98979964,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"12078","last_page":"12085"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9685999751091003,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9685999751091003,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.6372904777526855},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6036902070045471},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5704021453857422},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5145372748374939},{"id":"https://openalex.org/keywords/stage","display_name":"Stage (stratigraphy)","score":0.5054564476013184},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.4823610186576843},{"id":"https://openalex.org/keywords/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.4295912981033325},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3284314274787903},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3257475793361664},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31820350885391235},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25500762462615967},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19299852848052979},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.17429029941558838},{"id":"https://openalex.org/keywords/geology","display_name":"Geology","score":0.10130569338798523}],"concepts":[{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.6372904777526855},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6036902070045471},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5704021453857422},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5145372748374939},{"id":"https://openalex.org/C146357865","wikidata":"https://www.wikidata.org/wiki/Q1123245","display_name":"Stage (stratigraphy)","level":2,"score":0.5054564476013184},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.4823610186576843},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.4295912981033325},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3284314274787903},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3257475793361664},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31820350885391235},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25500762462615967},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19299852848052979},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.17429029941558838},{"id":"https://openalex.org/C127313418","wikidata":"https://www.wikidata.org/wiki/Q1069","display_name":"Geology","level":0,"score":0.10130569338798523},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros58592.2024.10801607","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros58592.2024.10801607","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7900000214576721,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1989604857","https://openalex.org/W2044725657","https://openalex.org/W2083093559","https://openalex.org/W2087191078","https://openalex.org/W2126316555","https://openalex.org/W2140291705","https://openalex.org/W2141841102","https://openalex.org/W2155752816","https://openalex.org/W2293698677","https://openalex.org/W2396961959","https://openalex.org/W2418783521","https://openalex.org/W2604712483","https://openalex.org/W2736647539","https://openalex.org/W2793704326","https://openalex.org/W2902907165","https://openalex.org/W2953431737","https://openalex.org/W2986717012","https://openalex.org/W3012008866","https://openalex.org/W3113042792","https://openalex.org/W3128894241","https://openalex.org/W3133137374","https://openalex.org/W3173991492","https://openalex.org/W3183217451","https://openalex.org/W3189699967","https://openalex.org/W3203645530","https://openalex.org/W3206144464","https://openalex.org/W3206916018","https://openalex.org/W3209765550","https://openalex.org/W3212977909","https://openalex.org/W4240202985","https://openalex.org/W4247855592","https://openalex.org/W4312712280","https://openalex.org/W4312891162","https://openalex.org/W6709231133","https://openalex.org/W6751798860","https://openalex.org/W6785308759"],"related_works":["https://openalex.org/W2571592646","https://openalex.org/W4247855592","https://openalex.org/W2740304877","https://openalex.org/W2978000411","https://openalex.org/W4226164546","https://openalex.org/W2766259847","https://openalex.org/W2112583639","https://openalex.org/W2567165815","https://openalex.org/W346633817","https://openalex.org/W2563266764"],"abstract_inverted_index":{"Non-monotone":[0],"object":[1,30,54,72,116,145],"rearrangement":[2,55,117],"planning":[3,56,85,138],"in":[4,19,58,134,167],"confined":[5,59],"spaces":[6],"such":[7],"as":[8],"cabinets":[9],"and":[10,25,86,98,122,148,163],"shelves":[11],"is":[12,91],"a":[13,43,159],"widely":[14],"occurring":[15],"but":[16],"challenging":[17],"problem":[18,66],"robotics.":[20],"Both":[21],"the":[22,26,37,64,83,87,95,101,106,109,131,137,140,144,149],"robot":[23,89,161],"motion":[24,90],"available":[27],"regions":[28],"for":[29],"relocation":[31],"are":[32],"highly":[33],"constrained":[34],"because":[35],"of":[36,136,142],"limited":[38],"space.":[39],"This":[40],"work":[41],"proposes":[42],"Multi-Stage":[44],"Monte":[45],"Carlo":[46],"Tree":[47],"Search":[48],"(MS-MCTS)":[49],"method":[50,113,129],"to":[51,93,158],"solve":[52],"non-monotone":[53],"problems":[57],"spaces.":[60],"Our":[61],"approach":[62],"decouples":[63],"complex":[65],"into":[67,108],"simpler":[68],"subproblems":[69],"using":[70],"an":[71],"stage":[73],"topology.":[74],"A":[75],"subgoal-focused":[76],"tree":[77],"expansion":[78],"algorithm":[79],"that":[80,127],"jointly":[81],"considers":[82],"high-level":[84],"low-level":[88],"designed":[92],"reduce":[94],"search":[96,102],"space":[97],"better":[99],"guide":[100],"process.":[103],"By":[104],"fitting":[105],"task":[107],"MCTS":[110],"paradigm,":[111],"our":[112,128,156],"generates":[114],"short":[115],"sequences":[118],"by":[119],"balancing":[120],"exploration":[121],"exploitation.":[123],"The":[124],"experiments":[125],"demonstrate":[126],"outperforms":[130],"existing":[132],"methods":[133],"terms":[135],"time,":[139],"number":[141],"steps,":[143],"moving":[146,151],"distance":[147],"gripper":[150],"distance.":[152],"Moreover,":[153],"we":[154],"deploy":[155],"MS-MCTS":[157],"real-world":[160],"system":[162],"verify":[164],"its":[165],"performance":[166],"different":[168],"scenarios.":[169]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}