{"id":"https://openalex.org/W2418783521","doi":"https://doi.org/10.1109/icra.2016.7487581","title":"Efficiently solving general rearrangement tasks: A fast extension primitive for an incremental sampling-based planner","display_name":"Efficiently solving general rearrangement tasks: A fast extension primitive for an incremental sampling-based planner","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2418783521","doi":"https://doi.org/10.1109/icra.2016.7487581","mag":"2418783521"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2016.7487581","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2016.7487581","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Robotics and Automation (ICRA)","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/A5023584859","display_name":"Athanasios Krontiris","orcid":"https://orcid.org/0000-0002-9655-8273"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Athanasios Krontiris","raw_affiliation_strings":["Computer Science Department of Rutgers, The State University of New Jersey, Piscataway, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department of Rutgers, The State University of New Jersey, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010667333","display_name":"Kostas E. Bekris","orcid":"https://orcid.org/0000-0002-0675-3324"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kostas E. Bekris","raw_affiliation_strings":["Computer Science Department of Rutgers, The State University of New Jersey, Piscataway, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department of Rutgers, The State University of New Jersey, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":71,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3924","last_page":"3931"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9965000152587891,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9725000262260437,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/backtracking","display_name":"Backtracking","score":0.863656759262085},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6960226893424988},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.6194591522216797},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5127240419387817},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5025908946990967},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48927924036979675},{"id":"https://openalex.org/keywords/epigraph","display_name":"Epigraph","score":0.4650641083717346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4484637677669525},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.4338114261627197},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4175829589366913},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4166823625564575},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3923090994358063},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38661688566207886},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.30777499079704285},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14656731486320496}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.863656759262085},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6960226893424988},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.6194591522216797},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5127240419387817},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5025908946990967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48927924036979675},{"id":"https://openalex.org/C17192189","wikidata":"https://www.wikidata.org/wiki/Q1347059","display_name":"Epigraph","level":2,"score":0.4650641083717346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4484637677669525},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.4338114261627197},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4175829589366913},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4166823625564575},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3923090994358063},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38661688566207886},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.30777499079704285},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14656731486320496},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra.2016.7487581","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2016.7487581","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},{"id":"pmh:oai:alma.01RUT_INST:11665238550004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/conferenceProceeding/Efficiently-solving-general-rearrangement-tasks-A/991031666223904646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6000000238418579,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W125001008","https://openalex.org/W143499627","https://openalex.org/W196216913","https://openalex.org/W274132100","https://openalex.org/W1008966784","https://openalex.org/W1434156133","https://openalex.org/W1593316755","https://openalex.org/W1601397300","https://openalex.org/W1656242846","https://openalex.org/W1852202999","https://openalex.org/W1964478285","https://openalex.org/W1971086298","https://openalex.org/W1989604857","https://openalex.org/W2015241127","https://openalex.org/W2044725657","https://openalex.org/W2044995998","https://openalex.org/W2075577325","https://openalex.org/W2080928135","https://openalex.org/W2087191078","https://openalex.org/W2104991009","https://openalex.org/W2109447584","https://openalex.org/W2116341587","https://openalex.org/W2128990851","https://openalex.org/W2134447392","https://openalex.org/W2135639338","https://openalex.org/W2141841102","https://openalex.org/W2143602574","https://openalex.org/W2203521679","https://openalex.org/W2214383483","https://openalex.org/W2221752211","https://openalex.org/W2293698677","https://openalex.org/W2294997557","https://openalex.org/W2540258482","https://openalex.org/W2986717012","https://openalex.org/W3104753760","https://openalex.org/W6628387023","https://openalex.org/W6635379270","https://openalex.org/W6639173921","https://openalex.org/W6647772945","https://openalex.org/W6675891628","https://openalex.org/W6884732825"],"related_works":["https://openalex.org/W2282636749","https://openalex.org/W2004425492","https://openalex.org/W2917772249","https://openalex.org/W2610278629","https://openalex.org/W1583052623","https://openalex.org/W94249243","https://openalex.org/W1598581090","https://openalex.org/W2106144871","https://openalex.org/W2159664993","https://openalex.org/W2394027715"],"abstract_inverted_index":{"Manipulating":[0],"multiple":[1],"movable":[2],"obstacles":[3],"is":[4,139],"a":[5,42,77,142,157,160],"hard":[6],"problem":[7,18],"that":[8],"involves":[9],"searching":[10],"high-dimensional":[11],"C-spaces.":[12],"A":[13],"milestone":[14],"method":[15,46,75],"for":[16,24,70,147,186],"this":[17,96,137],"was":[19],"able":[20],"to":[21,34,40,50,88,92,119,154,208],"compute":[22],"solutions":[23],"monotone":[25,71],"instances.":[26,73],"These":[27],"are":[28,170],"problems":[29],"where":[30],"every":[31],"object":[32,91,162],"needs":[33],"be":[35,58],"transferred":[36],"at":[37],"most":[38],"once":[39],"achieve":[41],"desired":[43],"arrangement.":[44],"The":[45,74,113,180],"uses":[47],"backtracking":[48,111],"search":[49,145],"find":[51],"the":[52,98,101,117,127,174,187],"order":[53,102],"with":[54],"which":[55,124,151],"objects":[56,81,105],"should":[57],"moved.":[59],"This":[60],"paper":[61],"first":[62],"proposes":[63],"an":[64,177],"approximate":[65],"but":[66],"significantly":[67],"faster":[68],"alternative":[69],"rearrangement":[72,149],"defines":[76],"dependency":[78],"graph":[79],"between":[80,131],"given":[82],"minimum":[83],"constraint":[84],"removal":[85],"paths":[86],"(MCR)":[87],"transfer":[89],"each":[90],"its":[93],"target.":[94],"From":[95],"graph,":[97],"approach":[99],"discovers":[100],"of":[103,129,166],"moving":[104],"by":[106,172],"performing":[107],"topological":[108],"sorting":[109],"without":[110],"search.":[112],"approximation":[114],"arises":[115],"from":[116],"limitation":[118],"consider":[120],"only":[121],"MCR":[122],"paths,":[123],"minimize,":[125],"however,":[126],"number":[128],"conflicts":[130],"objects.":[132],"To":[133],"solve":[134],"non-monotone":[135,189],"instances,":[136],"primitive":[138,175],"incorporated":[140],"in":[141],"higher-level":[143],"incremental":[144],"algorithm":[146],"general":[148,188],"planning,":[150],"operates":[152],"similar":[153],"Bi-RRT.":[155],"Given":[156],"start":[158],"and":[159,191,204],"goal":[161],"arrangement,":[163],"tree":[164],"structures":[165],"reachable":[167],"new":[168],"arrangements":[169],"generated":[171],"using":[173],"as":[176],"expansion":[178],"procedure.":[179],"integrated":[181],"solution":[182,202],"achieves":[183,197],"probabilistic":[184],"completeness":[185],"case":[190],"based":[192],"on":[193],"simulated":[194],"experiments":[195],"it":[196],"very":[198],"good":[199],"success":[200],"ratios,":[201],"times":[203],"path":[205],"quality":[206],"relative":[207],"alternatives.":[209]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}