표제지
국문 요약
Abstract
목차
제1장 서론 12
1.1. 연구배경 12
1.2. 관련 연구 13
1.3. 연구 목적 14
1.4. 논문의 구성 15
제2장 형상의 표현 16
2.1. 배경 이론 16
2.2. 격자 데이터 생성 과정 17
2.3. 해상도의 정의 19
2.4. 입력 데이터 20
2.5. 피스의 외형선 정의 20
2.5.1. Implicit functions 21
2.6. 피스 내부 정의 알고리즘 31
2.7. 피스의 회전 34
제3장 배치 알고리즘 36
3.1. 단일 판(single plate) 배치 36
3.2. 다중 판(multiple plate) 배치 36
3.3. 배치 순서의 결정 37
3.3.1. 유전 알고리즘 37
3.4. 피스의 배치 44
3.4.1. 배치 알고리즘 44
3.4.2. 목적함수 46
3.5. 배치 결과 48
제4장 절단 경로 생성 53
4.1. G-code 53
4.2. 피스의 절단 순서 결정 55
4.2.1. 호의 볼록성 판별 55
4.2.2. 절단 경로 알고리즘 59
4.2.3. 실제 모형선 피스에 대한 절단 경로 생성 알고리즘 검증 62
제5장 결론 및 고찰 63
참고문헌 65
Table. 2.1. Determining the sign of the equation of a straight line 22
Table. 2.2. Determining the sign of the equation of an arc 23
Table. 2.3. Range of θ₁ and θ₂ to represent an arc 28
Table. 3.1. The procedure of a general GA 39
Table. 4.1. G-code list 53
Table. 4.2. Determination of convexity according to arc angle 58
Fig. 1.1. Model ship manufacturing process 12
Fig. 2.1. No-Fit-Polygon method 16
Fig. 2.2. Grid representation method 16
Fig. 2.3. Algorithm flow chart for model ship piece placement and cutting path generation 17
Fig. 2.4. The process of defining the shape of a piece 18
Fig. 2.5. Placement result due to resolution difference 19
Fig. 2.6. Data of the piece shape 20
Fig. 2.7. Representation of Explicit functions and Implicit functions 21
Fig. 2.8. Expression of the implicit function for the equation of a straight line 21
Fig. 2.9. Expression of the implicit function for the equation of an arc 22
Fig. 2.10. Creation of a grid for representing line segments 24
Fig. 2.11. Assigned values for lattice vertices 25
Fig. 2.12. Assigned values for the grid 26
Fig. 2.13. Calculation range of the grid 27
Fig. 2.14. Calculation result of the line segment 27
Fig. 2.15. θ₁ and θ₂ in the first quadrant 29
Fig. 2.16. Calculation range when θ₁ and θ₂ are in the first quadrant 29
Fig. 2.17. θ₁ in the first quadrant and θ₂ in the second quadrant 30
Fig. 2.18. Calculation range when θ₁ is in the second quadrant and θ₂ is in the second quadrant 31
Fig. 2.19. Search direction of BFS algorithm 31
Fig. 2.20. Creation of additional grids 32
Fig. 2.21. Process of BFS Algorithm 32
Fig. 2.22. Post-processing after applying the BFS algorithm 33
Fig. 2.23. Result of geometric representation of the model ship piece 33
Fig. 2.24. Arrangement at angles that cannot be placed 34
Fig. 2.25. Rotation of the piece 35
Fig. 3.1. Placing a piece on a single plate 36
Fig. 3.2. Representation of multiplate grids 37
Fig. 3.3. The components of a poluation 37
Fig. 3.4. Basic steps of genetic algorithm 38
Fig. 3.5. Case1 : Calculation of the fitness function 40
Fig. 3.6. Case2 : Calculation of the fitness function 41
Fig. 3.7. Duplication of genes 42
Fig. 3.8. Elimination of gene duplication 42
Fig. 3.9. Increased piece vertical size due to rotation of angle 43
Fig. 3.10. Mutation operation on layout order 43
Fig. 3.11. Layout algorithm flow chart 44
Fig. 3.12. Overlap detection of two pieces 45
Fig. 3.13. Search Range of pieces to be placed 46
Fig. 3.14. Calculation of the objective function ƒx, ƒu, and ƒxy[이미지참조] 47
Fig. 3.15. Pieces of the Model ship 48
Fig. 3.16. Arrangement in order of aspect ratio 49
Fig. 3.17. Arrangement in order of area 49
Fig. 3.18. Case 1 of Arrangement using genetic algorithm 49
Fig. 3.19. Case 1 of Arrangement using genetic algorithm when the grid size is 50mm 50
Fig. 3.20. Case 2 of Arrangement using genetic algorithm when the grid size is 25mm 50
Fig. 3.21. Case 2 of Arrangement using genetic algorithm when the grid size is 50mm 50
Fig. 3.22. Case 3 of Arrangement using genetic algorithm when the grid size is 25mm 51
Fig. 3.23. Case 3 of Arrangement using genetic algorithm when the grid size is 25mm 51
Fig. 3.24. Comparison of reusability when grid sizes are different 52
Fig. 4.1. Example for G00 and G01 53
Fig. 4.2. Example for G02 and G03 54
Fig. 4.3. Examples of reasons for judging convexity 55
Fig. 4.4. Example when the arc of the piece is convex 56
Fig. 4.5. Example when the arc of the piece is concave 57
Fig. 4.6. Exception Case example when the arc of the piece is concave 57
Fig. 4.7. Exception case example when the arc of the piece is convex 58
Fig. 4.8. Example of arrangement result including arc and line 59
Fig. 4.9. Example of how to select the first piece 60
Fig. 4.10. Example of how to select the second piece 60
Fig. 4.11. method for calculating the shortest path between the first piece and the second piece 61
Fig. 4.12. Result of piece cutting completion 61
Fig. 4.13. Verification of cutting path generation algorithm of model ship pieces 62