{"id":"https://openalex.org/W4405785696","doi":"https://doi.org/10.1109/iros58592.2024.10802552","title":"Extended Tree Search for Robot Task and Motion Planning","display_name":"Extended Tree Search for Robot Task and Motion Planning","publication_year":2024,"publication_date":"2024-10-14","ids":{"openalex":"https://openalex.org/W4405785696","doi":"https://doi.org/10.1109/iros58592.2024.10802552"},"language":"en","primary_location":{"id":"doi:10.1109/iros58592.2024.10802552","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros58592.2024.10802552","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":"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/A5070212925","display_name":"Tianyu Ren","orcid":"https://orcid.org/0009-0008-1691-5690"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Tianyu Ren","raw_affiliation_strings":["Technische Universit&#x00E4;t Darmstadt,Computer Science Department,Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit&#x00E4;t Darmstadt,Computer Science Department,Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026055366","display_name":"Georgia Chalvatzaki","orcid":"https://orcid.org/0000-0002-5055-199X"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Georgia Chalvatzaki","raw_affiliation_strings":["Technische Universit&#x00E4;t Darmstadt,Computer Science Department,Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit&#x00E4;t Darmstadt,Computer Science Department,Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063321196","display_name":"Jan Peters","orcid":"https://orcid.org/0000-0001-9328-3078"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jan Peters","raw_affiliation_strings":["Technische Universit&#x00E4;t Darmstadt,Computer Science Department,Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit&#x00E4;t Darmstadt,Computer Science Department,Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070212925"],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":1.0526,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79387659,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"12048","last_page":"12055"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9988999962806702,"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.9988999962806702,"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/T10653","display_name":"Robot Manipulation and Learning","score":0.9821000099182129,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9753000140190125,"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/computer-science","display_name":"Computer science","score":0.698663055896759},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6345015168190002},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5854217410087585},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5686319470405579},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.551041305065155},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.4856816232204437},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.43692657351493835},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13086026906967163},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08963888883590698},{"id":"https://openalex.org/keywords/systems-engineering","display_name":"Systems engineering","score":0.0476321280002594}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.698663055896759},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6345015168190002},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5854217410087585},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5686319470405579},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.551041305065155},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.4856816232204437},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.43692657351493835},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13086026906967163},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08963888883590698},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0476321280002594},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros58592.2024.10802552","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros58592.2024.10802552","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W161513061","https://openalex.org/W1500868819","https://openalex.org/W1714211023","https://openalex.org/W2042408133","https://openalex.org/W2075577325","https://openalex.org/W2075848246","https://openalex.org/W2132467020","https://openalex.org/W2141841102","https://openalex.org/W2161414194","https://openalex.org/W2168405694","https://openalex.org/W2210405730","https://openalex.org/W2490090381","https://openalex.org/W2794922736","https://openalex.org/W2884855872","https://openalex.org/W2997710546","https://openalex.org/W3001865277","https://openalex.org/W3089438647","https://openalex.org/W3090359198","https://openalex.org/W3128894241","https://openalex.org/W3206432218","https://openalex.org/W4253756030","https://openalex.org/W6683526187","https://openalex.org/W6696927055","https://openalex.org/W6713184877","https://openalex.org/W6748256472"],"related_works":["https://openalex.org/W3049557657","https://openalex.org/W3150915502","https://openalex.org/W8302103","https://openalex.org/W2111158727","https://openalex.org/W1809059965","https://openalex.org/W2024668666","https://openalex.org/W3171631314","https://openalex.org/W3213722473","https://openalex.org/W2110944602","https://openalex.org/W2118356379"],"abstract_inverted_index":{"Integrated":[0],"Task":[1],"and":[2,26,57,99],"Motion":[3],"Planning":[4],"(TAMP)":[5],"offers":[6],"opportunities":[7],"for":[8,52,121,129],"achieving":[9],"generalized":[10],"autonomy":[11],"in":[12,21,125,133,143,148],"robots":[13],"but":[14],"also":[15,31],"poses":[16],"challenges.":[17],"It":[18],"involves":[19],"searching":[20],"both":[22,53],"symbolic":[23,54,111],"task":[24,55],"space":[25,69],"high-dimensional":[27,58],"motion":[28,59,78,116],"space,":[29],"while":[30],"addressing":[32],"geometrically":[33],"infeasible":[34],"actions":[35],"within":[36],"its":[37],"hierarchical":[38],"process.":[39],"We":[40],"introduce":[41],"a":[42,67,95,126],"novel":[43],"TAMP":[44],"decision-making":[45],"framework,":[46],"utilizing":[47],"an":[48,82],"extended":[49,83],"decision":[50,84,102],"tree":[51],"planning":[56,113],"variable":[60,79,117],"binding.":[61],"Employing":[62],"top-k":[63,112],"planning,":[64],"we":[65],"generate":[66],"skeleton":[68],"with":[70,77,114,150],"diverse":[71],"candidate":[72],"plans,":[73],"seamlessly":[74],"integrating":[75],"it":[76],"spaces":[80],"into":[81],"space.":[85],"Subsequently,":[86],"Monte-Carlo":[87],"Tree":[88],"Search":[89],"(MCTS)":[90],"is":[91],"utilized":[92],"to":[93],"maintain":[94],"balance":[96],"between":[97],"exploration":[98],"exploitation":[100],"at":[101],"nodes,":[103],"ultimately":[104],"yielding":[105],"optimal":[106],"solutions.":[107],"Our":[108],"approach":[109],"combines":[110],"concrete":[115],"binding,":[118],"leveraging":[119],"MCTS":[120],"proven":[122],"optimality,":[123],"resulting":[124],"powerful":[127],"algorithm":[128],"handling":[130],"combinatorial":[131],"complexity":[132],"long-horizon":[134],"manipulation":[135],"tasks.":[136],"Empirical":[137],"evaluations":[138],"demonstrate":[139],"the":[140,151],"algorithm\u2019s":[141],"effectiveness":[142],"diverse,":[144],"challenging":[145],"robot":[146],"tasks,":[147],"comparison":[149],"baseline":[152],"methods.":[153]},"counts_by_year":[{"year":2025,"cited_by_count":4}],"updated_date":"2025-12-27T23:08:20.325037","created_date":"2025-10-10T00:00:00"}
