• Title/Summary/Keyword: 3d grid map

Search Result 51, Processing Time 0.028 seconds

3D Map-Building using Histogramic In-Motion Mapping in the Eyebot (HIMM을 이용한 3차원 지도작성)

  • 정현룡;김영배
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2003.06a
    • /
    • pp.1127-1130
    • /
    • 2003
  • This paper introduces histogramic in-motion mapping for real-time map building with the Eyebot in motion. A histogram grid used in HIMM is updated through three PSD sensors. HIMM makes it possible to make fast map-building and avoid obstacles in real-time. Fast map-building allows the robot to immediately use the mapped information in real-time obstacle-avoidance algorithms. HIMM has been tested on the Eyebot. The Eyebot sends PSD data to computer and computer builds a 3D-Map based on PSD data.

  • PDF

A Study on the Construction of a Drone Safety Flight Map and The Flight Path Search Algorithm (드론 안전비행맵 구축 및 비행경로 탐색 알고리즘 연구)

  • Hong, Ki Ho;Won, Jin Hee;Park, Sang Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.11
    • /
    • pp.1538-1551
    • /
    • 2021
  • The current drone flight plan creation creates a flight path point of two-dimensional coordinates on the map and sets an arbitrary altitude value considering the altitude of the terrain and the possible flight altitude. If the created flight path is a simple terrain such as a mountain or field, or if the user is familiar with the terrain, setting the flight altitude will not be difficult. However, for drone flight in a city where buildings are dense, a safer and more precise flight path generation method is needed. In this study, using high-precision spatial information, we construct a drone safety flight map with a 3D grid map structure and propose a flight path search algorithm based on it. The safety of the flight path is checked through the virtual drone flight simulation extracted by searching for the flight path based on the 3D grid map created by setting weights on the properties of obstacles and terrain such as buildings.

3D Detection of Obstacle Distribution and Mapping for Walking Guide of the Blind (시각 장애인 보행안내를 위한 장애물 분포의 3차원 검출 및 맵핑)

  • Yoon, Myoung-Jong;Jeong, Gu-Young;Yu, Kee-Ho
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.2
    • /
    • pp.155-162
    • /
    • 2009
  • In walking guide robot, a guide vehicle detects an obstacle distribution in the walking space using range sensors, and generates a 3D grid map to map the obstacle information and the tactile display. And the obstacle information is transferred to a blind pedestrian using tactile feedback. Based on the obstacle information a user plans a walking route and controls the guide vehicle. The algorithm for 3D detection of an obstacle distribution and the method of mapping the generated obstacle map and the tactile display device are proposed in this paper. The experiment for the 3D detection of an obstacle distribution using ultrasonic sensors is performed and estimated. The experimental system consisted of ultrasonic sensors and control system. In the experiment, the detection of fixed obstacles on the ground, the moving obstacle, and the detection of down-step are performed. The performance for the 3D detection of an obstacle distribution and space mapping is verified through the experiment.

A Study on Efficient Technique of 3-D Terrain Modelling (3차원 지형모델링의 효율적 기법에 관한 연구)

  • 윤철규;신봉호;양승룡;엄재구
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.15 no.2
    • /
    • pp.207-213
    • /
    • 1997
  • The purpose of this study is to aim at presenting efficient technique of 3-D Terrain Modelling through multilateral approach methods and to compare with raw data, using low-densed randomly located point data. The subject religion of this study are selected two sites and take into consideration for degree of freedom about low-densed randomly located point data. The result of this study by precision analysis of digital cartographic map-ping using low-densed randomly located point data bave shown that . First, making digital cartographic map, the technique of making it using low-desned randomly located point data by TIN-based results to good and fast run-time in A and B sites all together. Second, the visualization analysis results of digital cartographic map using TIN and GRID-based terrain modeling techniqus similar exacts A and B sites, but the terrain modeling techniqus by TIN-based are small data size than GRID-based with the data with the data size of saving with DXF files. Third, making digital catographic map using terrain modeling techniques by Grid-based, the standard errors of low-densed randomly located point data and interpolated data using gridding method have more good results by radial basis function interpolation techniques at A and B sites all together.

  • PDF

A Parallel Approach for Accurate and High Performance Gridding of 3D Point Data (3D 점 데이터 그리딩을 위한 고성능 병렬처리 기법)

  • Lee, Changseop;Rizki, Permata Nur Miftahur;Lee, Heezin;Oh, Sangyoon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.8
    • /
    • pp.251-260
    • /
    • 2014
  • 3D point data is utilized in various industry domains for its high accuracy to the surface information of an object. It is substantially utilized in geography for terrain scanning and analysis. Generally, 3D point data need to be changed by Gridding which produces a regularly spaced array of z values from irregularly spaced xyz data. But it requires long processing time and high resource cost to interpolate grid coordination. Kriging interpolation in Gridding has attracted because Kriging interpolation has more accuracy than other methods. However it haven't been used frequently since a processing is complex and slow. In this paper, we presented a parallel Gridding algorithm which contains Kriging and an application of grid data structure to fit MapReduce paradigm to this algorithm. Experiment was conducted for 1.6 and 4.3 billions of points from Airborne LiDAR files using our proposed MapReduce structure and the results show that the total execution time is decreased more than three times to the convention sequential program on three heterogenous clusters.

Map Building Based on Sensor Fusion for Autonomous Vehicle (자율주행을 위한 센서 데이터 융합 기반의 맵 생성)

  • Kang, Minsung;Hur, Soojung;Park, Ikhyun;Park, Yongwan
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.22 no.6
    • /
    • pp.14-22
    • /
    • 2014
  • An autonomous vehicle requires a technology of generating maps by recognizing surrounding environment. The recognition of the vehicle's environment can be achieved by using distance information from a 2D laser scanner and color information from a camera. Such sensor information is used to generate 2D or 3D maps. A 2D map is used mostly for generating routs, because it contains information only about a section. In contrast, a 3D map involves height values also, and therefore can be used not only for generating routs but also for finding out vehicle accessible space. Nevertheless, an autonomous vehicle using 3D maps has difficulty in recognizing environment in real time. Accordingly, this paper proposes the technology for generating 2D maps that guarantee real-time recognition. The proposed technology uses only the color information obtained by removing height values from 3D maps generated based on the fusion of 2D laser scanner and camera data.

Performance Evaluation of Denoising Algorithms for the 3D Construction Digital Map (건설현장 적용을 위한 디지털맵 노이즈 제거 알고리즘 성능평가)

  • Park, Su-Yeul;Kim, Seok
    • Journal of KIBIM
    • /
    • v.10 no.4
    • /
    • pp.32-39
    • /
    • 2020
  • In recent years, the construction industry is getting bigger and more complex, so it is becoming difficult to acquire point cloud data for construction equipments and workers. Point cloud data is measured using a drone and MMS(Mobile Mapping System), and the collected point cloud data is used to create a 3D digital map. In particular, the construction site is located at outdoors and there are many irregular terrains, making it difficult to collect point cloud data. For these reasons, adopting a noise reduction algorithm suitable for the characteristics of the construction industry can affect the improvement of the analysis accuracy of digital maps. This is related to various environments and variables of the construction site. Therefore, this study reviewed and analyzed the existing research and techniques on the noise reduction algorithm. And based on the results of literature review, performance evaluation of major noise reduction algorithms was conducted for digital maps of construction sites. As a result of the performance evaluation in this study, the voxel grid algorithm showed relatively less execution time than the statistical outlier removal algorithm. In addition, analysis results in slope, space, and earth walls of the construction site digital map showed that the voxel grid algorithm was relatively superior to the statistical outlier removal algorithm and that the noise removal performance of voxel grid algorithm was superior and the object preservation ability was also superior. In the future, based on the results reviewed through the performance evaluation of the noise reduction algorithm of this study, we will develop a noise reduction algorithm for 3D point cloud data that reflects the characteristics of the construction site.

Three-Dimensional Grid Generation Method for an Orthogonal Grid at the Boundary by Using Boundary Element Method (경계요소법을 이용한 경계에 직교하는 삼차원 격자형성법)

  • Jeong H. K.;Kwon J. H.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1995.10a
    • /
    • pp.82-89
    • /
    • 1995
  • In the present paper, a method of nearly orthogonal grid generation in an arbitrary simply-connected 3D domain will be presented. The method is a new direct and non-iterative scheme based on the concept of the decomposition of the global orthogonal transformation into consecutive mapping of a conformal mapping and an auxiliary orthogonal mapping, which was suggested by King and Leal [4]. In our numerical scheme. Kang and Leal's method is extended from 2D problems to 3D problems while the advantage of the non-iterative algorithm is maintained. The essence of the present mapping method is that an iterative scheme can be avoided by introducing a preliminary step. This preliminary step corresponds to a conformal map and is based on the boundary element method(BEM). This scheme is applied to generate several nearly-orthogonal grid systems which are orthogonal at boundaries.

  • PDF

Generation of a City Spatial Model using a Digital Map and Draft Maps for a 3D Noise Map (3차원 소음지도제작을 위한 도화원도와 수치지도를 이용한 도시공간모델 생성)

  • Oh, So-Jung;Lee, Im-Pyeong;Kim, Seong-Joon;Choi, Kyoung-Ah
    • Korean Journal of Remote Sensing
    • /
    • v.24 no.2
    • /
    • pp.179-188
    • /
    • 2008
  • This study aims for generating a city spatial model required for the creation of a 3D noise map. In this study, we propose an efficient method to generate 3D models of the terrain and buildings using only a digital map and draft maps previously established without using any sensory data. The terrain model is generated by interpolating into a grid the elevation values derived from both the contour lines and the elevation point of the digital map. Building model is generated by combining the 2D building boundaries and the building elevations extracted from the digital map and the draft map, respectively. This method has been then applied to a digital map and three sets of draft maps created in the different times. covering the entire area of Yeongdeungpo-gu. The generated city spatial model has been successfully utilized for the noise analysis and the 3D visualization of the analysis results.

Precision shape modeling by z-map model

  • Park, Jung-Whan;Chung, Yun-Chan;Choi, Byoung-Kyn
    • International Journal of Precision Engineering and Manufacturing
    • /
    • v.3 no.1
    • /
    • pp.49-56
    • /
    • 2002
  • The Z-map is a special farm of discrete non-parametric representation in which the height values at grid points on the xy-plane are stored as a 2D array z[ij]. While the z-map is the simplest farm of representing sculptured surfaces and is the most versatile scheme for modeling non-parametric objects, its practical application in industry (eg, tool-path generation) has aroused much controversy over its weaknesses, namely its inaccuracy, singularity (eg, vertical wall), and some excessive storage needs. Much research or the application of the z-map can be found in various articles, however, research on the systematic analysis of sculptured surface shape representation via the z-map model is rather rare. Presented in this paper are the following: shape modeling power of the simple z-map model, exact (within tolerance) z-map representation of sculptured surfaces which have some feature-shapes such as vertical-walls and real sharp-edges by adopting some complementary z-map models, and some application examples.