{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T06:13:45Z","timestamp":1762409625335,"version":"build-2065373602"},"reference-count":32,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotics"],"abstract":"<jats:p>Moving from a given position to another with an industrial robot can be a challenging problem when the task is redundant around the tool axis. In this case, there are infinite ways of choosing both the starting and the ending configurations, so that the movement between the given points is not uniquely defined. In this paper, an algorithm that calculates the suboptimal movement between two positions is proposed, which automatically generates a cloud of safe via points around the workpiece and then by exploiting such points finds the suboptimal safe path between the two positions that minimizes movement time. The proposed method, in which the search of the suboptimal path is based on graph theory and the Dijkstra algorithm, can iteratively evaluate a high number of starting and ending configurations in low computational time, allowing performing a reasonably wide search of the suboptimal path within the infinite possible motions between the given points.<\/jats:p>","DOI":"10.3390\/robotics8040101","type":"journal-article","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T05:54:51Z","timestamp":1575870891000},"page":"101","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Trajectory Optimization of a Redundant Serial Robot Using Cartesian via Points and Kinematic Decoupling"],"prefix":"10.3390","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6611-173X","authenticated-orcid":false,"given":"Matteo","family":"Bottin","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering, University of Padova, 35131 Padova, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5150-9486","authenticated-orcid":false,"given":"Giulio","family":"Rosati","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, University of Padova, 35131 Padova, Italy"}]}],"member":"1968","published-online":{"date-parts":[[2019,12,9]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Ali, M.S.A.D., Babu, N., and Varghese, K. (2003). Offline Path Planning of Cooperative Manipulators Using Co-Evolutionary Genetic Algorithm.","DOI":"10.22260\/ISARC2002\/0065"},{"key":"ref_2","unstructured":"Biagiotti, L., and Melchiorri, C. (2008). Trajectory Planning for Automatic Machines and Robots, Springer Science & Business Media."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Bottin, M., Boschetti, G., and Rosati, G. (2018). A novel collision avoidance method for serial robots. IFToMM Symposium on Mechanism Design for Robotics, Springer.","DOI":"10.1007\/978-3-030-00365-4_35"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Chen, D., Li, S., Lin, F.-J., and Wu, Q. (2019). New super-twisting zeroing neural-dynamics model for tracking control of parallel robots: A finite-time and robust solution. IEEE Trans. Cybern.","DOI":"10.1109\/TCYB.2019.2930662"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.rcim.2017.04.007","article-title":"Optimal robot placement with consideration of redundancy problem for wrist-partitioned 6r articulated robots","volume":"48","author":"Doan","year":"2017","journal-title":"Robot. Comput. Integr. Manuf."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/ACCESS.2014.2302442","article-title":"Sampling-based robot motion planning: A review","volume":"2","author":"Elbanhawi","year":"2014","journal-title":"IEEE Access"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Ericson, C. (2004). Real-Time Collision Detection, CRC Press.","DOI":"10.1201\/b14581"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2316","DOI":"10.1109\/TCST.2015.2420624","article-title":"Design of an integral suboptimal second-order sliding mode controller for the robust motion control of robot manipulators","volume":"23","author":"Ferrara","year":"2015","journal-title":"IEEE Trans. Control. Syst. Technol."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. ACM"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Gottschalk, S., Lin, M.C., and Manocha, D. (1996, January 4\u20139). Obbtree: A hierarchical structure for rapid interference detection. Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques, New Orleans, LA, USA.","DOI":"10.1145\/237170.237244"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.rcim.2017.05.013","article-title":"Dynamic obstacle avoidance for manipulators using distance calculation and discrete detection","volume":"49","author":"Han","year":"2018","journal-title":"Robot. Comput. Integr. Manuf."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/70.508439","article-title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces","volume":"12","author":"Kavraki","year":"1996","journal-title":"IEEE Trans. Robot. Autom."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Khatib, O. (1986). Real-time obstacle avoidance for manipulators and mobile robots. Autonomous Robot Vehicles, Springer.","DOI":"10.1007\/978-1-4613-8997-2_29"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/2945.675649","article-title":"Efficient collision detection using bounding volume hierarchies of k-dops","volume":"4","author":"Klosowski","year":"1998","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_16","unstructured":"Larsen, E., Gottschalk, S., Lin, M.C., and Manocha, D. (1999). Fast Proximity Queries with Swept Sphere Volumes, Department of Computer Science, University of North Carolina. Technical Report, Technical Report TR99-018."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"LaValle, S.M. (2006). Planning Algorithms, Cambridge University Press.","DOI":"10.1017\/CBO9780511546877"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1177\/02783640122067453","article-title":"Randomized kinodynamic planning","volume":"20","author":"LaValle","year":"2001","journal-title":"Int. J. Robot. Res."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Lin, H.C., Liu, C., Fan, Y., and Tomizuka, M. (2017, January 27\u201330). Real-time collision avoidance algorithm on industrial manipulators. Proceedings of the 2017 IEEE Conference on Control Technology and Applications (CCTA), Mauna Lani, HI, USA.","DOI":"10.1109\/CCTA.2017.8062637"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.robot.2016.08.001","article-title":"Heuristic approaches in robot path planning: A survey","volume":"86","author":"Mac","year":"2016","journal-title":"Robot. Auton. Syst."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"231","DOI":"10.22201\/fi.25940732e.2008.09n3.018","article-title":"Single and multi-objective optimization of path placement for redundant robotic manipulators","volume":"9","author":"Zeghloul","year":"2008","journal-title":"INGENIER\u00cdA Investigaci\u00f3n y Tecnolog\u00eda"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Plaku, E., and Kavraki, L.E. (2008). Quantitative analysis of nearest-neighbors search in high-dimensional sampling-based motion planning. Algorithmic Foundation of Robotics VII, Springer.","DOI":"10.1007\/978-3-540-68405-3_1"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"02005","DOI":"10.1051\/matecconf\/201712602005","article-title":"Industrial robot trajectory optimization\u2014A review","volume":"126","author":"Ratiu","year":"2017","journal-title":"MATEC Web Conf."},{"key":"ref_24","unstructured":"Redon, S., Kheddar, A., and Coquillart, S. (2000, January 24\u201328). An algebraic solution to the problem of collision detection for rigid polyhedral objects. Proceedings of the IEEE International Conference on Robotics and Automation, ICRA\u201900, San Francisco, CA, USA."},{"key":"ref_25","unstructured":"Ribeiro, M.I. (2005). Obstacle Avoidance, Instituto de Sistemas e Rob\u00f3tica, Instituto Superio T\u00e9cnico."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Rodriguez-Garavito, C.H., Pati no-Forero, A.A., and Camacho-Munoz, G.A. (2018, January 6\u20138). Collision detector for industrial robot manipulators. Proceedings of the 13th International Conference on Soft Computing Models in Industrial and Environmental Applications, San Sebastian, Spain.","DOI":"10.1007\/978-3-319-94120-2_18"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1109\/56.804","article-title":"A solution algorithm to the inverse kinematic problem for redundant manipulators","volume":"4","author":"Sciavicco","year":"1988","journal-title":"IEEE J. Robot. Autom."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/B:JINT.0000004973.29102.33","article-title":"Motion planning for redundant manipulators using a floating point genetic algorithm","volume":"38","author":"Tian","year":"2003","journal-title":"J. Intell. Robot. Syst."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1007\/s10846-016-0362-z","article-title":"A review of global path planning methods for occupancy grid maps regardless of obstacle density","volume":"84","author":"Tsardoulias","year":"2016","journal-title":"J. Intell. Robot. Syst."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1111\/cgf.13113","article-title":"kdet: Parallel constant time collision detection for polygonal objects","volume":"Volume 36","author":"Weller","year":"2017","journal-title":"Computer Graphics Forum"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.rcim.2017.10.005","article-title":"Time-optimal trajectory planning for hyper-redundant manipulators in 3d workspaces","volume":"50","author":"Xidias","year":"2018","journal-title":"Robot. Comput. Integr. Manuf."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1155\/2016\/7426913","article-title":"Survey of robot 3d path planning algorithms","volume":"2016","author":"Yang","year":"2016","journal-title":"J. Control. Sci. Eng."}],"container-title":["Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2218-6581\/8\/4\/101\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:40:35Z","timestamp":1760190035000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2218-6581\/8\/4\/101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,9]]},"references-count":32,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2019,12]]}},"alternative-id":["robotics8040101"],"URL":"https:\/\/doi.org\/10.3390\/robotics8040101","relation":{},"ISSN":["2218-6581"],"issn-type":[{"type":"electronic","value":"2218-6581"}],"subject":[],"published":{"date-parts":[[2019,12,9]]}}}