ICNGC 2025 The 11th International Conference on Next Generation Computing 2025 (2025.12)바로가기
페이지
pp.271-273
저자
Jonghwa Kim
언어
영어(ENG)
URL
https://www.earticle.net/Article/A478510
원문정보
초록
영어
The efficient deployment of robot-based manufacturing systems is frequently hindered by the substantial time required for programming collision-free robot paths during the commissioning process. This challenge involves intensive tasks such as teach-in, offline programming, and subsequent path optimization. To dramatically accelerate this critical stage, the industry needs an automatic and intelligent path planning system. This work introduces a novel system designed for the autonomous path planning of industrial robots. We conduct an explicit comparison between samplingbased methods such as probabilistic roadmaps (PRM) and rapidly exploring random Trees (RRT), and computational intelligence (CI) based methods, particularly genetic algorithms. Our findings demonstrate the potential for these advanced techniques to drastically reduce robot deployment time.
목차
Abstract I. INTRODUCTION II. RELATED WORK III. AUTOMATIC ROBOT PATH PLANNING A. Implementation B. Path Planning C. Sampling-based Planners D. Evolutionary Algorithms IV. EXPERIMENTAL RESULTS V. CONCLUSION REFERENCES