In this paper, automatic programming for dual robots is proposed to realize autonomous robotic grinding of intersecting curves. Compared to grinding with a single robot, dual robots provide more degree-of-freedom to optimize the grinding path. In this paper, a special grinding path, named as intersecting grinding curve, will be realized by the dual robots. Since the intersecting curve is generated by two motions, the dual robots can decouple the motion and finish this task much easier and more effective than a single robot. Also, the motion of each joint becomes smoother, which will benefit for robotic grinding.
CITATION STYLE
Han, S., Zhao, X., Fan, Q., & Tao, B. (2019). Automatic programming for dual robots to grinding intersecting curve. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11745 LNAI, pp. 508–516). Springer Verlag. https://doi.org/10.1007/978-3-030-27529-7_43
Mendeley helps you to discover research relevant for your work.