{"id":"https://openalex.org/W2884373840","doi":"https://doi.org/10.1108/ir-01-2018-0004","title":"Task constrained motion planning for 7-degree of freedom manipulators with parameterized submanifolds","display_name":"Task constrained motion planning for 7-degree of freedom manipulators with parameterized submanifolds","publication_year":2018,"publication_date":"2018-07-16","ids":{"openalex":"https://openalex.org/W2884373840","doi":"https://doi.org/10.1108/ir-01-2018-0004","mag":"2884373840"},"language":"en","primary_location":{"id":"doi:10.1108/ir-01-2018-0004","is_oa":false,"landing_page_url":"https://doi.org/10.1108/ir-01-2018-0004","pdf_url":null,"source":{"id":"https://openalex.org/S166948985","display_name":"Industrial Robot the international journal of robotics research and application","issn_l":"0143-991X","issn":["0143-991X","1758-5791"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319811","host_organization_name":"Emerald Publishing Limited","host_organization_lineage":["https://openalex.org/P4310319811"],"host_organization_lineage_names":["Emerald Publishing Limited"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Industrial Robot: An International Journal","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/A5101992406","display_name":"Qiang Qiu","orcid":"https://orcid.org/0000-0002-7709-6288"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qiang Qiu","raw_affiliation_strings":["Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051221275","display_name":"Qixin Cao","orcid":"https://orcid.org/0000-0001-5462-9857"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qixin Cao","raw_affiliation_strings":["Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":0.2081,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.5436437,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"45","issue":"3","first_page":"363","last_page":"370"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9997000098228455,"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/T10653","display_name":"Robot Manipulation and Learning","score":0.9994000196456909,"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.6632281541824341},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6187720894813538},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5627435445785522},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5555753111839294},{"id":"https://openalex.org/keywords/serial-manipulator","display_name":"Serial manipulator","score":0.552017867565155},{"id":"https://openalex.org/keywords/cartesian-coordinate-system","display_name":"Cartesian coordinate system","score":0.5375565886497498},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5027873516082764},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4651772677898407},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4570181667804718},{"id":"https://openalex.org/keywords/singularity","display_name":"Singularity","score":0.44070032238960266},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4283022880554199},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4227166175842285},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4039539396762848},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37754762172698975},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3122270405292511},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2686023712158203},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1893923282623291},{"id":"https://openalex.org/keywords/parallel-manipulator","display_name":"Parallel manipulator","score":0.18548181653022766}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6632281541824341},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6187720894813538},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5627435445785522},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5555753111839294},{"id":"https://openalex.org/C120910303","wikidata":"https://www.wikidata.org/wiki/Q7454692","display_name":"Serial manipulator","level":4,"score":0.552017867565155},{"id":"https://openalex.org/C16038011","wikidata":"https://www.wikidata.org/wiki/Q62912","display_name":"Cartesian coordinate system","level":2,"score":0.5375565886497498},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5027873516082764},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4651772677898407},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4570181667804718},{"id":"https://openalex.org/C16171025","wikidata":"https://www.wikidata.org/wiki/Q863349","display_name":"Singularity","level":2,"score":0.44070032238960266},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4283022880554199},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4227166175842285},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4039539396762848},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37754762172698975},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3122270405292511},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2686023712158203},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1893923282623291},{"id":"https://openalex.org/C138094506","wikidata":"https://www.wikidata.org/wiki/Q12065277","display_name":"Parallel manipulator","level":3,"score":0.18548181653022766},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1108/ir-01-2018-0004","is_oa":false,"landing_page_url":"https://doi.org/10.1108/ir-01-2018-0004","pdf_url":null,"source":{"id":"https://openalex.org/S166948985","display_name":"Industrial Robot the international journal of robotics research and application","issn_l":"0143-991X","issn":["0143-991X","1758-5791"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319811","host_organization_name":"Emerald Publishing Limited","host_organization_lineage":["https://openalex.org/P4310319811"],"host_organization_lineage_names":["Emerald Publishing Limited"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Industrial Robot: An International Journal","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W18288968","https://openalex.org/W131069610","https://openalex.org/W1485487406","https://openalex.org/W1969483458","https://openalex.org/W1982442957","https://openalex.org/W1986152369","https://openalex.org/W1997696996","https://openalex.org/W2004139909","https://openalex.org/W2009124734","https://openalex.org/W2027931070","https://openalex.org/W2042803738","https://openalex.org/W2068761489","https://openalex.org/W2091072245","https://openalex.org/W2112474089","https://openalex.org/W2114000612","https://openalex.org/W2116341587","https://openalex.org/W2117758942","https://openalex.org/W2128990851","https://openalex.org/W2134447392","https://openalex.org/W2137346923","https://openalex.org/W2153247018","https://openalex.org/W2156102255","https://openalex.org/W2163426622","https://openalex.org/W2169528473","https://openalex.org/W2512112547","https://openalex.org/W2536222036","https://openalex.org/W2997798509"],"related_works":["https://openalex.org/W2041895526","https://openalex.org/W2046076203","https://openalex.org/W2386721998","https://openalex.org/W2000120653","https://openalex.org/W4200380753","https://openalex.org/W2591763881","https://openalex.org/W2224554719","https://openalex.org/W2911675435","https://openalex.org/W1547718683","https://openalex.org/W2884373840"],"abstract_inverted_index":{"Purpose":[0],"This":[1,40,125,169],"paper":[2,41],"aims":[3],"to":[4,16,119],"use":[5],"the":[6,29,47,56,69,75,97,121,163,172,176],"redundancy":[7],"of":[8,12,31,46,175],"a":[9,22,51],"7-DOF":[10,52,94],"(degree":[11],"freedom)":[13],"serial":[14],"manipulator":[15],"solve":[17],"motion":[18],"planning":[19,85,161],"problems":[20],"along":[21],"given":[23],"6D":[24],"Cartesian":[25],"tool":[26],"path,":[27],"in":[28],"presence":[30],"geometric":[32],"constraints,":[33],"namely,":[34],"obstacles":[35],"and":[36,55,90,96,109,130,148,184],"joint":[37],"limits.":[38],"Design/methodology/approach":[39],"describes":[42],"an":[43],"explicit":[44,66,173],"expression":[45,174],"task":[48,102,159,178],"submanifolds":[49,57],"for":[50,93],"redundant":[53],"robot,":[54],"can":[58,73,100,132],"be":[59,133],"parameterized":[60,80],"by":[61,135],"two":[62],"parameters":[63],"with":[64,157],"this":[65,79],"expression.":[67],"Therefore,":[68],"global":[70],"search":[71,153],"method":[72,140,170],"find":[74],"feasible":[76],"path":[77,99],"on":[78,113],"graph.":[81],"Findings":[82],"The":[83,111],"proposed":[84,164],"algorithm":[86,126,165],"is":[87,127],"resolution":[88,91,182,185],"complete":[89,183],"optimal":[92],"manipulators,":[95],"planned":[98],"satisfy":[101],"constraint":[103],"as":[104,106],"well":[105],"avoiding":[107],"singularity":[108],"collision.":[110],"experiments":[112],"Motoman":[114],"SDA":[115],"robot":[116],"are":[117],"reported":[118],"show":[120],"effectiveness.":[122],"Research":[123],"limitations/implications":[124],"still":[128],"time-consuming,":[129],"it":[131],"improved":[134],"applying":[136],"parallel":[137],"collision":[138,143],"detection":[139],"or":[141],"lazy":[142],"detection,":[144],"adopting":[145],"new":[146],"constraints":[147],"implementing":[149],"more":[150],"effective":[151],"graph":[152],"algorithms.":[154],"Originality/value":[155],"Compared":[156],"other":[158],"constrained":[160],"methods,":[162],"archives":[166],"better":[167],"performance.":[168],"finds":[171],"two-dimensional":[177],"sub-manifolds,":[179],"so":[180],"it\u2019s":[181],"optimal.":[186]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}