Computing Gripping Points in 2D Parallel Surfaces Via Polygon Clipping

To generate suitable grasping positions between tessellated handling objects and specific planar grippers, we propose a 2D analytical approach which uses a polygon clipping algorithm to generate detailed information about the intersection between both objects. With the generated knowledge about the intersection we check whether its shape fits to the set criteria of the operator and represents a valid grasping position. Before the polygon clipping algorithm is applied, a preprocessing step is performed, where appropriate surfaces from the handling object and the gripper are extracted. After rotating all surfaces into a common plane, potential clipping positions are detected and the clipping is performed to get an accurate intersection detection. The validation shows comparable running times to a OBBTree algorithm (0.1 ms per grasping position) while increasing the stability of the results from 30 to 100% for the evaluated test objects.

Generating Road Networks for Old Downtown Areas Based on Crowd-Sourced Vehicle Trajectories

With the popularity of portable positioning devices, crowd-sourced trajectory data have attracted widespread attention, and led to many research breakthroughs in the field of road network extraction. However, it is still a challenging task to detect the road networks of old downtown areas with complex network layouts from high noise, low frequency, and uneven distribution trajectories. Therefore, this paper focuses on the old downtown area and provides a novel intersection-first approach to generate road networks based on low quality, crowd-sourced vehicle trajectories. For intersection detection, virtual representative points with distance constraints are detected, and the clustering by fast search and find of density peaks (CFDP) algorithm is introduced to overcome low frequency features of trajectories, and improve the positioning accuracy of intersections. For link extraction, an identification strategy based on the Delaunay triangulation network is developed to quickly filter out false links between large-scale intersections. In order to alleviate the curse of sparse and uneven data distribution, an adaptive link-fitting scheme, considering feature differences, is further designed to derive link centerlines. The experiment results show that the method proposed in this paper preforms remarkably better in both intersection detection and road network generation for old downtown areas.

Traffic Intersection Re-Identification Using Monocular Camera Sensors

Perception of road structures especially the traffic intersections by visual sensors is an essential task for automated driving. However, compared with intersection detection or visual place recognition, intersection re-identification (intersection re-ID) strongly affects driving behavior decisions with given routes, yet has long been neglected by researchers. This paper strives to explore intersection re-ID by a monocular camera sensor. We propose a Hybrid Double-Level re-identification approach which exploits two branches of Deep Convolutional Neural Network to accomplish multi-task including classification of intersection and its fine attributes, and global localization in topological maps. Furthermore, we propose a mixed loss training for the network to learn the similarity of two intersection images. As no public datasets are available for the intersection re-ID task, based on the work of RobotCar, we propose a new dataset with carefully-labeled intersection attributes, which is called “RobotCar Intersection” and covers more than 30,000 images of eight intersections in different seasons and day time. Additionally, we provide another dataset, called “Campus Intersection” consisting of panoramic images of eight intersections in a university campus to verify our updating strategy of topology map. Experimental results demonstrate that our proposed approach can achieve promising results in re-ID of both coarse road intersections and its global pose, and is well suited for updating and completion of topological maps.