{"id":"https://openalex.org/W4415970897","doi":"https://doi.org/10.1109/lra.2025.3630032","title":"Learning Problem Decomposition for Efficient Sequential Multi-Object Manipulation Planning","display_name":"Learning Problem Decomposition for Efficient Sequential Multi-Object Manipulation Planning","publication_year":2025,"publication_date":"2025-11-06","ids":{"openalex":"https://openalex.org/W4415970897","doi":"https://doi.org/10.1109/lra.2025.3630032"},"language":null,"primary_location":{"id":"doi:10.1109/lra.2025.3630032","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2025.3630032","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-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/A5114778150","display_name":"Yan Zhang","orcid":"https://orcid.org/0000-0002-5311-9828"},"institutions":[{"id":"https://openalex.org/I7495430","display_name":"Idiap Research Institute","ror":"https://ror.org/05932h694","country_code":"CH","type":"facility","lineage":["https://openalex.org/I7495430"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Yan Zhang","raw_affiliation_strings":["Idiap Research Institute, Martigny, Switzerland","Idiap Research Institute, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-5311-9828","affiliations":[{"raw_affiliation_string":"Idiap Research Institute, Martigny, Switzerland","institution_ids":["https://openalex.org/I7495430"]},{"raw_affiliation_string":"Idiap Research Institute, Switzerland","institution_ids":["https://openalex.org/I7495430"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101025180","display_name":"Teng Xue","orcid":"https://orcid.org/0009-0001-7414-3958"},"institutions":[{"id":"https://openalex.org/I7495430","display_name":"Idiap Research Institute","ror":"https://ror.org/05932h694","country_code":"CH","type":"facility","lineage":["https://openalex.org/I7495430"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Teng Xue","raw_affiliation_strings":["Idiap Research Institute, Martigny, Switzerland","Idiap Research Institute, Switzerland"],"raw_orcid":"https://orcid.org/0009-0001-7414-3958","affiliations":[{"raw_affiliation_string":"Idiap Research Institute, Martigny, Switzerland","institution_ids":["https://openalex.org/I7495430"]},{"raw_affiliation_string":"Idiap Research Institute, Switzerland","institution_ids":["https://openalex.org/I7495430"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049327938","display_name":"Amirreza Razmjoo","orcid":"https://orcid.org/0000-0003-3826-6608"},"institutions":[{"id":"https://openalex.org/I7495430","display_name":"Idiap Research Institute","ror":"https://ror.org/05932h694","country_code":"CH","type":"facility","lineage":["https://openalex.org/I7495430"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Amirreza Razmjoo","raw_affiliation_strings":["Idiap Research Institute, Martigny, Switzerland","Idiap Research Institute, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-3826-6608","affiliations":[{"raw_affiliation_string":"Idiap Research Institute, Martigny, Switzerland","institution_ids":["https://openalex.org/I7495430"]},{"raw_affiliation_string":"Idiap Research Institute, Switzerland","institution_ids":["https://openalex.org/I7495430"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048780399","display_name":"Sylvain Calinon","orcid":"https://orcid.org/0000-0002-9036-6799"},"institutions":[{"id":"https://openalex.org/I7495430","display_name":"Idiap Research Institute","ror":"https://ror.org/05932h694","country_code":"CH","type":"facility","lineage":["https://openalex.org/I7495430"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Sylvain Calinon","raw_affiliation_strings":["Idiap Research Institute, Martigny, Switzerland","Idiap Research Institute, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-9036-6799","affiliations":[{"raw_affiliation_string":"Idiap Research Institute, Martigny, Switzerland","institution_ids":["https://openalex.org/I7495430"]},{"raw_affiliation_string":"Idiap Research Institute, Switzerland","institution_ids":["https://openalex.org/I7495430"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9349,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.80717551,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"10","issue":"12","first_page":"13367","last_page":"13374"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.5063999891281128,"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.5063999891281128,"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.21570000052452087,"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.1712999939918518,"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/task","display_name":"Task (project management)","score":0.6689000129699707},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5932999849319458},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5771999955177307},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5626999735832214},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.5605999827384949},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.527899980545044}],"concepts":[{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6689000129699707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6151000261306763},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5932999849319458},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5771999955177307},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5626999735832214},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.5605999827384949},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.527899980545044},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5105000138282776},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4778999984264374},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46869999170303345},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.40369999408721924},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3939000070095062},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.39320001006126404},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.365200012922287},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.28790000081062317},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2556000053882599}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2025.3630032","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2025.3630032","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3065957153","display_name":null,"funder_award_id":"202106230104","funder_id":"https://openalex.org/F4320322725","funder_display_name":"China Scholarship Council"}],"funders":[{"id":"https://openalex.org/F4320322725","display_name":"China Scholarship Council","ror":"https://ror.org/04atp4p48"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W2135639338","https://openalex.org/W2168196587","https://openalex.org/W2800779097","https://openalex.org/W2964055695","https://openalex.org/W2984756091","https://openalex.org/W3001865277","https://openalex.org/W3086207594","https://openalex.org/W3090717212","https://openalex.org/W3128894241","https://openalex.org/W3169676024","https://openalex.org/W3187771686","https://openalex.org/W3202678378","https://openalex.org/W3215761265","https://openalex.org/W4293732130","https://openalex.org/W4312990487","https://openalex.org/W4383108269","https://openalex.org/W4385430665","https://openalex.org/W4399989579","https://openalex.org/W4400488001","https://openalex.org/W4401413886","https://openalex.org/W4401414039","https://openalex.org/W4401416379"],"related_works":[],"abstract_inverted_index":{"We":[0,144],"present":[1],"an":[2,24],"efficient":[3],"task":[4],"and":[5,34,76],"motion":[6],"replanning":[7,156],"approach":[8,60,147],"for":[9,158],"sequential":[10,159],"multi-object":[11,160],"manipulation":[12,161],"in":[13,27,42,154,163],"dynamic":[14,164],"environments.":[15,165],"Conventional":[16],"Task":[17],"And":[18],"Motion":[19],"Planning":[20],"(TAMP)":[21],"solvers":[22],"experience":[23],"exponential":[25],"increase":[26],"planning":[28,32],"time":[29],"as":[30,104],"the":[31,84,92,99,111,118,122,133],"horizon":[33],"number":[35],"of":[36,62,89,135],"objects":[37,137],"grow,":[38],"limiting":[39],"their":[40],"applicability":[41],"real-world":[43],"scenarios.":[44],"To":[45],"address":[46],"this,":[47],"we":[48],"propose":[49],"learning":[50,109],"problem":[51],"decompositions":[52],"from":[53,126],"demonstrations":[54],"to":[55,120],"accelerate":[56],"TAMP":[57],"solvers.":[58],"Our":[59],"consists":[61],"three":[63,149],"key":[64],"components:":[65],"<italic":[66,71,77,85],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[67,72,78,86],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">goal":[68],"decomposition":[69,82],"learning</i>,":[70,75],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">computational":[73],"distance":[74,108],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">object":[79],"reduction</i>.":[80],"Goal":[81],"identifies":[83],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">necessary</i>":[87],"sequences":[88],"states":[90],"that":[91],"system":[93,119],"must":[94],"pass":[95],"through":[96],"before":[97],"reaching":[98],"final":[100],"goal,":[101],"treating":[102],"them":[103],"subgoal":[105,125],"sequences.":[106],"Computational":[107],"predicts":[110],"computational":[112],"complexity":[113],"between":[114],"two":[115],"states,":[116],"enabling":[117],"identify":[121],"temporally":[123],"closest":[124],"a":[127],"disturbed":[128],"state.":[129],"Object":[130],"reduction":[131],"minimizes":[132],"set":[134],"active":[136],"considered":[138],"during":[139],"replanning,":[140],"further":[141],"improving":[142,155],"efficiency.":[143],"evaluate":[145],"our":[146],"on":[148],"benchmarks,":[150],"demonstrating":[151],"its":[152],"effectiveness":[153],"efficiency":[157],"tasks":[162]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-06T00:00:00"}