{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:04:33Z","timestamp":1754161473771,"version":"3.41.2"},"reference-count":11,"publisher":"Emerald","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,8,24]]},"abstract":"<jats:sec>\n                  <jats:title>Purpose<\/jats:title>\n                  <jats:p>The purpose of this paper is to solve the trajectory planning problem of industrial robots in a complex environment.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Design\/methodology\/approach<\/jats:title>\n                  <jats:p>A simultaneous algorithm was presented in which the trajectory was generated gradually as the robot moves. It takes into account the presence of obstacles (to avoid collisions) and differential constraints related to the dynamics of the robotic system. The method poses an optimization problem that aims at minimizing the time to perform the trajectory when several interpolation functions are used.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Findings<\/jats:title>\n                  <jats:p>A new approach to solving the trajectory planning problem in which the behaviour of four operational parameters (execution time, computational time, distance travelled and number of configurations) have been analyzed when changing the interpolation functions, therefore enabling the user to choose the most efficient algorithm depending on which parameter the user is most interested in. From the examples solved the interpolation function that yields the best results has been found.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Research limitations\/implications<\/jats:title>\n                  <jats:p>This new technique is very time consuming due to the great number of mathematical calculations that have to be made. However, it yields a solution.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Practical implications<\/jats:title>\n                  <jats:p>The algorithm is able to obtain the solution to the trajectory planning problem for any industrial robot. Also, even mobile obstacles in the workspace could be incorporated at the same time as the robot is moving and creating the path and the time history of motion.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Originality\/value<\/jats:title>\n                  <jats:p>It gives a new tool for solving the trajectory planning problem and describes the best interpolation function.<\/jats:p>\n               <\/jats:sec>","DOI":"10.1108\/01439911011063263","type":"journal-article","created":{"date-parts":[[2010,8,21]],"date-time":"2010-08-21T07:16:15Z","timestamp":1282374975000},"page":"441-451","source":"Crossref","is-referenced-by-count":14,"title":["The simultaneous algorithm and the best interpolation function for trajectory planning"],"prefix":"10.1108","volume":"37","author":[{"given":"Francisco","family":"Rubio","sequence":"first","affiliation":[{"name":"Department of Computer Systems and Computation, Universidad Polit\u00e9cnica de Valencia, Valencia, Spain"}]},{"given":"Francisco","family":"Valero","sequence":"additional","affiliation":[{"name":"Department of Computer Systems and Computation, Universidad Polit\u00e9cnica de Valencia, Valencia, Spain"}]},{"given":"Joseph","family":"Llu\u00eds Sunyer","sequence":"additional","affiliation":[{"name":"Department of Computer Systems and Computation, Universidad Polit\u00e9cnica de Valencia, Valencia, Spain"}]},{"given":"Antonio","family":"Garrido","sequence":"additional","affiliation":[{"name":"Department of Computer Systems and Computation, Universidad Polit\u00e9cnica de Valencia, Valencia, Spain"}]}],"member":"140","reference":[{"key":"2025072819565302900_b7","doi-asserted-by":"crossref","unstructured":"Abdel-Malek, K.\n          , Mi, Z., Yang, J.Z. and Nebel, K. (2006), \u201cOptimization-based trajectory planning of the human upper body\u201d, Robotica, Vol. 24, pp. 683-96, Part 6.","DOI":"10.1017\/S0263574706002852"},{"issue":"4","key":"2025072819565302900_b5","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1016\/j.euromechsol.2004.02.006","article-title":"Minimum cost trajectory planning for industrial robots","volume":"23","author":"Chettibi","year":"2004","journal-title":"European Journal of Mechanics A-Solids"},{"issue":"5","key":"2025072819565302900_b11","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1002\/(SICI)1097-4563(200005)17:5<233::AID-ROB1>3.0.CO;2-Y","article-title":"Smooth and time-optimal trajectory planning for industrial manipulators along specified paths","volume":"17","author":"Constantinescu","year":"2006","journal-title":"Journal of Robotic Systems"},{"issue":"11","key":"2025072819565302900_b4","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1002\/nme.739","article-title":"Trajectory-planning through interpolation by overlapping cubic arcs and cubic splines","volume":"57","author":"du Plessis","year":"2003","journal-title":"International Journal for Numerical Methods in Engineering"},{"issue":"4","key":"2025072819565302900_b3","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.mechmachtheory.2006.04.002","article-title":"A new method for smooth trajectory planning of robot manipulators","volume":"42","author":"Gasparetto","year":"2007","journal-title":"Mechanism and Machine Theory"},{"issue":"1","key":"2025072819565302900_b6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/TRA.2002.807548","article-title":"Jerk-bounded manipulator trajectory planning: design for real-time applications","volume":"19","author":"Macfarlane","year":"2003","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"2025072819565302900_b9","unstructured":"Provenzano, S.E.\n           (2001), \u201cAplicaci\u00f3n de las ecuaciones de Gibbs-Appell a la din\u00e1mica de robots\u201d, Tesis doctoral, Universidad Polit\u00e9cnica de Valencia, Valencia."},{"issue":"6","key":"2025072819565302900_b10","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1108\/01439910910994669","article-title":"Direct step-by step method for industrial robot path planning","volume":"36","author":"Rubio","year":"2009","journal-title":"Industrial Robot"},{"issue":"1","key":"2025072819565302900_b1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1017587311457","article-title":"Trajectory modelling of robot manipulators in the presence of obstacles","volume":"110","author":"Saramago","year":"2001","journal-title":"Journal of Optimization Theory and Applications"},{"key":"2025072819565302900_b2","doi-asserted-by":"crossref","unstructured":"Valero, F.J.\n          , Mata, V. and Besa, A. (2006), \u201cTrajectory planning in workspaces with obstacles taking into account the dynamic robot behaviour\u201d, Mechanism and Machine Theory, Vol. 41, pp. 525-36.","DOI":"10.1016\/j.mechmachtheory.2005.08.002"},{"key":"2025072819565302900_b8","doi-asserted-by":"crossref","unstructured":"Valero, F.J.\n          , Mata, V., Cuadrado, J.I. and Ceccarelli, M. (1997), \u201cA formulation for path planning of manipulators in complex environments by using adjacent configurations\u201d, Advanced Robotics, Vol. 11, pp. 33-56.","DOI":"10.1163\/156855397X00038"}],"container-title":["Industrial Robot: An International Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/01439911011063263","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/01439911011063263\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/ir\/article-pdf\/37\/5\/441\/1260988\/01439911011063263.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ir\/article-pdf\/37\/5\/441\/1260988\/01439911011063263.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T23:57:01Z","timestamp":1753747021000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ir\/article\/37\/5\/441\/184288\/The-simultaneous-algorithm-and-the-best"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,24]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,8,24]]}},"URL":"https:\/\/doi.org\/10.1108\/01439911011063263","relation":{},"ISSN":["0143-991X","1758-5791"],"issn-type":[{"type":"print","value":"0143-991X"},{"type":"electronic","value":"1758-5791"}],"subject":[],"published":{"date-parts":[[2010,8,24]]}}}