Search Results

A Light Detection And Ranging (LiDAR) is now becoming an essential sensor for an autonomous vehicle. The LiDAR provides the surrounding environment information of the vehicle in the form of a point cloud. A decision-making system of the autonomous car is able to determine a safe and comfort maneuver by utilizing the detected LiDAR point cloud. The LiDAR points on the cloud are classified as dynamic or static class depending on the movement of the object being detected. If the movement class (dynamic or static) of detected points can be provided by LiDAR, the decision-making system is able to plan the appropriate motion of the autonomous vehicle according to the movement of the object. This paper proposes a real-time process to segment the motion states of LiDAR points. The basic principle of the classification algorithm is to classify the point-wise movement of a target point cloud through the other point clouds and sensor poses.

Intelligent driving assistant systems have been studied meticulously for autonomous driving. When the systems have the responsibility for driving itself, such as in an autonomous driving system, it should be aware of its’ surroundings including moving vehicles and must be able to evaluate collision risk for the ego vehicle's planned motion. However, when recognizing surrounding vehicles using a sensor, the measured information has uncertainty because of many reasons, such as noise and resolution. Many previous studies evaluated the collision risk based on the probabilistic theorem which the noise is modeled as a probability density function. However, the previous probabilistic solutions could not assess the collision risk and predict the motion of surrounding vehicles at the same time even though the motion is possible to be changed by the estimated collision risk.

Parking path planning is an essential technology for intelligent vehicles. Under a confined area, a parking path has to guide a vehicle into a parking space without collision. To realize this technology, circle-based planning algorithms have been studied. The main components of these algorithms are circles and straight lines; subsequently, the parking path of the algorithm is designed by the combination of these geometric lines. However, the circle-based algorithm was developed in an open space within an unlimited parking lot width, so a feasible path cannot always be guaranteed in a narrow parking lot. Therefore, we present a parking planning algorithm based on Turning Standard Line (TSL) that is a straight line segment. The algorithm uses the TSL lines to guide sequential quadratic Béizer curves. A set of these curves from parking start to goal position creates a continuous parking path.

An evidential theory is widely used for 2D grid-based localization in a robotics field because the theory has benefits to consider additional states such as 'unknown' and 'conflict'. However, there are some problems such as computational limitation and excessive resource share when the localization system is expanded from 2D grid to 3D voxel. In order to overcome the problems, this paper proposes the parallelized particle filter based localization system using 3D evidential voxel maps. A many-core processor based parallel computing framework with optimization techniques is applied to accelerate the computing power. Experiments were performed to evaluate the performance of the localization system in a complex environment, and to compare the computational time and resources between various types of processing units. The experimental results show that the proposed parallel particle filter is much more efficient than particle filter without parallel computing regarding computational cost.