WO2021135845A1 - Procédé et système de marquage de surface routière - Google Patents

Procédé et système de marquage de surface routière Download PDF

Info

Publication number
WO2021135845A1
WO2021135845A1 PCT/CN2020/134393 CN2020134393W WO2021135845A1 WO 2021135845 A1 WO2021135845 A1 WO 2021135845A1 CN 2020134393 W CN2020134393 W CN 2020134393W WO 2021135845 A1 WO2021135845 A1 WO 2021135845A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
road
road surface
marking
optional implementation
Prior art date
Application number
PCT/CN2020/134393
Other languages
English (en)
Chinese (zh)
Inventor
于毅欣
Original Assignee
于毅欣
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 于毅欣 filed Critical 于毅欣
Publication of WO2021135845A1 publication Critical patent/WO2021135845A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29—Geographical information databases
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/09—Arrangements for giving variable traffic instructions
    • G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
    • G08G1/0967—Systems involving transmission of highway information, e.g. weather, speed limits

Definitions

  • the present invention relates to the field of computer technology, in particular to a method and system for marking road surfaces.
  • the present invention provides a method and system for marking roads and road surface information, which can provide a better or more effective description of the types of directions that can be driven.
  • One feature of the present invention is that the data structure is relatively simple, and road information can be marked for larger scenes.
  • another feature of the present invention is that it can really provide a possibility for distributed deployment servers to store distributed data.
  • a method for marking a road surface which is characterized in that it comprises:
  • the information of each vertex can be collected according to both sides of the road surface (relative to the drivable direction), refer to FIG. 1.
  • the information of the vertex includes global positioning information (GPS coordinates), or coordinates relative to the origin of a certain coordinate system.
  • the vertex information can be collected from the vertex on one side until it returns to the original vertex after a circle, refer to FIG. 2.
  • the collection interval of the vertices can have many kinds, which can be 0.1 m, 1 m, 10 m, 20 m, 50 m, etc., or customize according to needs.
  • the minimum height can be used to constrain the height of the road section polygon, or the minimum height can be separately stored as road marking information.
  • the road marking information may have a type of node that does not preferentially select driving to represent situations such as dirt roads and small roads.
  • the height of the road surface information where the sky is the height limit can be set to 1000 meters.
  • the road marking information of the current road section can be cut off when the road forks, and two new road marking information are created on the two road sections respectively. Refer to FIG. 3 for the style.
  • the polygons of each road marking information may overlap or intersect.
  • the method of dividing the target area (the area marked with road information by the method of the present invention) into a grid can be a square grid (seeing from the top view), and the square grid can be It is spread out equally in size, for example, a square grid with a radius of 100 kilometers or 10 kilometers or 1 kilometers.
  • the corresponding grid (the container to which it belongs) can be found for storage according to the coordinate area or the global positioning information area of the road marking information.
  • the road surface information data can be distributed and stored in different servers according to regions or grids.
  • a data request relay server can be used to check the data according to the regions and grids. The request to retrieve road information is distributed.
  • multiple servers can store the same information for certain key areas or grids.
  • load balancing servers can be used to distribute the amount of requests for retrieving road surface information.
  • the load balancing server may dynamically allocate the current retrieval task according to the retrieval amount shared by the sub-servers.
  • all road surface information data can be stored in a file or a folder.
  • the target area may be divided into different files for storage.
  • each grid in a target area can be divided into different files for storage.
  • each road marking information can also be stored as a file separately.
  • Fig. 1 schematically shows a schematic diagram of a method for collecting vertices from both sides, top view.
  • Fig. 2 schematically shows a schematic diagram of a style where the vertices are collected from one side to the end where the initial vertices are connected on the other side, top view.
  • FIG. 3 schematically shows a schematic diagram of a disconnection of road surface information at a fork intersection, a top view.
  • Fig. 4 schematically shows a schematic diagram of a method for dividing road surface information of various road sections at an intersection, a top view.
  • Step 1 Select a section of road and collect the vertex information on the left side of the road.
  • the vertex information is global positioning information or ⁇ and coordinate information (coordinate information is the coordinates relative to the origin of a certain coordinate system), and divide a road into the left
  • the two logical containers on the side and the right side separately store the vertices on the left in the vertex storage container on the left, and store the vertex information on the right separately in the vertex storage container on the right, as shown in Figure 1.
  • Step 2 After collecting the vertex information of the road surface information, set the type of the road surface information (such as single-lane, double-lane, types that cannot be driven, types that are not preferred, etc.), the maximum and minimum speed limits, Minimum height limit, containment box and other information.
  • type of the road surface information such as single-lane, double-lane, types that cannot be driven, types that are not preferred, etc.
  • the containment box (or containment rectangle or bounding box) of the road surface information can be obtained based on all vertices, and the calculation of this information (containing box) can be used to quickly determine overlap and intersection in the future.
  • Step 3 Determine the area to belong to according to the containment box information of the pre-delimited area (usually a horizontal rectangle, the coordinates of the four corners are the information to determine the area range).
  • a road surface information can belong to multiple areas, because the road surface information Sometimes it may be longer.
  • Step 4 Determine whether the road surface information is in a certain grid according to the edge information of the grid in each area defined in advance (also the containment box of the horizontal plane or the containment rectangle). If there is a little overlap, it is considered to be in this grid. In the grid, the same method of judging is to determine whether the containment box (containing rectangle) of the road information and the containing box (containing rectangle) of the grid have an overlapping area. If there is an overlapping area (use two rectangles to determine whether there is overlap), then It can be determined that the road surface information also belongs to this grid.
  • the details of the road surface information can be ignored here (that is, the overlap judgment is used to replace the judgment made by each vertex), because under normal circumstances, the grid will be relatively large and one
  • the road surface information in the grid is usually not much (for example, usually no more than 10,000), so it is not very accurate to determine whether the vertex list (polygon) of the road surface information accurately overlaps the grid.
  • Step 5 Store the road information in one area as a storage file or folder.
  • Step 6 Store the road surface information in a grid as a storage file or folder.
  • Step 1 Select a section of road, when collecting vertex information, start from one side and collect a circle of vertices until you return to the first vertex.
  • the sequence can be clockwise to collect connected vertices, as shown in Figure 2. .
  • Step 2 After collecting the vertex information of the road surface information, set the type of the road surface information (such as single-lane, double-lane, types that cannot be driven, types that are not prioritized, etc.), the maximum and minimum speed limits, Minimum height limit, containment box and other information.
  • type of the road surface information such as single-lane, double-lane, types that cannot be driven, types that are not prioritized, etc.
  • the containment box (or containment rectangle) of the road surface information can be obtained from all vertices, and the calculation of this information (containment box) can be used to quickly determine overlap and intersection in the future.
  • Step 3 Determine the area to belong to according to the containment box information of the pre-delimited area (usually a horizontal rectangle, the coordinates of the four corners are the information to determine the area range).
  • a road surface information can belong to multiple areas, because the road surface information Sometimes it may be longer.
  • Step 4 Determine whether the road surface information is in a certain grid according to the edge information of the grid in each area defined in advance (also the containment box of the horizontal plane or the containment rectangle). If there is a little overlap, it is considered to be in this grid. In the grid, the same method of judging is to determine whether the containment box (containing rectangle) of the road information and the containing box (containing rectangle) of the grid have an overlapping area. If there is an overlapping area (use two rectangles to determine whether there is overlap), then It can be determined that the road surface information also belongs to this grid.
  • the details of the road surface information can be ignored here (that is, the overlap judgment is used to replace the judgment made by each vertex), because under normal circumstances, the grid will be relatively large and one
  • the road surface information in the grid is usually not much (for example, usually no more than 10,000), so it is not very accurate to determine whether the vertex list (polygon) of the road surface information accurately overlaps the grid.
  • Step 5 Store the road information in one area as a storage file or folder.
  • Step 6 Store the road surface information in a grid as a storage file or folder.

Abstract

L'invention concerne un procédé et un système de marquage d'une route avec des informations de surface routière pouvant indiquer efficacement différents types de directions de conduite. Le procédé consiste à : marquer une surface de route avec des informations de marquage de surface routière ; et sauvegarder les informations de marquage de surface routière par stockage. Le procédé simplifie une structure de données, et peut être utilisé pour marquer des surfaces routières avec des informations de surface routière dans de nombreuses situations. Le procédé permet également à un serveur de déploiement de stocker des données de manière distribuée.
PCT/CN2020/134393 2019-12-29 2020-12-08 Procédé et système de marquage de surface routière WO2021135845A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201911386932.3A CN113051282A (zh) 2019-12-29 2019-12-29 一种标记路面的方法和系统
CN201911386932.3 2019-12-29

Publications (1)

Publication Number Publication Date
WO2021135845A1 true WO2021135845A1 (fr) 2021-07-08

Family

ID=76507361

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/134393 WO2021135845A1 (fr) 2019-12-29 2020-12-08 Procédé et système de marquage de surface routière

Country Status (2)

Country Link
CN (1) CN113051282A (fr)
WO (1) WO2021135845A1 (fr)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103186986A (zh) * 2011-12-31 2013-07-03 高德软件有限公司 一种用于终端上显示路况的方法、装置及设备
US20140267282A1 (en) * 2013-03-14 2014-09-18 Robert Bosch Gmbh System And Method For Context Dependent Level Of Detail Adjustment For Navigation Maps And Systems
CN104077326A (zh) * 2013-03-29 2014-10-01 北京图盟科技有限公司 一种道路数据的处理方法及装置
CN105488066A (zh) * 2014-09-19 2016-04-13 昆达电脑科技(昆山)有限公司 建置空间数据库的方法与空间数据库之数据结构产品
CN107480180A (zh) * 2017-07-05 2017-12-15 北京辰安信息科技有限公司 道路数据的处理方法、道路定位方法、装置及系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103186986A (zh) * 2011-12-31 2013-07-03 高德软件有限公司 一种用于终端上显示路况的方法、装置及设备
US20140267282A1 (en) * 2013-03-14 2014-09-18 Robert Bosch Gmbh System And Method For Context Dependent Level Of Detail Adjustment For Navigation Maps And Systems
CN104077326A (zh) * 2013-03-29 2014-10-01 北京图盟科技有限公司 一种道路数据的处理方法及装置
CN105488066A (zh) * 2014-09-19 2016-04-13 昆达电脑科技(昆山)有限公司 建置空间数据库的方法与空间数据库之数据结构产品
CN107480180A (zh) * 2017-07-05 2017-12-15 北京辰安信息科技有限公司 道路数据的处理方法、道路定位方法、装置及系统

Also Published As

Publication number Publication date
CN113051282A (zh) 2021-06-29

Similar Documents

Publication Publication Date Title
CN105701103B (zh) 一种基于地理信息的三维应用系统
CN106530170B (zh) 一种区域生态保护红线的边界优化方法
US20070253642A1 (en) Method and apparatus for indexing, storing and retrieving raster (GRID) data in a combined raster vector system
US9311380B2 (en) Processing spatial joins using a mapreduce framework
US8676489B2 (en) Positioning map views to show more optimal route information
US20150347457A1 (en) Automatic update for map cache
EP2565583A1 (fr) Dispositif de navigation, procédé de génération de carte et procédé de génération d'une base de données
CN103186986B (zh) 一种用于终端上显示路况的方法、装置
KR20120122957A (ko) 네비게이션 장치, 고도 좌표를 결정하는 방법 및 데이터베이스를 생성하는 방법
CA2829346A1 (fr) Methode et construction d'appareils et gestion d'actifs
CN113010793A (zh) 地图数据处理的方法、装置、设备、存储介质及程序产品
CN110083668B (zh) 一种高精度地图的数据管理系统、管理方法、终端和存储介质
EP2589933B1 (fr) Dispositif de navigation, procédé pour prédire la visibilité d'une face triangulaire dans une vue de carte électronique
WO2021135845A1 (fr) Procédé et système de marquage de surface routière
CN113298130A (zh) 目标图像的检测、目标对象检测模型的生成方法
CN105677843A (zh) 一种自动获取宗地四至属性的方法
WO2021169772A1 (fr) Procédé et système de marquage de scène
WO2021135846A1 (fr) Procédé et système de marquage de surface de roulement
CN113327503A (zh) 一种标记路面的方法和系统
Zaikanov et al. Principles of GIS support of geoenvironmental mapping at a regional level
CN102495902B (zh) 一种同时实现空间数据和属性数据etl过程的方法及系统
CN104778212A (zh) 地图数据生成方法和装置、地图数据读取方法和装置
CN111767295B (zh) 地图数据的处理方法、装置、计算设备和介质
CN113570256A (zh) 应用于城市规划的数据处理方法、装置、电子设备及介质
CN103106254A (zh) 多边形矢量数据文件的并行拼接方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20908738

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20908738

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 20908738

Country of ref document: EP

Kind code of ref document: A1

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 23/01/2023)