Abstract
The optimization of robot paths is important to reduce cycle times in industrial production processes. Even small time savings will accumulate and thus reduce production costs. This paper shows a method to automate the optimization of blended PTP movements for industrial robots and compares the performance of three metaheuristics. © Springer-Verlag Berlin Heidelberg 2012.
Author supplied keywords
Cite
CITATION STYLE
Severin, S., & Rossmann, J. (2012). A comparison of different metaheuristic algorithms for optimizing blended PTP movements for industrial robots. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7508 LNAI, pp. 321–330). https://doi.org/10.1007/978-3-642-33503-7_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
