{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:55:54Z","timestamp":1754157354192,"version":"3.41.2"},"reference-count":24,"publisher":"Emerald","issue":"6","license":[{"start":{"date-parts":[[2012,10,12]],"date-time":"2012-10-12T00:00:00Z","timestamp":1350000000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,10,12]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>The purpose of this paper is to compare the quality and efficiency of five methods for solving the path planning problem of industrial robots in complex environments.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>In total, five methods are presented for solving the path planning problem and certain working parameters have been monitored using each method. These working parameters are the distance travelled by the robot and the computational time needed to find a solution. A comparison of results has been analyzed.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>After this study, it could be easy to know which of the proposed methods is most suitable for application in each case, depending on the parameter the user wants to optimize. The findings have been summarized in the conclusion section.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Research limitations\/implications<\/jats:title><jats:p>The five techniques which have been developed yield good results in general.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Practical implications<\/jats:title><jats:p>The algorithms introduced are able to solve the path planning problem for any industrial robot working with obstacles.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Social implications<\/jats:title><jats:p>The path planning algorithms help robots perform their tasks in a more efficient way because the path followed has been optimized and therefore they help human beings work together with the robots in order to obtain the best results from them.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>The paper shows which algorithm offers the best results, depending on the example the user has to solve and the parameter to be optimized.<\/jats:p><\/jats:sec>","DOI":"10.1108\/01439911211268787","type":"journal-article","created":{"date-parts":[[2013,4,23]],"date-time":"2013-04-23T05:32:24Z","timestamp":1366695144000},"page":"580-591","source":"Crossref","is-referenced-by-count":8,"title":["Comparing the efficiency of five algorithms applied to path planning for industrial robots"],"prefix":"10.1108","volume":"39","author":[{"given":"Francisco","family":"Rubio","sequence":"first","affiliation":[]},{"given":"Fares J.","family":"Abu\u2010Dakka","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Valero","sequence":"additional","affiliation":[]},{"given":"Vicente","family":"Mata","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2022021719520017900_b2","doi-asserted-by":"crossref","unstructured":"Brooks, R.A. (1983), \u201cSolving the find\u2010path problem by good representation of free space\u201d, IEEE Transactions on System, Man and Cybernetics, Vol. 13 No. 4, pp. 190\u20107.","DOI":"10.1109\/TSMC.1983.6313112"},{"key":"key2022021719520017900_b1","unstructured":"Brooks, R.A. and Lozano\u2010P\u00e9rez, T. (1983), \u201cA subdivision algorithm configuration space for findpath with rotation\u201d, International Joint Conference on Artificial Intelligence, pp. 799\u2010806."},{"key":"key2022021719520017900_b3","doi-asserted-by":"crossref","unstructured":"Davidor, Y. (1991), \u201cGenetic algorithms and robotics, a heuristic strategy for optimisation\u201d, World Scientific Series and Automated Systems, Vol. 1.","DOI":"10.1142\/1111"},{"key":"key2022021719520017900_b4","doi-asserted-by":"crossref","unstructured":"Dubowsky, S. and Shiller, Z. (1984), \u201cOptimal dynamic trajectories for robotic manipulators\u201d, Fifth CISM\u2010IFToMM Symposium on Theory and Practice of Robots and Manipulators, Udine, Italy, pp. 96\u2010103.","DOI":"10.1007\/978-1-4615-9882-4_15"},{"key":"key2022021719520017900_b5","unstructured":"Fares, A.D., Valero, F., Mata, V. and Assad, I.F.I. (2007), \u201cPath planning optimization of industrial robots using genetic algorithm\u201d, Proceedings of 16th International Workshop on Robotics in Alpe\u2010Adria\u2010Danube Region, Liubliana, p. 104."},{"key":"key2022021719520017900_b6","unstructured":"Gupta, K. and del Pobil, A.P. (1998), Practical Motion Planning in Robotics: Current Approaches and Future Directions, Wiley, Chichester."},{"key":"key2022021719520017900_b8","doi-asserted-by":"crossref","unstructured":"Hsu, D., Kindel, R., Latombe, J.C. and Rock, S. (2002), \u201cRandomized kinodynamic motion planning with moving obstacles\u201d, International Journal of Robotics Research, Vol. 21 No. 3, pp. 233\u201055.","DOI":"10.1177\/027836402320556421"},{"key":"key2022021719520017900_b9","unstructured":"Isto, P. (1996), \u201cPath planning by multiheuristic search via subgoals\u201d, Proceedings of the 27th International Symposium on Industrial Robots, CEU, pp. 712\u201026."},{"key":"key2022021719520017900_b11","unstructured":"Kavraki, L.E. (1994), \u201cRandom networks in configurations space for fast path planning\u201d, doctoral dissertation, Department of Computer Science, Stanford University, Stanford, CA."},{"key":"key2022021719520017900_b13","unstructured":"Kavraki, L.E. and Latombe, J.C. (1998), \u201cProbabilistic roadmaps for robot path planning\u201d, Practical Motion Planning in Robotics: Current Approaches and Future Challenges, Wiley, New York, NY, pp. 33\u201053."},{"key":"key2022021719520017900_b12","doi-asserted-by":"crossref","unstructured":"Kavraki, L.E., Svestka, P., Latombe, J.C. and Overmars, M.H. (1996), \u201cProbabilistic roadmaps for path planning in high dimensional configuration spaces\u201d, IEEE Transactions on Robotics and Automation, Vol. 12, pp. 566\u201080.","DOI":"10.1109\/70.508439"},{"key":"key2022021719520017900_b10","doi-asserted-by":"crossref","unstructured":"Khatib, O. (1985), \u201cReal\u2010time obstacle avoidance for manipulators and mobile robots\u201d, IEEE International Conference on Robotics and Automation, St Louis, MO, USA, pp. 500\u20105.","DOI":"10.1109\/ROBOT.1985.1087247"},{"key":"key2022021719520017900_b15","unstructured":"LaValle, S.M. and Hutchinson, S.A. (1996), \u201cOptimal motion planning for multiple robots having independent goals\u201d, Proceedings IEEE International Conference on Robotics and Automation, pp. 2847\u201052."},{"key":"key2022021719520017900_b16","unstructured":"LaValle, S.M. and Kuffner, J. Jr (2000), \u201cRapidly\u2010exploring random trees: progress and prospects\u201d, 2000 Workshop on the Algorithmic Foundations of Robotics."},{"key":"key2022021719520017900_b14","doi-asserted-by":"crossref","unstructured":"Lozano\u2010P\u00e9rez, T. (1983), \u201cSpatial planning: a configuration space approach\u201d, IEEE Transactions on Computers, Vol. 32 No. 2, pp. 108\u201020.","DOI":"10.1109\/TC.1983.1676196"},{"key":"key2022021719520017900_b18","doi-asserted-by":"crossref","unstructured":"Monteiro, D. and Madrid, M. (1999), \u201cPlanning of robot trajectories with genetic algorithm\u201d, Proceedings of the First Workshop on Robot Motion and Control, pp. 223\u20108.","DOI":"10.1109\/ROMOCO.1999.791079"},{"key":"key2022021719520017900_b7","doi-asserted-by":"crossref","unstructured":"Nilsson, N., Hart, P. and Raphael, B. (1968), \u201cA formal basis for the heuristic determination of minimum cost paths\u201d, IEEE Transactions on Systems Science and Cybernetics, Vol. 4 No. 2, pp. 100\u20107.","DOI":"10.1109\/TSSC.1968.300136"},{"key":"key2022021719520017900_b19","doi-asserted-by":"crossref","unstructured":"\u00d3'D\u00fanlaing, C. and Yap, C.K. (1985), \u201cA retraction method for planning the motion of a disc\u201d, Journal of Algorithms, Vol. 6 No. 1, pp. 104\u201011.","DOI":"10.1016\/0196-6774(85)90021-5"},{"key":"key2022021719520017900_b21","unstructured":"Rubio, F. (2006), \u201cPlanificacion de trayectorias de robots industriales. An\u00e1lisis en entornos con obst\u00e1culos\u201d, doctoral thesis, Universidad Polit\u00e9cnica de Valencia, Espa\u00f1a."},{"key":"key2022021719520017900_b20","doi-asserted-by":"crossref","unstructured":"Rubio, F., Valero, F., Sunyer, J. and Mata, V. (2009), \u201cDirect step\u2010by\u2010step method for industrial robot path planning\u201d, Industrial Robot, Vol. 36 No. 6, pp. 594\u2010607.","DOI":"10.1108\/01439910910994669"},{"key":"key2022021719520017900_b22","doi-asserted-by":"crossref","unstructured":"Schwartz, J.T. and Sharif, M. (1983), \u201cOn the piano movers' problem: II. General techniques for computing topological properties of real algebraic manifolds\u201d, Adv. Appl. Math., Vol. 4, pp. 298\u2010351.","DOI":"10.1016\/0196-8858(83)90014-3"},{"key":"key2022021719520017900_b23","doi-asserted-by":"crossref","unstructured":"Valero, F.J., Matab, V. and Cuadrado, J.I. (1997), \u201cA formulation for path planning of manipulators in complex environments by using adjacent configurations\u201d, Advanced Robotics, Vol. 11, pp. 33\u201056.","DOI":"10.1163\/156855397X00038"},{"key":"key2022021719520017900_b24","unstructured":"Yang, Z.Q., Liu, L.B. and Yang, W.D. (2008), \u201cFlexible inspection path planning based on adaptive genetic algorithm\u201d, Proceedings of Control and Decision Conference, China, pp. 1558\u201063."},{"key":"key2022021719520017900_frd1","unstructured":"Mata Amela, V. and Valero Chuli\u00e1, F.J. (1992), \u201cAlgorithms for robot path planning among obstacles\u201d, 23rd International Symposium on Industrial Robots."}],"container-title":["Industrial Robot: An International Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/01439911211268787","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/01439911211268787\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/01439911211268787\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:50:58Z","timestamp":1753401058000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ir\/article\/39\/6\/580-591\/179009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,12]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,10,12]]}},"alternative-id":["10.1108\/01439911211268787"],"URL":"https:\/\/doi.org\/10.1108\/01439911211268787","relation":{},"ISSN":["0143-991X"],"issn-type":[{"type":"print","value":"0143-991X"}],"subject":[],"published":{"date-parts":[[2012,10,12]]}}}