{"id":"https://openalex.org/W2018110063","doi":"https://doi.org/10.1177/0278364904045469","title":"Using Motion Planning for Knot Untangling","display_name":"Using Motion Planning for Knot Untangling","publication_year":2004,"publication_date":"2004-08-01","ids":{"openalex":"https://openalex.org/W2018110063","doi":"https://doi.org/10.1177/0278364904045469","mag":"2018110063"},"language":"en","primary_location":{"id":"doi:10.1177/0278364904045469","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364904045469","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","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/A5081132779","display_name":"Andrew M. Ladd","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrew M. Ladd","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5067205988","display_name":"Lydia E. Kavraki","orcid":"https://orcid.org/0000-0003-0699-8038"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lydia E. Kavraki","raw_affiliation_strings":["Department of Computer Science, Rice University, Houston, TX 77005, USA","Department of Computer Science, Rice University, Houston TX, 77005, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rice University, Houston, TX 77005, USA","institution_ids":["https://openalex.org/I74775410"]},{"raw_affiliation_string":"Department of Computer Science, Rice University, Houston TX, 77005, USA","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.42,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.94912566,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"23","issue":"7-8","first_page":"797","last_page":"808"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"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.9993000030517578,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9932000041007996,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.705041229724884},{"id":"https://openalex.org/keywords/knot","display_name":"Knot (papermaking)","score":0.7005444169044495},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.6756203770637512},{"id":"https://openalex.org/keywords/energy-minimization","display_name":"Energy minimization","score":0.5796810984611511},{"id":"https://openalex.org/keywords/knot-theory","display_name":"Knot theory","score":0.5642126798629761},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5588551163673401},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.53917396068573},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.5141027569770813},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5039417147636414},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4932824969291687},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4769816994667053},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43671634793281555},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.368660032749176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3099702000617981},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2786684036254883},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.15826568007469177},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07799294590950012}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.705041229724884},{"id":"https://openalex.org/C2779863119","wikidata":"https://www.wikidata.org/wiki/Q6423048","display_name":"Knot (papermaking)","level":2,"score":0.7005444169044495},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.6756203770637512},{"id":"https://openalex.org/C14961307","wikidata":"https://www.wikidata.org/wiki/Q5377176","display_name":"Energy minimization","level":2,"score":0.5796810984611511},{"id":"https://openalex.org/C143330242","wikidata":"https://www.wikidata.org/wiki/Q849798","display_name":"Knot theory","level":3,"score":0.5642126798629761},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5588551163673401},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.53917396068573},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.5141027569770813},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5039417147636414},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4932824969291687},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4769816994667053},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43671634793281555},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.368660032749176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3099702000617981},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2786684036254883},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.15826568007469177},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07799294590950012},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C42360764","wikidata":"https://www.wikidata.org/wiki/Q83588","display_name":"Chemical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1177/0278364904045469","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364904045469","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.85.2685","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.2685","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ijr.sagepub.com/cgi/reprint/23/7-8/797.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"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":46,"referenced_works":["https://openalex.org/W63574109","https://openalex.org/W605265774","https://openalex.org/W1504533209","https://openalex.org/W1559778958","https://openalex.org/W1616784375","https://openalex.org/W1966853719","https://openalex.org/W1969519268","https://openalex.org/W1998671030","https://openalex.org/W2000359213","https://openalex.org/W2000815453","https://openalex.org/W2002946642","https://openalex.org/W2003106667","https://openalex.org/W2005427404","https://openalex.org/W2009847090","https://openalex.org/W2027220894","https://openalex.org/W2029523783","https://openalex.org/W2039763834","https://openalex.org/W2043528001","https://openalex.org/W2051367340","https://openalex.org/W2059095702","https://openalex.org/W2059132453","https://openalex.org/W2064230672","https://openalex.org/W2068960528","https://openalex.org/W2081273574","https://openalex.org/W2083669917","https://openalex.org/W2085529455","https://openalex.org/W2087663875","https://openalex.org/W2111969050","https://openalex.org/W2116162693","https://openalex.org/W2126295536","https://openalex.org/W2128990851","https://openalex.org/W2129323682","https://openalex.org/W2132373652","https://openalex.org/W2137745368","https://openalex.org/W2139583487","https://openalex.org/W2141664020","https://openalex.org/W2145386076","https://openalex.org/W2146508208","https://openalex.org/W2159791647","https://openalex.org/W2164106566","https://openalex.org/W2167104421","https://openalex.org/W2167559986","https://openalex.org/W2169534903","https://openalex.org/W3104753760","https://openalex.org/W4236546188","https://openalex.org/W6680926899"],"related_works":["https://openalex.org/W2060743914","https://openalex.org/W3207350140","https://openalex.org/W1495779939","https://openalex.org/W2964242695","https://openalex.org/W2793606861","https://openalex.org/W2311482425","https://openalex.org/W2319375933","https://openalex.org/W2753977118","https://openalex.org/W2950745323","https://openalex.org/W2101575898"],"abstract_inverted_index":{"In":[0,31,90],"this":[1,74,91,141],"paper":[2],"we":[3,185],"investigate":[4],"the":[5,12,32,88,93,102,198],"application":[6],"of":[7,14,58,95,113,131,165,190,200],"motion":[8,96,156],"planning":[9,25,97,157,182,208],"techniques":[10,98],"to":[11,44,124,150],"untangling":[13,18,47,59,192],"mathematical":[15],"knots.":[16],"Knot":[17],"can":[19],"be":[20],"viewed":[21],"as":[22],"a":[23,52,128,134],"high-dimensional":[24,159],"problem":[26],"in":[27,73,87,140,145,154,180,194,197],"reparametrizable":[28,161],"configuration":[29],"spaces.":[30],"past,":[33],"simulated":[34],"annealing":[35],"and":[36,76,109,116,160,170,176,203,206],"other":[37,181],"energy":[38,114,166],"minimization":[39,86,115],"methods":[40],"have":[41,50,67],"been":[42,83],"used":[43,149],"find":[45],"knot":[46],"paths.":[48],"We":[49,66,120],"developed":[51,139],"probabilistic":[53],"planner":[54,105,138,193],"that":[55,146],"is":[56,99,143,148,173],"capable":[57],"knots":[60],"described":[61],"by":[62],"over":[63],"400":[64],"variables.":[65],"tested":[68],"on":[69],"known":[70],"difficult":[71],"benchmarks":[72],"area":[75],"untangled":[77],"them":[78],"more":[79],"quickly":[80],"than":[81],"has":[82],"achieved":[84],"with":[85,127,209],"literature.":[89],"work,":[92],"use":[94,112,164],"critical":[100],"for":[101,133,158,207],"untangling.":[103],"Our":[104],"defines":[106],"local":[107,168],"goals":[108,169],"makes":[110],"combined":[111],"randomized":[117],"tree-based":[118,171],"planning.":[119],"also":[121,174],"show":[122],"how":[123],"produce":[125],"candidates":[126],"minimal":[129],"number":[130],"segments":[132],"given":[135],"knot.":[136],"The":[137,163],"work":[142],"novel":[144,175],"it":[147],"study":[151,199],"issues":[152],"arising":[153],"practical":[155],"geometry.":[162],"methods,":[167],"expansion":[172],"may":[177],"suggest":[178],"solutions":[179],"applications.":[183],"Finally,":[184],"discuss":[186],"some":[187],"possible":[188],"applications":[189],"our":[191],"computational":[195],"topology,":[196],"DNA":[201],"rings":[202],"protein":[204],"folding":[205],"flexible":[210],"robots.":[211]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}