{"id":"https://openalex.org/W2993408200","doi":"https://doi.org/10.3390/robotics8040101","title":"Trajectory Optimization of a Redundant Serial Robot Using Cartesian via Points and Kinematic Decoupling","display_name":"Trajectory Optimization of a Redundant Serial Robot Using Cartesian via Points and Kinematic Decoupling","publication_year":2019,"publication_date":"2019-12-09","ids":{"openalex":"https://openalex.org/W2993408200","doi":"https://doi.org/10.3390/robotics8040101","mag":"2993408200"},"language":"en","primary_location":{"id":"doi:10.3390/robotics8040101","is_oa":true,"landing_page_url":"https://doi.org/10.3390/robotics8040101","pdf_url":"https://www.mdpi.com/2218-6581/8/4/101/pdf?version=1575875953","source":{"id":"https://openalex.org/S4210232487","display_name":"Robotics","issn_l":"2218-6581","issn":["2218-6581"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/2218-6581/8/4/101/pdf?version=1575875953","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004263832","display_name":"Matteo Bottin","orcid":"https://orcid.org/0000-0001-6611-173X"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Matteo Bottin","raw_affiliation_strings":["Department of Industrial Engineering, University of Padova, 35131 Padova, Italy"],"raw_orcid":"https://orcid.org/0000-0001-6611-173X","affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, University of Padova, 35131 Padova, Italy","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070709789","display_name":"Giulio Rosati","orcid":"https://orcid.org/0000-0002-5150-9486"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giulio Rosati","raw_affiliation_strings":["Department of Industrial Engineering, University of Padova, 35131 Padova, Italy"],"raw_orcid":"https://orcid.org/0000-0002-5150-9486","affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, University of Padova, 35131 Padova, Italy","institution_ids":["https://openalex.org/I138689650"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004263832"],"corresponding_institution_ids":["https://openalex.org/I138689650"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1732},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1732},"fwci":2.5528,"has_fulltext":true,"cited_by_count":29,"citation_normalized_percentile":{"value":0.92025033,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"8","issue":"4","first_page":"101","last_page":"101"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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.9986000061035156,"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.9883000254631042,"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/kinematics","display_name":"Kinematics","score":0.6063110828399658},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5968161821365356},{"id":"https://openalex.org/keywords/cartesian-coordinate-system","display_name":"Cartesian coordinate system","score":0.5658976435661316},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5640647411346436},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5273966193199158},{"id":"https://openalex.org/keywords/decoupling","display_name":"Decoupling (probability)","score":0.509402334690094},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.501716136932373},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.448652982711792},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.43431416153907776},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4294658303260803},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.4246487021446228},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4213748574256897},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3492166996002197},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3218613862991333},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31946855783462524},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27049940824508667},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14398738741874695},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1194121241569519},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10556924343109131},{"id":"https://openalex.org/keywords/control-engineering","display_name":"Control engineering","score":0.09580641984939575}],"concepts":[{"id":"https://openalex.org/C39920418","wikidata":"https://www.wikidata.org/wiki/Q11476","display_name":"Kinematics","level":2,"score":0.6063110828399658},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5968161821365356},{"id":"https://openalex.org/C16038011","wikidata":"https://www.wikidata.org/wiki/Q62912","display_name":"Cartesian coordinate system","level":2,"score":0.5658976435661316},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5640647411346436},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5273966193199158},{"id":"https://openalex.org/C205606062","wikidata":"https://www.wikidata.org/wiki/Q5249645","display_name":"Decoupling (probability)","level":2,"score":0.509402334690094},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.501716136932373},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.448652982711792},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.43431416153907776},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4294658303260803},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.4246487021446228},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4213748574256897},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3492166996002197},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3218613862991333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31946855783462524},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27049940824508667},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14398738741874695},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1194121241569519},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10556924343109131},{"id":"https://openalex.org/C133731056","wikidata":"https://www.wikidata.org/wiki/Q4917288","display_name":"Control engineering","level":1,"score":0.09580641984939575},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/robotics8040101","is_oa":true,"landing_page_url":"https://doi.org/10.3390/robotics8040101","pdf_url":"https://www.mdpi.com/2218-6581/8/4/101/pdf?version=1575875953","source":{"id":"https://openalex.org/S4210232487","display_name":"Robotics","issn_l":"2218-6581","issn":["2218-6581"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotics","raw_type":"journal-article"},{"id":"pmh:oai:mdpi.com:/2218-6581/8/4/101/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/robotics8040101","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Robotics","raw_type":"Text"},{"id":"pmh:oai:www.research.unipd.it:11577/3322663","is_oa":true,"landing_page_url":"https://www.mdpi.com/2218-6581/8/4/101","pdf_url":null,"source":{"id":"https://openalex.org/S4377196283","display_name":"Research Padua  Archive (University of Padua)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:zenodo.org:150974","is_oa":true,"landing_page_url":"https://www.openaccessrepository.it/record/150974","pdf_url":null,"source":{"id":"https://openalex.org/S4306402478","display_name":"INFM-OAR (INFN Catania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210116497","host_organization_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Catania","host_organization_lineage":["https://openalex.org/I4210116497"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.3390/robotics8040101","is_oa":true,"landing_page_url":"https://doi.org/10.3390/robotics8040101","pdf_url":"https://www.mdpi.com/2218-6581/8/4/101/pdf?version=1575875953","source":{"id":"https://openalex.org/S4210232487","display_name":"Robotics","issn_l":"2218-6581","issn":["2218-6581"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8105813743","display_name":null,"funder_award_id":"BIRD187930","funder_id":"https://openalex.org/F4320321966","funder_display_name":"Universit\u00e0 degli Studi di Padova"}],"funders":[{"id":"https://openalex.org/F4320321966","display_name":"Universit\u00e0 degli Studi di Padova","ror":"https://ror.org/00240q980"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2993408200.pdf","grobid_xml":"https://content.openalex.org/works/W2993408200.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W158955209","https://openalex.org/W1424654272","https://openalex.org/W1497695555","https://openalex.org/W1821856846","https://openalex.org/W1866797514","https://openalex.org/W1999250663","https://openalex.org/W2000359213","https://openalex.org/W2005970795","https://openalex.org/W2049280913","https://openalex.org/W2055201760","https://openalex.org/W2084224084","https://openalex.org/W2104332709","https://openalex.org/W2114872772","https://openalex.org/W2120249119","https://openalex.org/W2126539456","https://openalex.org/W2128990851","https://openalex.org/W2169528473","https://openalex.org/W2403683192","https://openalex.org/W2468618434","https://openalex.org/W2515498963","https://openalex.org/W2609646563","https://openalex.org/W2617015613","https://openalex.org/W2664907401","https://openalex.org/W2763475766","https://openalex.org/W2763941082","https://openalex.org/W2767155506","https://openalex.org/W2806892057","https://openalex.org/W2889379088","https://openalex.org/W2967918112"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600","https://openalex.org/W2761711678"],"abstract_inverted_index":{"Moving":[0],"from":[1],"a":[2,13,71,122,136],"given":[3,47,151],"position":[4],"to":[5],"another":[6],"with":[7],"an":[8,56],"industrial":[9],"robot":[10],"can":[11,119],"be":[12],"challenging":[14],"problem":[15],"when":[16],"the":[17,22,35,38,43,46,60,78,87,92,104,107,116,141,145,150],"task":[18],"is":[19,49,66,110],"redundant":[20],"around":[21,77],"tool":[23],"axis.":[24],"In":[25,53],"this":[26,54],"case,":[27],"there":[28],"are":[29],"infinite":[30,146],"ways":[31],"of":[32,73,106,125,140],"choosing":[33],"both":[34],"starting":[36,126],"and":[37,80,115,127],"ending":[39,128],"configurations,":[40],"so":[41],"that":[42,58,95],"movement":[44,62,97],"between":[45,63,91,149],"points":[48,76,85],"not":[50],"uniquely":[51],"defined.":[52],"paper,":[55],"algorithm":[57],"calculates":[59],"suboptimal":[61,88,108,142],"two":[64,93],"positions":[65,94],"proposed,":[67],"which":[68,103],"automatically":[69],"generates":[70],"cloud":[72],"safe":[74,89],"via":[75],"workpiece":[79],"then":[81],"by":[82],"exploiting":[83],"such":[84],"finds":[86],"path":[90,109,143],"minimizes":[96],"time.":[98],"The":[99],"proposed":[100],"method,":[101],"in":[102,130],"search":[105,139],"based":[111],"on":[112],"graph":[113],"theory":[114],"Dijkstra":[117],"algorithm,":[118],"iteratively":[120],"evaluate":[121],"high":[123],"number":[124],"configurations":[129],"low":[131],"computational":[132],"time,":[133],"allowing":[134],"performing":[135],"reasonably":[137],"wide":[138],"within":[144],"possible":[147],"motions":[148],"points.":[152]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":7}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}