• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.2
• /
• pp.45-56
• /
• 2013

The precise identification of vehicle positions, known as the vehicle localization problem, is an important requirement for building intelligent vehicle ad-hoc networks (VANETs). To solve this problem, two categories of solutions are proposed: stand-alone and data fusion approaches. Compared to stand-alone approaches, which use single information including the global positioning system (GPS) and sensor-based navigation systems with differential corrections, data fusion approaches analyze the position information of several vehicles from GPS and sensor-based navigation systems, etc. Therefore, data fusion approaches show high accuracy. With the position information on a set of vehicles in the preprocessing stage, data fusion approaches is used to estimate the precise vehicular location in the local map building stage. This paper proposes an efficient local map building scheme, which increases the accuracy of the estimated vehicle positions via V2V communications. Even under the low ratio of vehicles with communication modules on the road, the proposed local map building scheme showed high accuracy when estimating the vehicle positions. From the experimental results based on the parameters of the practical vehicular environments, the accuracy of the proposed localization system approached the single lane-level.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.9 no.1
• /
• pp.102-110
• /
• 2000

This paper presents an algorithm of local map building for autonomous robot navigation using LASER range finder information. We develop a model of sensor output for a LASER range finder, and obtain an output data of the LASER range finder for a given environment. From the output data, a local map is obtained through the following procedures: (1) filtering of output data to remove noisy and unnecessary data, (2) comparison of filtered data with the original data to restore useful data, (3) thickening of the map obtained from the restored data, and (4) skeletonizing of the thickened map to get a final local map. Through some simulation studies, a map is obtained from the LASER range finder information for a given indoor environment, and is compared with the environment.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.10a
• /
• pp.99-104
• /
• 1999

This paper proposes an efficient method constructing a local map using the data of a scanning laser range finder. A laser range finder yields distance data of polar form, that is, distance data corresponding to every scanning directions. So, the data consists of directional angle and distance. We propose a new method to find a line fitting with a set of such data. The method uses Log-Hough Transformation. Usually, map building from these data requires some transformations between different coordinate systems. The new method alleviates such complication. Also, the method simplifies computation for line recognition and eliminates the slope quantization problems inherent in the classical Cartesian Hough transform method. To show the efficiency of the proposed method, it is applied to find a local map using the data from a laser range finder PLS(Proximity Laser Scanner, made by SICK).

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.38.3-38
• /
• 2002

$\textbullet$ The topological map using a thinning needs much simpler computation than that using a Voronoi. $\textbullet$ A thinning can provide much information on the environment (additional nodes). $\textbullet$ Each node created in a local map is considered as temporary and redundant nodes are discarded. $\textbullet$ A global topological map can be built fast and correctly through a thinning algorithm. $\textbullet$ Path planning can be easily achieved with a topological map.

• Proceedings of the KSME Conference
• /
• 2003.04a
• /
• pp.822-827
• /
• 2003

Topological maps have drawn more attention recently because they are compact, provide natural interfaces, and are applicable to path planning easily. To build a topological map incrementally, Voronoi diagram was used by many researchers. The Voronoi diagram, however, has difficulty in applying to arbitrarily shaped objects and needs long computation time. In this paper, we present a new method for global topological map from the local topological maps incrementally. The local topological maps are created through a thinning algorithm from a local grid map, which is built based on the sensor information at the current robot position. A thinning method requires simpler computation than the Voronoi diagram. Localization based on the topological map is usually difficult, but additional nodes created by the thinning method can improve localization performance. A series of experiments have been conducted using a two-wheeled mobile robot equipped with a laser scanner. It is shown that the proposed scheme can create satisfactory topological maps.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.6
• /
• pp.208-218
• /
• 2017

This study aims to develop the Vehicle Local Dynamic Map (V-LDM) and demonstrate its performance for providing dynamic map data efficiently to the vehicle control module. Firstly, the concept of the in-vehicle LDM has been established and then the system has been carefully designed according to the international standards. The high-precision digital map embedded in LDM has been designed to incorporate the lane-level information of road network, and the Dynamic Map protocol (DM protocol) which is a message protocol including the road data with dynamic traffic event data has been defined. The performance test of the proposed system has been conducted in the uninterrupted road section of Kyungbu expressway, showing that both of the data size and the elapsed time to finish the process are almost linearly proportional to the length of target road. Finally, it is recommended that the length of target road for DM protocol be less than 250m.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.666-669
• /
• 2000

Localization is the process of aligning the robot's local coordinates with the global coordinates of a map. A mobile robot's location is basically computed by a dead reckoning scheme, but this position information becomes increasingly inaccurate during navigation due to odometry errors. In this paper, the method of building a map of a robot's environment using ultrasonic sensor data and the occupancy grid map scheme is briefly presented. Then, the search and matching algorithms to compensate for the odometry error by comparing the local map with the reference map are proposed and verified by experiments. It is shown that the compensated error is not accumulated and exists within the limited range.

• Journal of the Korean Society for Precision Engineering
• /
• v.27 no.7
• /
• pp.36-48
• /
• 2010

This paper is concerned with stereo vision-based approach to detect obstacles and to generate the path of destination from the start. The hexapod robot in the experiment is cable of walking by legs and driving by wheels simultaneously. The hexapod robot operates under the driving mode normally, and it changes driving mode to walking mode to overcome obstacles using its legs. Disparity map, which is the correlation between two images taken by stereo camera, is employed for calculation of the distance between the robot and obstacles. When the obstacles information is extracted from the disparity map, the potential field algorithm is applied to create the obstacle-avoidance path. Simulator, based on OpenGL, is developed to generate the graphical path, and the experimental results are shown for the verification of the proposed algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.7
• /
• pp.693-699
• /
• 2006

An accurate and compact map is essential to an autonomous mobile robot system. For navigation, it is efficient to use an occupancy grid map because the environment is represented by probability distribution. But it is difficult to apply it to the large environment since it needs a large amount of memory proportional to the environment size. As an alternative, a topological map can be used to represent it in terms of the discrete nodes with edges connecting them. It is usually constructed by the Voronoi-like graphs, but in this paper the topological map is incrementally built based on the local grid map using the thinning algorithm. This algorithm can extract only meaningful topological information by using the C-obstacle concept in real-time and is robust to the environment change, because its underlying local grid map is constructed based on the Bayesian update formula. In this paper, the position probability is defined to evaluate the quantitative reliability of the end nodes of this thinning-based topological map (TTM). The global TTM can be constructed by merging each local TTM by matching the reliable end nodes determined by the position probability. It is shown that the proposed TTM can represent the environment accurately in real-time and it is readily extended to the global TTM.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.26 no.3
• /
• pp.275-284
• /
• 2008

The digital map needs efficiently updating. Because it is a base map at each local government and several geographic information systems and that is the key to enhancing to use spatial data. We suggest the linking method of building registers to the building layers of digital map, to update attribute data of the building layers. To conduct that, it is very important that each building in two data is linked by one-to-one matching. In this paper, we generate the strategy for renewing attribute data of the building layers based on identifier by using identifier of the new address system.