{"id":"https://openalex.org/W2151847882","doi":"https://doi.org/10.1007/s00224-013-9445-4","title":"Motion Planning with Pulley, Rope, and Baskets","display_name":"Motion Planning with Pulley, Rope, and Baskets","publication_year":2013,"publication_date":"2013-01-24","ids":{"openalex":"https://openalex.org/W2151847882","doi":"https://doi.org/10.1007/s00224-013-9445-4","mag":"2151847882"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-013-9445-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-013-9445-4","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://hal.science/hal-00678160","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111447642","display_name":"Christian Eggermont","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Christian E. J. Eggermont","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Gerhard J. Woeginger","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111447642"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":3.4931,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.92534206,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"53","issue":"4","first_page":"569","last_page":"582"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9987999796867371,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pulley","display_name":"Pulley","score":0.9397705793380737},{"id":"https://openalex.org/keywords/rope","display_name":"Rope","score":0.8868154883384705},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7457493543624878},{"id":"https://openalex.org/keywords/tower","display_name":"Tower","score":0.6656368374824524},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.5498495101928711},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.532085120677948},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.4933888018131256},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4619500935077667},{"id":"https://openalex.org/keywords/spinning","display_name":"Spinning","score":0.44226738810539246},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4128051996231079},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35709601640701294},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2047046720981598},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1946200132369995},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19008275866508484},{"id":"https://openalex.org/keywords/structural-engineering","display_name":"Structural engineering","score":0.18640941381454468},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1766178011894226},{"id":"https://openalex.org/keywords/mechanical-engineering","display_name":"Mechanical engineering","score":0.09273365139961243},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.06534847617149353}],"concepts":[{"id":"https://openalex.org/C171937826","wikidata":"https://www.wikidata.org/wiki/Q48378","display_name":"Pulley","level":2,"score":0.9397705793380737},{"id":"https://openalex.org/C162269090","wikidata":"https://www.wikidata.org/wiki/Q1156047","display_name":"Rope","level":2,"score":0.8868154883384705},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7457493543624878},{"id":"https://openalex.org/C2777831296","wikidata":"https://www.wikidata.org/wiki/Q12518","display_name":"Tower","level":2,"score":0.6656368374824524},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.5498495101928711},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.532085120677948},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.4933888018131256},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4619500935077667},{"id":"https://openalex.org/C154815118","wikidata":"https://www.wikidata.org/wiki/Q453762","display_name":"Spinning","level":2,"score":0.44226738810539246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4128051996231079},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35709601640701294},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2047046720981598},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1946200132369995},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19008275866508484},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.18640941381454468},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1766178011894226},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.09273365139961243},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.06534847617149353},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/s00224-013-9445-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-013-9445-4","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/94d08e89-1980-4989-b792-cd1c2c9c7705","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/94d08e89-1980-4989-b792-cd1c2c9c7705","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Eggermont, C E J & Woeginger, G J 2013, 'Motion planning with pulley, rope, and baskets', Theory of Computing Systems, vol. 53, no. 4, pp. 569-582. https://doi.org/10.1007/s00224-013-9445-4","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.397.5909","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.397.5909","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://drops.dagstuhl.de/opus/volltexte/2012/3390/pdf/6.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00678160v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00678160","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.374-383","raw_type":"Conference papers"},{"id":"pmh:oai:library.tue.nl:736561","is_oa":false,"landing_page_url":"http://repository.tue.nl/736561","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:750965","is_oa":false,"landing_page_url":"http://repository.tue.nl/750965","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1432-4350","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/94d08e89-1980-4989-b792-cd1c2c9c7705","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/94d08e89-1980-4989-b792-cd1c2c9c7705","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theory of Computing Systems, 53(4), 569 - 582. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00678160v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00678160","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.374-383","raw_type":"Conference papers"},"sustainable_development_goals":[{"score":0.7799999713897705,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W601437154","https://openalex.org/W1984027871","https://openalex.org/W2009082978","https://openalex.org/W2011039300","https://openalex.org/W2034751042","https://openalex.org/W2065251436","https://openalex.org/W2066671865","https://openalex.org/W2127492079","https://openalex.org/W2752885492","https://openalex.org/W3134267570","https://openalex.org/W3145128584","https://openalex.org/W4213009134","https://openalex.org/W4236127247","https://openalex.org/W4285719527","https://openalex.org/W4372046852"],"related_works":["https://openalex.org/W2136512912","https://openalex.org/W2722606392","https://openalex.org/W2127267268","https://openalex.org/W2156446763","https://openalex.org/W2353222691","https://openalex.org/W3022656278","https://openalex.org/W2348686186","https://openalex.org/W2648011351","https://openalex.org/W2565875598","https://openalex.org/W607347989"],"abstract_inverted_index":{"We":[0,73],"study":[1],"a":[2,17,46,70,95,119],"motion":[3],"planning":[4],"problem":[5],"where":[6],"items":[7,28],"have":[8,29],"to":[9,19,30,80,94],"be":[10,31],"transported":[11,32],"from":[12],"the":[13,20,23,34,54,56,60,63,88,115],"top":[14],"room":[15],"of":[16,22,53,62,87,107,118,121],"tower":[18],"bottom":[21],"tower,":[24],"while":[25],"simultaneously":[26],"other":[27],"in":[33,41],"opposite":[35],"direction.":[36],"Item":[37],"sets":[38],"are":[39],"moved":[40],"two":[42,64],"baskets":[43,65],"hanging":[44],"on":[45],"rope":[47],"and":[48,111],"pulley.":[49],"To":[50],"guarantee":[51],"stability":[52],"system,":[55],"weight":[57],"difference":[58],"between":[59],"contents":[61],"must":[66],"always":[67],"stay":[68],"below":[69],"given":[71,84,96],"threshold.":[72],"prove":[74],"that":[75],"it":[76],"is":[77],"$\\varPi_{2}^{p}$":[78],"-complete":[79],"decide":[81],"whether":[82],"some":[83],"initial":[85],"situation":[86],"underlying":[89],"discrete":[90],"system":[91],"can":[92],"lead":[93],"goal":[97],"situation.":[98],"Furthermore":[99],"we":[100,112],"identify":[101],"several":[102],"polynomially":[103],"solvable":[104],"special":[105],"cases":[106],"this":[108],"reachability":[109],"problem,":[110],"also":[113],"settle":[114],"computational":[116],"complexity":[117],"number":[120],"related":[122],"questions.":[123]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}