CN109800281A - The method of the positional relationship of Query Location point and fence in positioning system - Google Patents

The method of the positional relationship of Query Location point and fence in positioning system Download PDF

Info

Publication number
CN109800281A
CN109800281A CN201910057911.0A CN201910057911A CN109800281A CN 109800281 A CN109800281 A CN 109800281A CN 201910057911 A CN201910057911 A CN 201910057911A CN 109800281 A CN109800281 A CN 109800281A
Authority
CN
China
Prior art keywords
fence
coordinate
grid
anchor point
point
Prior art date
Legal status (The legal status 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 status listed.)
Pending
Application number
CN201910057911.0A
Other languages
Chinese (zh)
Inventor
赵强
谢飞鹏
余彦培
张宇
袁协
周加浩
吴彬
贾佺林
俞倩
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
SUZHOU SEEKOY ELECTRONIC TECHNOLOGY Co Ltd
Original Assignee
SUZHOU SEEKOY ELECTRONIC TECHNOLOGY Co Ltd
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 SUZHOU SEEKOY ELECTRONIC TECHNOLOGY Co Ltd filed Critical SUZHOU SEEKOY ELECTRONIC TECHNOLOGY Co Ltd
Priority to CN201910057911.0A priority Critical patent/CN109800281A/en
Publication of CN109800281A publication Critical patent/CN109800281A/en
Pending legal-status Critical Current

Links

Abstract

The method for the positional relationship of Query Location point and fence that the present invention provides a kind of in positioning system, time complexity is low, it is not influenced by the quantity of fence, the positional relationship of positioning body and fence can be quickly obtained in the large numbers of situations of fence.The following steps are included: carrying out gridding processing to plane map, serial number is carried out to grid;Establish fence;Coordinate system is established on plane map;Label is carried out to fence;The grid number that each fence is included is counted, the number of fence belonging to each grid is obtained;Pass through the coordinate of anchor point, obtain the corresponding grid number of anchor point, the number of fence belonging to anchor point is obtained, the positional relationship of anchor point and fence is obtained, can be used in the quantity for showing anchor point in region representated by fence in positioning system.

Description

The method of the positional relationship of Query Location point and fence in positioning system
Technical field
The present invention relates to location systems art fields, and in particular to Query Location point and fence in positioning system The method of positional relationship.
Background technique
With the continuous development of informationization technology, indoor positioning enters in fields such as factory, medical treatment, office, markets High speed development stage.Based on Indoor Location Information application in, Query Location main body which/which regional scope in be Very basic and important function, have this function can in the place of real-time display each region positioning body quantity.
Prior art is to calculate some positioning by indicating regional scope using plane irregularity polygon When which fence is main body belong to, each fence under current building is calculated it is primary, if the location point of main body is indicated in fence Polygon in then indicate in this region.Due to needing to be traversed for all fences, calculated one by one, the time calculated is multiple Miscellaneous degree is O (n), and n indicates fence quantity, and performance is excessively poor in the large numbers of situations of fence.The performance magnitude of scheme is ten thousand Grade is to 100,000 grades, i.e., per second to calculate tens of thousands of to hundreds of thousands time, specific value is related with hardware resource and polygon points;It It can solve the demand under small scene, small complications, but much reached not for the then performance under the conditions of large scene, high concurrent To requirement, for example, it is per second need to calculate 10,000,000 times in the case where, existing scheme needs tens of servers that could provide this Big computing capability.
Summary of the invention
The present invention is intended to provide a kind of method of the positional relationship of point of the Query Location in positioning system and fence, Time complexity is low, is not influenced by the quantity of fence, and positioning master can be quickly obtained in the large numbers of situations of fence The positional relationship of body and fence.
Its technical solution is such that a kind of side of the positional relationship of the point of the Query Location in positioning system and fence Method, which comprises the following steps:
Step S1: establishing coordinate system on plane map, using a corner of plane map as the origin of coordinate system, with The transverse direction of plane map is as X-direction, using the longitudinal direction of plane map as y-axis direction;
Step S2: gridding processing is carried out to plane map, plane map is divided into several square nets;
Step S3: since coordinate origin, serial number is carried out to grid along the sequence of Y-axis again along X-axis by elder generation;
Step S4: fence information is obtained, fence is established on plane map according to fence information;
Step S5: label is carried out to fence;
Step S6: the grid number that each fence is included is counted, the number of fence belonging to each grid is obtained;
Step S7: by the coordinate of anchor point, the corresponding grid number of anchor point is obtained, electronics belonging to anchor point is obtained Fence number, obtains the positional relationship of anchor point and fence, can be used in showing fence institute's generation in positioning system The quantity of anchor point in the region of table.
Further, step S6 execution specific as follows: each apex coordinate of each fence is obtained;
One coordinate points of composition of the smallest x-axis coordinate and the smallest y-axis coordinate composition in its apex coordinate are taken, then will The abscissa and ordinate of the coordinate points take the integral multiple of side length of element separately down, obtain coordinate points minP (Xmin, Ymin), The abscissa Xmin and ordinate Ymin of coordinate points minP are respectively the integral multiple of side length of element;
Take maximum x-axis coordinate and maximum y-axis coordinate to form a coordinate points, then by the abscissa of the coordinate points and Ordinate takes the integral multiple of side length of element upwards respectively, obtains coordinate points maxP (Xmax, Ymax), the abscissa of coordinate points maxP Xmax and ordinate Ymax is respectively the integral multiple of side length of element;
It is diagonally obtained with coordinate points minP (Xmin, Ymin) and coordinate points maxP (Xmax, Ymax) as a pair of rectangle One rectangular area traverses in rectangular area and arrives institute in coordinate points maxP (Xmax, Ymax) from coordinate points minP (Xmin, Ymin) There is the central point of grid, and calculates grid element center point whether in fence, if in fence, by the volume of the grid Number it is added in the grid numbered list that the fence is included, is net by the Data Representation of the relationship of fence and grid Lattice array, each element of grid array respectively represent the number of fence belonging to a grid.
Further, step S7 execution specific as follows: the coordinate of anchor point (x1, y1) is obtained;
Calculate corresponding grid number according to the coordinate of anchor point (x1, y1), respectively with the abscissa x1 of anchor point and Ordinate y1 is obtained carrying out rounding operation respectively, is indicated as follows divided by the side length of grid:
Rx=int (x1/a)
Ry=int (y1/a)
Wherein, a is the side length of grid;The corresponding grid number gridNum of anchor point (x1, y1) is indicated as follows:
GridNum=(ry*rowLen)+rx+1
Wherein, rowLen is the grid number of every row;It is index with grid number gridNum, it is fixed that inquiry grid array obtains Fence numbered list belonging to site (x1, y1).
Further, using the upper left corner of plane map as the origin of coordinate system, in the transverse direction of plane map, from left-hand It is right to be used as X-direction, on the longitudinal direction of plane map, it is used as y-axis direction from top to bottom.
The present invention is in the current affiliated area of calculating anchor point, it is only necessary to calculate corresponding grid according to the position of anchor point It numbers and then goes in pretreated list to inquire, the time complexity of this programme is (1) O, it is not related with fence quantity, Single server fence, which calculates the frequency, can achieve the order of magnitude of 10 6 powers multiplied by fence quantity, far super existing scheme;Fence Quantity is more, and this programme performance advantage is more obvious.
Detailed description of the invention
Fig. 1 is the schematic diagram after the foundation of the coordinate system in the embodiment of the present invention;
Fig. 2 is the schematic diagram in the embodiment of the present invention after plane map gridding;
Fig. 3 is the schematic diagram for the fence that the number in the embodiment of the present invention is 1.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete Site preparation description.
A kind of method of the positional relationship of of the invention point of the Query Location in positioning system and fence, including it is following Step: step S1: establishing coordinate system on plane map, using a corner of plane map as the origin of coordinate system, with flat The transverse direction of face map is as X-direction, using the longitudinal direction of plane map as y-axis direction;
Step S2: gridding processing is carried out to plane map, plane map is divided into several square nets;
Step S3: since coordinate origin, serial number is carried out to grid along the sequence of Y-axis again along X-axis by elder generation;
Step S4: fence information is obtained, fence is established on plane map according to fence information;
Step S5: label is carried out to fence;
Step S6: each apex coordinate of each fence is obtained;
One coordinate points of composition of the smallest x-axis coordinate and the smallest y-axis coordinate composition in its apex coordinate are taken, then will The abscissa and ordinate of the coordinate points take the integral multiple of side length of element separately down, obtain coordinate points minP (Xmin, Ymin), The abscissa Xmin and ordinate Ymin of coordinate points minP are respectively the integral multiple of side length of element;
Take maximum x-axis coordinate and maximum y-axis coordinate to form a coordinate points, then by the abscissa of the coordinate points and Ordinate takes the integral multiple of side length of element upwards respectively, obtains coordinate points maxP (Xmax, Ymax), the abscissa of coordinate points maxP Xmax and ordinate Ymax is respectively the integral multiple of side length of element;
It is diagonally obtained with coordinate points minP (Xmin, Ymin) and coordinate points maxP (Xmax, Ymax) as a pair of rectangle One rectangular area traverses in rectangular area and arrives institute in coordinate points maxP (Xmax, Ymax) from coordinate points minP (Xmin, Ymin) There is the central point of grid, and calculates grid element center point whether in fence, if in fence, by the volume of the grid Number it is added in the grid numbered list that the fence is included, is net by the Data Representation of the relationship of fence and grid Lattice array, each element of grid array respectively represent the number of fence belonging to a grid.;
Step S7: the coordinate of anchor point (x1, y1) is obtained;
Calculate corresponding grid number according to the coordinate of anchor point (x1, y1), respectively with the abscissa x1 of anchor point and Ordinate y1 is obtained carrying out rounding operation respectively, is indicated as follows divided by the side length of grid:
Rx=int (x1/a)
Ry=int (y1/a)
Wherein, a is the side length of grid;The corresponding grid number gridNum of anchor point (x1, y1) is indicated as follows:
GridNum=(ry*rowLen)+rx+1
Wherein, rowLen is the grid number of every row;It is index with grid number gridNum, it is fixed that inquiry grid array obtains Fence numbered list belonging to site (x1, y1), obtains the positional relationship of anchor point and fence, can be used in positioning system The quantity of anchor point in region representated by fence is shown in system.
A specific implementation case is given below and illustrates the point of the Query Location in positioning system and fence of the invention The method of positional relationship.
See Fig. 1, the region in Fig. 1 is 20 meters of length, and wide 16 meters of region positions it, and real-time display is each fixed Site region information.
Coordinate system is established to plane map, the upper left corner is (0,0) origin, is from left to right x-axis, is from top to bottom y-axis;
Plane map is subjected to gridding processing, and is numbered, one net of polishing if the grid of less than one, end Lattice, sizing grid 1m*1m, while recording every row and have 20 grids, rowLen is denoted as 20;See Fig. 2, shares 320 grids.
See Fig. 3, has the fence that a number is 1 in the region, the fence that number is 1 is an irregular polygon, is obtained Take composition one seat that per its each apex coordinate, x-axis coordinate the smallest in its apex coordinate and the smallest y-axis coordinate are formed Punctuate, coordinate are (3.8,1.0), then the abscissa of the coordinate points and ordinate are taken to the integer of side length of element separately down Times, coordinate points minP is obtained, the coordinate of minP is (3.0,1.0), and maximum x-axis coordinate and maximum y-axis coordinate is taken to form one A coordinate points, coordinate are (11.1,8.7), and then the abscissa of the coordinate points and ordinate round up side length of element respectively Integral multiple, obtain coordinate points maxP, the coordinate of maxP is (12.0,9.0), using coordinate points minP and coordinate points maxP as square A pair of shape diagonally obtains a rectangular area;
The central point of all grids from coordinate points minP to coordinate points maxP in rectangular area is traversed, and is calculated in grid Whether heart point is in fence, if the number of the grid, which is added to the fence, is included in fence In grid numbered list, as grid number that the number is 1 in the following figure fence includes is [28,47,48,66,67,68,69, 86,87,88,89,105,106,107,108,109,110,125,126,127,128,129,130,146,147,148,149, 150,166,167,168,169,170,171,187];It is grid array by the Data Representation of the relationship of fence and grid, Each element of grid array respectively represents the number of fence belonging to a grid;
After positioning body produces new anchor point (x1, y1), the fence area where it is inquired, according to anchor point The coordinate of (x1, y1) calculates corresponding grid number, respectively with the abscissa x1 and ordinate y1 of anchor point divided by grid Side length is obtained carrying out rounding operation respectively, is indicated as follows:
Rx=int (x1/a)
Ry=int (y1/a)
Wherein, a is the side length of grid;The corresponding grid number gridNum of anchor point (x1, y1) is indicated as follows:
GridNum=(ry*rowLen)+rx+1
Wherein, rowLen is the grid number of every row;It is index with grid number gridNum, it is fixed that inquiry grid array obtains Fence numbered list belonging to site (x1, y1), obtains the positional relationship of anchor point and fence, can be used in positioning system The quantity of anchor point in region representated by fence is shown in system.
The present invention is in the current affiliated area of calculating anchor point, it is only necessary to calculate corresponding grid according to the position of anchor point It numbers and then goes in pretreated list to inquire, the time complexity of this programme is (1) O, it is not related with fence quantity, Single server fence, which calculates the frequency, can achieve the order of magnitude of 10 6 powers multiplied by fence quantity, far super existing scheme;Fence Quantity is more, and this programme performance advantage is more obvious.
It is obvious to a person skilled in the art that invention is not limited to the details of the above exemplary embodiments, Er Qie In the case where without departing substantially from spirit or essential attributes of the invention, the present invention can be realized in other specific forms.Therefore, no matter From the point of view of which point, the present embodiments are to be considered as illustrative and not restrictive, and the scope of the present invention is by appended power Benefit requires rather than above description limits, it is intended that all by what is fallen within the meaning and scope of the equivalent elements of the claims Variation is included within the present invention.Any reference signs in the claims should not be construed as limiting the involved claims.

Claims (4)

1. a kind of method of the positional relationship of point of the Query Location in positioning system and fence, which is characterized in that including with Lower step:
Step S1: establishing coordinate system on plane map, using a corner of plane map as the origin of coordinate system, with plane The transverse direction of map is as X-direction, using the longitudinal direction of plane map as y-axis direction;
Step S2: gridding processing is carried out to plane map, plane map is divided into several square nets;
Step S3: since coordinate origin, serial number is carried out to grid along the sequence of Y-axis again along X-axis by elder generation;
Step S4: fence information is obtained, fence is established on plane map according to fence information;
Step S5: label is carried out to fence;
Step S6: the grid number that each fence is included is counted, the number of fence belonging to each grid is obtained;
Step S7: by the coordinate of anchor point, the corresponding grid number of anchor point is obtained, fence belonging to anchor point is obtained Number, obtains the positional relationship of anchor point and fence, can be used in showing representated by fence in positioning system The quantity of anchor point in region.
2. the side of the positional relationship of a kind of point of the Query Location in positioning system according to claim 1 and fence Method, which is characterized in that step S6 execution specific as follows:
Obtain each apex coordinate of each fence;
One coordinate points of composition for taking the smallest x-axis coordinate and the smallest y-axis coordinate composition in its apex coordinate, then by the seat The abscissa and ordinate of punctuate take the integral multiple of side length of element separately down, obtain coordinate points minP (Xmin, Ymin), coordinate The abscissa Xmin and ordinate Ymin of point minP are respectively the integral multiple of side length of element;
Maximum x-axis coordinate and maximum y-axis coordinate is taken to form a coordinate points, then by the abscissa of the coordinate points and vertical seat Mark takes the integral multiple of side length of element upwards respectively, obtains coordinate points maxP (Xmax, Ymax), the abscissa Xmax of coordinate points maxP It is respectively the integral multiple of side length of element with ordinate Ymax;
One is diagonally obtained as a pair of rectangle with coordinate points minP (Xmin, Ymin) and coordinate points maxP (Xmax, Ymax) Rectangular area traverses in rectangular area and arrives all nets in coordinate points maxP (Xmax, Ymax) from coordinate points minP (Xmin, Ymin) Center of a lattice point, and grid element center point is calculated whether in fence, if the number of the grid is added in fence It is added in the grid numbered list that the fence is included, is grid number by the Data Representation of the relationship of fence and grid Group, each element of grid array respectively represent the number of fence belonging to a grid.
3. a kind of method of the positional relationship of the point of the Query Location in positioning system and fence stated according to claim 2, It is characterized in that, step S7 execution specific as follows: obtaining the coordinate of anchor point (x1, y1);
Corresponding grid number is calculated according to the coordinate of anchor point (x1, y1), respectively with the abscissa x1 of anchor point and vertical seat Y1 is marked divided by the side length of grid, obtains carrying out rounding operation respectively, indicates as follows:
Rx=int (x1/a)
Ry=int (y1/a)
Wherein, a is the side length of grid;The corresponding grid number gridNum of anchor point (x1, y1) is indicated as follows:
GridNum=(ry*rowLen)+rx+1
Wherein, rowLen is the grid number of every row;It is index with grid number gridNum, inquiry grid array obtains anchor point Fence numbered list belonging to (x1, y1).
4. a kind of method of the positional relationship of the point of the Query Location in positioning system and fence stated according to claim 1, It is characterized in that, using the upper left corner of plane map as the origin of coordinate system, in the transverse direction of plane map, conduct from left to right X-direction on the longitudinal direction of plane map, is used as y-axis direction from top to bottom.
CN201910057911.0A 2019-01-22 2019-01-22 The method of the positional relationship of Query Location point and fence in positioning system Pending CN109800281A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910057911.0A CN109800281A (en) 2019-01-22 2019-01-22 The method of the positional relationship of Query Location point and fence in positioning system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910057911.0A CN109800281A (en) 2019-01-22 2019-01-22 The method of the positional relationship of Query Location point and fence in positioning system

Publications (1)

Publication Number Publication Date
CN109800281A true CN109800281A (en) 2019-05-24

Family

ID=66559938

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910057911.0A Pending CN109800281A (en) 2019-01-22 2019-01-22 The method of the positional relationship of Query Location point and fence in positioning system

Country Status (1)

Country Link
CN (1) CN109800281A (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110515942A (en) * 2019-07-12 2019-11-29 同济大学 A kind of storage and search method serializing lane line map
CN111078812A (en) * 2019-12-03 2020-04-28 支付宝(杭州)信息技术有限公司 Fence generation method and device and electronic equipment
CN111323025A (en) * 2020-02-25 2020-06-23 北京首汽智行科技有限公司 Coordinate judgment method based on GeoHash algorithm
CN111951089A (en) * 2020-08-05 2020-11-17 中国工商银行股份有限公司 House checking method and device
CN112596460A (en) * 2020-12-16 2021-04-02 读书郎教育科技有限公司 Method for quickly positioning material for servo/step-by-step driving motion system
CN114222249A (en) * 2021-12-15 2022-03-22 四川科瑞软件有限责任公司 Electronic fence monitoring method and system based on geographic position
CN115311840A (en) * 2022-10-12 2022-11-08 深圳海星智驾科技有限公司 Vehicle early warning method and device of electronic fence, electronic equipment and storage medium
CN115330270A (en) * 2022-10-12 2022-11-11 太极计算机股份有限公司 Target user risk judgment method and device, electronic device and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105491124A (en) * 2015-12-03 2016-04-13 北京航空航天大学 Distributed aggregation method for moving vehicles
CN107390243A (en) * 2017-06-09 2017-11-24 北斗导航位置服务(北京)有限公司 A kind of GNSS location datas and geography fence critical point thresholding method
CN108388621A (en) * 2018-02-11 2018-08-10 北京旋极伏羲大数据技术有限公司 Fence method and device

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105491124A (en) * 2015-12-03 2016-04-13 北京航空航天大学 Distributed aggregation method for moving vehicles
CN107390243A (en) * 2017-06-09 2017-11-24 北斗导航位置服务(北京)有限公司 A kind of GNSS location datas and geography fence critical point thresholding method
CN108388621A (en) * 2018-02-11 2018-08-10 北京旋极伏羲大数据技术有限公司 Fence method and device

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110515942A (en) * 2019-07-12 2019-11-29 同济大学 A kind of storage and search method serializing lane line map
CN110515942B (en) * 2019-07-12 2023-08-04 同济大学 Storage and retrieval method of serialized lane line map
CN111078812A (en) * 2019-12-03 2020-04-28 支付宝(杭州)信息技术有限公司 Fence generation method and device and electronic equipment
CN111078812B (en) * 2019-12-03 2023-09-05 支付宝(杭州)信息技术有限公司 Fence generation method and device and electronic equipment
CN111323025A (en) * 2020-02-25 2020-06-23 北京首汽智行科技有限公司 Coordinate judgment method based on GeoHash algorithm
CN111951089A (en) * 2020-08-05 2020-11-17 中国工商银行股份有限公司 House checking method and device
CN112596460A (en) * 2020-12-16 2021-04-02 读书郎教育科技有限公司 Method for quickly positioning material for servo/step-by-step driving motion system
CN114222249A (en) * 2021-12-15 2022-03-22 四川科瑞软件有限责任公司 Electronic fence monitoring method and system based on geographic position
CN115311840A (en) * 2022-10-12 2022-11-08 深圳海星智驾科技有限公司 Vehicle early warning method and device of electronic fence, electronic equipment and storage medium
CN115330270A (en) * 2022-10-12 2022-11-11 太极计算机股份有限公司 Target user risk judgment method and device, electronic device and storage medium

Similar Documents

Publication Publication Date Title
CN109800281A (en) The method of the positional relationship of Query Location point and fence in positioning system
Wheatley Cumulative viewshed analysis: a GIS-based method for investigating intervisibility, and its archaeological application
CN103336783B (en) Associating Thiessen polygon and the density map drafting method of inverse distance-weighting
CN103218517B (en) Regional network based on GIS is formatted density of population spatialization computing method
CN106503060A (en) A kind of transmission line of electricity three dimensional point cloud is processed and hands over across thing acquisition methods
CN102682115B (en) Dot density thematic map making method based on Voronoi picture
CN106600684B (en) A kind of oblique model tissue construction method
CN107193060A (en) A kind of multipath Typhoon Storm Surge Over method for quick predicting and system
CN105023283A (en) Power grid bird trouble map drawing method and system based on winter visitor migration route and habitat
CN115796712B (en) Regional land ecosystem carbon reserve estimation method and device and electronic equipment
CN106844757A (en) A kind of antenna azimuth Outlier mining method
CN104574449B (en) Projected area computational methods based on DEM
CN104619014A (en) SVM-KNN (Support Vector Machine-K Nearest Neighbor)-based indoor positioning method
CN107918953A (en) The extracting method and device of laser scanning power line point cloud based on three dimensions
CN105930671A (en) Improved versatile distribution and versatile mixture distribution models characterizing wind power probability distribution
CN113505189A (en) Planar target rasterization method based on multi-level global grid
CN103065295B (en) A kind of aviation based on buildings angle point self-correction and ground lidar data high-precision automatic method for registering
CN102565554B (en) Method for generating three-dimensional lightning positioned place flash point distribution map
CN110097585A (en) A kind of SAR image matching method and system based on SIFT algorithm
CN109450697A (en) The topological relation and link information methods of exhibiting of Satellite Networking
CN103810450B (en) Method and system for accurate area positioning of radio frequency identification
CN111062577B (en) GIS-based substation site selection method
CN111696330B (en) Classification method and system for wind disaster of power transmission line
CN113254855B (en) Terrain-based power generation gain calculation method and system
CN112861293A (en) Power transmission network wiring diagram generation method and device and electronic equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20190524

RJ01 Rejection of invention patent application after publication