• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1939-1944
• /
• 2003

This paper presents a global path planning algorithm based on a visibility graph method, and applies additionally various constraints for constructing the reduced visibility graph. The modification algorithm for generating the rounded path is applied to the globally shortest path of the visibility graph using the robot size constraint in order to avoid the obstacle. In order to check the visibility in given 3D map data, 3D CAD data with VRML format is projected to the 2D plane of the mobile robot, and the projected map is converted into an image for easy map analysis. The image processing are applied to this grid map for extracting the obstacles and the free space. Generally, the tree size of visibility graph is proportional to the factorial of the number of the corner points. In order to reduce the tree size and search the shortest path efficiently, the various constraints are proposed. After short paths that crosses the corner points of obstacles lists up, the shortest path among these paths is selected and it is modified to the combination of the line path and the arc path for the mobile robot to avoid the obstacles and follow the rounded path in the environment. The proposed path planning algorithm is applied to the mobile robot LCAR-III.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.389-392
• /
• 2000

Gouge-free tool-path generation is an important issue in mold & die machining and researches on cutter interference avoidance can be found in many articles. One of the various methods is construction of tool-offlet surface or cutter-location (CL) surface on which the cutter-center point (CL-point) locates. Provided that the CL surface is represented in a suitable form, cutter-interference avoidance can be performed without the burden of computing CL data for every cutter-contact (CC) point. In the paper, various methods of constructing a CL surface in the z-map form are presented, where z-map is a special form of discrete nonparametric representation in which the height values at grid points on the xy-plane are stored as a 2D array z［i,j］.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.4
• /
• pp.325-335
• /
• 2000

Gouge-free tool-path generation is an important issue in mold & die machining and researches on cutter interference avoidance can be found in many articles. One of the various methods is construction of tool-offset surface of cutter-location (CL) surface on which the cutter-center point (CL-point) locates. Provided that the CL surface is represented in a suitable form, cutter-interference avoidance can be performed without the burden of computing CL data for every cutter-contact (CC) point. In the paper, various methods of constructing a CL surface in the z-map form are presented, where z-map is a special form of discrete nonparametric representation in which the height values at grid points on the xy-plane are stored as a 2D array z[i,j].

• Journal of the Korean Association of Geographic Information Studies
• /
• v.10 no.3
• /
• pp.113-122
• /
• 2007

The rapid growth of aerial survey and remote sensing technology has enabled the rapid acquisition of very large amounts of geographic data, which should be analyzed using real-time visualization technology. The level of detail(LOD) algorithm is one of the most important elements for realizing real-time visualization. We chose the triangulated irregular network (TIN) method to generate normalized digital elevation model(DEM) data. First, we generated TIN data using contour lines obtained from a two-dimensional(2D) digital map and created a 2D grid array fitting the size of the area. Then, we generated normalized DEM data by calculating the intersection points between the TIN data and the points on the 2D grid array. We used constrained Delaunay triangulation(CDT) and ray-triangle intersection algorithms to calculate the intersection points between the TIN data and the points on the 2D grid array in each step. In addition, we simulated a three-dimensional(3D) terrain model based on normalized DEM data with real-time visualization using a Microsoft Visual C++ 6.0 program in the DirectX API library and a quad-tree LOD algorithm.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.3
• /
• pp.157-164
• /
• 2022

In this paper, we describe how to implement the mountainous terrain, radar, and air defense network for UAV path planning in a 3-D environment, and perform path planning and re-planning using the PRM algorithm, a sampling-based path planning algorithm. In the case of the original PRM algorithm, the calculation to check whether there is an obstacle between the nodes is performed 1:1 between nodes and is performed continuously, so the amount of calculation is greatly affected by the number of nodes or the linked distance between nodes. To improve this part, the proposed LineGridMask method simplifies the method of checking whether obstacles exist, and reduces the calculation time of the path planning through parallelization. Finally, comparing performance with existing PRM algorithms confirmed that computational time was reduced by up to 88% in path planning and up to 94% in re-planning.

• The Journal of Advanced Prosthodontics
• /
• v.15 no.3
• /
• pp.145-154
• /
• 2023

PURPOSE. The objective of this study was to investigate how internal structures influence the overall and marginal accuracy of full arch preparations fabricated through additive manufacturing in different printing systems. MATERIALS AND METHODS. A full-arch preparation digital model was set up with three internal designs, including solid, hollow, and grid. These were printed using three different resin printers with nine models in each group. After scanning, each data was imported into the 3D data processing software together with the master cast, aligned and trimmed, and then put into the 3D data analysis software again to compare the overall and marginal deviation whose results are expressed using root mean square values and color maps. To evaluate the trueness of the resin model, the test data and reference data were compared, and the precision was evaluated by comparing the test data sets. Color maps were observed for qualitative analysis. Data were statistically analyzed by one-way analysis of variance and Bonferroni method was used for post hoc comparison (α = .05). RESULTS. The influence of different internal structures on the accuracy of 3D printed resin models varied significantly (P < .05). Solid and grid models showed better accuracy, while the hollow model exhibited poor accuracy. The color maps show that the resin models have a tendency to shrink inwards. CONCLUSION. The internal structure design influences the accuracy of the 3D printing model, and the effect varies in different printing systems. Irrespective of the kind of printing system, the printing accuracy of hollow model was observed to be worse than those of solid and grid models.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.616-619
• /
• 2002

The z-map structure is widely used for NC tool path verification as it is very simple and fast in calculation of Boolean operations. However, if the number of the x-y grid points in a z-map is increased to enhance its accuracy, the computation time for NC verification increases rapidly. To reduce this computation time, we proposed a NC verification method using 3-D graphic acceleration hardwares. In this method, the z-map of the resultant workpiece machined by a NC program is obtained by rendering tool swept volumes along tool pathos and reading the depth buffer of the graphic card. The experimental results show that this hardware-based method is faster than the conventional software-based method.

• The Journal of Korea Robotics Society
• /
• v.9 no.3
• /
• pp.154-159
• /
• 2014

The Global Positioning System (GPS) is widely used to aid the navigation of aerial vehicles. However, the GPS cannot be used indoors, so alternative navigation methods are needed to be developed for micro aerial vehicles (MAVs) flying in GPS-denied environments. In this paper, a real-time three-dimensional (3-D) indoor navigation system and closed-loop control of a quad-rotor aerial vehicle equipped with an inertial measurement unit (IMU) and a low-cost light detection and ranging (LIDAR) is presented. In order to estimate the pose of the vehicle equipped with the two-dimensional LIDAR, an octree-based grid map and Monte-Carlo Localization (MCL) are adopted. The navigation results using the MCL are then evaluated by making a comparison with a motion capture system. Finally, the results are used for closed-loop control in order to validate its positioning accuracy during procedures for stable hovering and waypoint-following.

• International Journal of Computer Science & Network Security
• /
• v.22 no.12
• /
• pp.51-56
• /
• 2022

In space based constellation network, users are allowed to enter or leave the network arbitrarily. Hence, the number, identities and transmitted data of active users vary with time and have considerable impacts on the receiver's performance. The so-called problem of multiuser detection means identifying the identity of each active user and detecting the data transmitted by each active user. Traditional methods assume that the number of active users is equal to the maximum number of users that the network can hold. The model of traditional methods are simple and the performance are suboptimal. In this paper a Maximum A Posteriori Probability (MAP) based multiuser detection method is proposed. The proposed method models the activity state of users as Markov chain and transforms multiuser detection into searching optimal path in grid map with BCJR algorithm. Simulation results indicate that the proposed method obtains 2.6dB and 1dB E_b/N₀ gains respectively when activity detection error rate and symbol error rate reach 10^-3, comparing with reference methods.

• Advances in robotics research
• /
• v.1 no.2
• /
• pp.127-140
• /
• 2014

This work presents an IR-based system for parking assistance and obstacle detection in the automotive field that employs the Microsoft Kinect camera for fast 3D point cloud reconstruction. In contrast to previous research that attempts to explicitly identify obstacles, the proposed system aims to detect "reachable regions" of the environment, i.e., those regions where the vehicle can drive to from its current position. A user-friendly 2D traversability grid of cells is generated and used as a visual aid for parking assistance. Given a raw 3D point cloud, first each point is mapped into individual cells, then, the elevation information is used within a graph-based algorithm to label a given cell as traversable or non-traversable. Following this rationale, positive and negative obstacles, as well as unknown regions can be implicitly detected. Additionally, no flat-world assumption is required. Experimental results, obtained from the system in typical parking scenarios, are presented showing its effectiveness for scene interpretation and detection of several types of obstacle.