*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************
Title: 5-axis coverage path planning with deep reinforcement learning and fast parallel collision detection
Xin Chen
School of Computer Science
College of Computing
Georgia Institute of Technology
Date: Friday, March 6, 2020
Time: 3:00 pm – 5:00 pm
Location: Coda C1315 Grant Park
Committee:
Dr. Richard Vuduc (Advisor, School of Computational Science and Engineering, Georgia Institute of Technology)
Dr. Thomas Kurfess (School of Mechanical Engineering, Georgia Institute of Technology)
Dr. Ümit Çatalyürek (School of Computational Science and Engineering, Georgia Institute of Technology)
Dr. Jeff Young (School of Computer Science, Georgia Institute of Technology)
Dr. Thomas Tucker (Tucker Innovations Inc.)
Abstract:
5-axis machining is a strategy that allows computer numerical control (CNC) move an object or cutting tool along five different axes (X, Y, Z and two additional rotary axes) simultaneously. This provides infinite possibilities of machining very complex objects, which is why 5-axis machining gets more and more popular. This thesis focuses on a path planning problem that arises in 5-axis machining applications: how to construct a tool path that covers the surface of a 3D object, produces a short milling time, and is collision-free. This thesis proposes a general path planning framework with a fast collision detection algorithm to generate an efficient 5-axis path.
We first present a unifying, general and adaptive framework with deep reinforcement learning, called adaptive deep path (AD Path), to generate an efficient path for covering an arbitrary 2D environment. The key idea of this algorithm is a new graph model based on boustrophedon cellular decomposition (BCD), which is a method of transforming a space into cell regions with morse decomposition. This graph model can easily reflect the physical distance in the graph, and evaluate the cost of an arbitrary path. We show that when applied to deep reinforcement learning, AD Path can efficiently reduce the path length and the number of corners adaptively.
Second, this thesis presents a fast parallel collision detection algorithm, named aggressive inaccessible cone angle (AICA) for CNC milling applications. The key idea of our proposed method is the concept of inaccessible cone angle (ICA), which is a new geometric abstraction for collision detection tests, and its effective use, including memoization to remove redundant work and increasing parallelization. We have prototyped our AICA algorithm within a real CNC milling tool, SculptPrint. Experimental results on 4 CAD benchmarks demonstrate that AICA is up to 23 times faster than the approach of a traditional checking.
Third, this thesis proposes a new 5-axis coverage path planning algorithm, called max orientation coverage, considering both the trajectory of the cutting tool end in 3-axis, and the orientations of the tool as the other 2 rotatory axes. This algorithm aims at reducing the machining time, by designing an efficient 5-axis path to reduce the number of tool reorientations and the number of tool retractions (pulling the tool back and in) as a constraint of being collision-free. Our proposed method employs a two-step optimization. We validate our method using four CAD benchmark objects against a previously proposed random sampling-based coverage algorithm. On average, our method improves the path efficiency by 29.7%.
