CN104346453A - ATS (Application Tracking System) path searching method and system - Google Patents
ATS (Application Tracking System) path searching method and system Download PDFInfo
- Publication number
- CN104346453A CN104346453A CN201410594729.6A CN201410594729A CN104346453A CN 104346453 A CN104346453 A CN 104346453A CN 201410594729 A CN201410594729 A CN 201410594729A CN 104346453 A CN104346453 A CN 104346453A
- Authority
- CN
- China
- Prior art keywords
- node
- path unit
- equivalent model
- terminal
- search
- 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
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Marketing (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses an ATS (Application Tracking System) path searching method and system. The ATS path searching method comprises the following steps: establishing a path unit list according to all path units in a station, wherein the path units refer to sections between two adjacent parking lots; forming an equivalent model diagram according to the path unit list; searching all paths from a starting point to a terminal point in the station in the equivalent model diagram. Through the abstraction of an original trajectory diagram into the equivalent model diagram, the maintenance of miscellaneous path information is replaced by the maintenance of few path unit information, so that maintenance time can be shortened, the workflow can be simplified to the utmost extent, and the work strength is reduced, labor and material investment is greatly reduced. The fact that the ATS system can timely and accurately calculate all the paths between the starting point and the terminal point through the application of the newest station data can be ensured, and so that the optimal path from the paths can be selected.
Description
Technical field
The present invention relates to urban rail transit technology field, particularly a kind of ATS application route search method and system.
Background technology
Automatic train monitoring (Automatic Train Supervision, being called for short ATS) system is in track traffic administration, realize the operation of train on automatic supervision, control line, its major function comprises: establishment service chart, automatically train route is handled according to service chart, automatic adjustment Train Interval, record service data etc.
Application route search is exactly calculate from all routes between origin-to-destination, therefrom preferentially as practical application route.When control route and verification route, the method for application route search all can be used.
At present, in urban rail transit vehicles dispatching system, the route of all planning is all pre-configured, and when search pattern, dispatching system is searched for from the route be configured.Such as, shown in Figure 1 is fractional orbital schematic diagram, from A to B, needs to configure following route:
1—>2—>3—>4—>5；
1—>6—>7—>8—>3—>4—>5；
1—>2—>3—>9—>10—>11—>5；
1—>6—>7—>8—>3—>9—>10—>11—>5。
There are two track switches in track shown in Fig. 1, need configuration 2
2bar route; The corresponding relation of track switch and route can be known by inference, have n track switch if having in track, then need configuration 2
nbar route, for more complicated track, then need to configure more route, every bar circuit is all made up of multiple section.
In the method for existing configuration route, all routes all need human configuration, if also all adopt the method for human configuration for the track of complexity, so workload is just very large, configures extremely difficult.When certain section of section impassability in circuit or recovery are passed through, have the situation appearance that section reduces or increases, need long time and a large amount of manpowers to remove to increase and decrease the route of configuration, cause information updating comparatively slow, dispatching system can not obtain correct route information in time.No matter be configuration or change configuration in visible prior art, a large amount of work all adopts manual operation, can not ensure the accuracy of data, can not ensure that the route configured comprises whole routes.
Summary of the invention
Cannot meet indoor to the real-time location of personnel and the technical matters of dispatching person works's situation to solve prior art, on the one hand,
The invention provides a kind of ATS application route search method, comprising:
Set up path unit list according to all path unit in field, station, described path unit is the section between adjacent two stops;
According to described path unit list builder equivalent model figure;
All routes in described equivalent model figure between search starting point to terminal.
Optionally, comprise according to the step of described path unit list builder equivalent model figure:
Each path unit etc. in described path unit list is all a node;
Directed connection is carried out to described node and adjacent node, forms described equivalent model figure.
Optionally, depth-priority-searching method is adopted during all routes in described equivalent model figure between search starting point to terminal.
Optionally, the step of all routes in described equivalent model figure between search starting point to terminal comprises:
From described starting point, the direction along directed connection starts to access each node in described equivalent model figure;
Judge whether that all nodes are all accessed, if it is terminate search;
All accessed if not all nodes, then continue to judge whether the node of last access is terminal, if the node of last access is terminal, then record the circuit searched out, and return and judge whether that all nodes are all accessed;
If the node of last access is not terminal, then access next node is continued in the direction along described directed connection, returns afterwards and continues to judge whether that all nodes are all accessed.
Optionally, the direction of described directed connection is from origin-to-destination.
On the other hand,
Present invention also offers a kind of ATS application route search system, comprising:
List Generating Module, for setting up path unit list according to all path unit in field, station, described path unit is the section between adjacent two stops;
Design of graphics module, for according to described path unit list builder equivalent model figure;
Search module, for all routes in described equivalent model figure between search starting point to terminal.
Optionally, described design of graphics module comprises:
Equivalent partition submodule, for being all a node by each path unit etc. in described path unit list;
Directed connection submodule, for carrying out directed connection to described node and adjacent node, forms described equivalent model figure.
Optionally, depth-priority-searching method is adopted during all routes between described search module search starting point to terminal.
Optionally, described search module comprises:
First access submodule, for from described starting point, the direction along directed connection starts to access each node in described equivalent model figure;
First judges submodule, for judging whether that all nodes are all accessed, if it is terminates search; All accessed if not all nodes, then go to the second judgement submodule;
Second judges submodule, for judging whether the node of last access is terminal, if the node of last access is terminal, then records the circuit searched out, and is back to described first and judges submodule; If the node of last access is not terminal, then go to the second access submodule;
Second access submodule, for continuing access next node along the direction of described directed connection, returning described first afterwards and judging submodule.
Optionally, the direction of described directed connection is from origin-to-destination.
ATS application route search method provided by the invention, by original trajectory diagram is abstracted into equivalent model figure, to safeguard that a small amount of path unit information replaces safeguarding lengthy and jumbled heavy line information, maintenance time can be shortened, can also workflow be simplified to a great extent, reduce working strength, greatly reduce manpower and materials and drop into, guarantee that ATS system the up-to-date station field data of application promptly and accurately can calculate all routes between origin-to-destination, and therefrom select optimal route.
Accompanying drawing explanation
Fig. 1 is the track schematic diagram in existing urban rail transit vehicles dispatching system;
A kind of flow chart of steps of ATS application route search method of Fig. 2 for providing in the embodiment of the present invention one;
Fig. 3 is the flow chart of steps of step S100 in the embodiment of the present invention one;
Fig. 4 is the equivalent model figure that in the embodiment of the present invention one, step S200 builds;
Fig. 5 is the flow chart of steps of step S300 in the embodiment of the present invention one;
A kind of composition schematic diagram of ATS application route search system of Fig. 6 for providing in the embodiment of the present invention two.
Embodiment
Below in conjunction with drawings and Examples, the specific embodiment of the present invention is described in further detail.Following examples for illustration of the present invention, but are not used for limiting the scope of the invention.
Embodiment one
Present embodiments provide a kind of ATS application route search method, flow chart of steps as shown in Figure 2, comprises the following steps:
Step S100, according to station field in all path unit set up path unit list, path unit is the section between adjacent two stops;
Step S200, according to path unit list builder equivalent model figure;
Step S300, all routes in equivalent model figure between search starting point to terminal.
Optionally, comprise the following steps in step S200 according to the flow chart of steps of path unit list builder equivalent model figure as shown in Figure 3:
Step S201, each path unit etc. in path unit list is all a node.
Step S202, directed connection is carried out to node and adjacent node, form equivalent model figure.
First list in input path unit, is equivalent to a node by each path unit, and is added in equivalent model figure by corresponding for node, calculates the neighbor node of each node.Final equivalent model figure carries out directed connection formation to all nodes, a part in equivalent model figure as shown in Figure 4, Fig. 4 interior joint numbering and the line unit numbering one_to_one corresponding in Fig. 1, such as node 1 corresponding line unit 1, node 1 has two to the path of node 3, article one, be that another is successively by node 6,7,8, also with line unit in Fig. 11 to line unit 3 can be conformed to by line unit 3 or line unit 6,7,8 directly by node 2.
Optionally, depth-priority-searching method is adopted during all routes in step S300 in equivalent model figure between search starting point to terminal, starting point wherein and terminal are relative, need to specify according to demand at every turn, and the starting point selected in different circuit search plans is generally different with terminal.For the equivalent model figure in Fig. 4, only have arrow point out not have arrow refer to into node 1 be the start node of circuit, namely starting point; Only having arrow to refer to is the terminal node of circuit into the node 5 not having arrow to point out, namely terminal.
Optionally, the flow chart of steps of all routes in step S300 in equivalent model figure between search starting point to terminal as shown in Figure 5, comprises the following steps:
Step S301, from the off, the direction along directed connection starts each node of accessing in equivalent model figure.
Step S302, judge whether that all nodes are all accessed, if it is terminate search.
Step S303, all accessed if not all nodes, then continue to judge whether the node of last access is terminal, if the node of last access is terminal, then go to step S304.
Step S304, record the circuit that searches out, and return and judge whether that all nodes are all accessed.
If the node of step S305 finally access is not terminal, then access next node is continued in the direction along directed connection, returns afterwards and continues to judge whether that all nodes are all accessed.
Searching of line namely carries out figure traversing operation in equivalent model figure, adopts depth-first traversal algorithm to carry out searching of line in the present embodiment, and can ensure that all route searchs are not heavy and not leak, accuracy is high.
Optionally, the direction of directed connection is from origin-to-destination.See Fig. 4, node 1 is starting point, and node 5 is terminal, and node closure is between the two from node 1 to node 5.
Trajectory diagram is abstracted into mathematical model figure by the method that the present embodiment provides, and utilizes the thought of depth-first traversal to carry out search pattern, simply, fast, in time, search pattern accurately.To safeguard a small amount of path unit information, instead of and safeguard lengthy and jumbled heavy route information, considerably simplify workflow, reduce working strength, greatly reduce manpower and materials and drop into, guarantee in time, apply up-to-date station field data accurately; Secondly, whole system is more intelligent, more reliable, and system can adapt to more complicated field, station very easily, improves the adaptability of system; Again, the automatization level of system improves greatly, provides possibility to automatic cruising and unpiloted realization.
Embodiment two
Present invention also offers a kind of ATS application route search system, composition schematic diagram as shown in Figure 6, comprising:
List Generating Module 100, for setting up path unit list according to all path unit in field, station, path unit is the section between adjacent two stops;
Design of graphics module 200, for according to path unit list builder equivalent model figure;
Search module 300, for all routes in equivalent model figure between search starting point to terminal.
Optionally, design of graphics module 200 comprises:
Equivalent partition submodule 201, for being all a node by each path unit etc. in path unit list;
Directed connection submodule 202, for carrying out directed connection to node and adjacent node, forms equivalent model figure.
Optionally, depth-priority-searching method is adopted during all routes between search module 300 search starting point to terminal.
Optionally, the composition schematic diagram of search module 300 as shown in Figure 6, comprising:
First access submodule 301, for from the off, the direction along directed connection starts each node of accessing in equivalent model figure;
First judges submodule 302, for judging whether that all nodes are all accessed, if it is terminates search; All accessed if not all nodes, then go to the second judgement submodule 303;
Second judges submodule 303, for judging whether the node of last access is terminal, if the node of last access is terminal, then records the circuit searched out, and being back to the first judgement submodule 302; If the node of last access is not terminal, then go to the second access submodule 304;
Second access submodule 304, for continuing access next node along the direction of directed connection, returns the first judgement submodule 302 afterwards.
Optionally, directed connection submodule 202 carries out the direction of directed connection is from origin-to-destination.
ATS application route search provided by the invention is identical, by original trajectory diagram is abstracted into equivalent model figure, to safeguard that a small amount of path unit information replaces safeguarding lengthy and jumbled heavy line information, maintenance time can be shortened, can also workflow be simplified to a great extent, reduce working strength, greatly reduce manpower and materials and drop into, guarantee that ATS system the up-to-date station field data of application promptly and accurately can calculate all routes between origin-to-destination, and therefrom select optimal route.
Above embodiment is only for illustration of the present invention; and be not limitation of the present invention; the those of ordinary skill of relevant technical field; without departing from the spirit and scope of the present invention; can also make a variety of changes and modification; therefore all equivalent technical schemes also belong to category of the present invention, and scope of patent protection of the present invention should be defined by the claims.
Claims (10)
1. an ATS application route search method, is characterized in that, comprising:
Set up path unit list according to all path unit in field, station, described path unit is the section between adjacent two stops;
According to described path unit list builder equivalent model figure;
All routes in described equivalent model figure between search starting point to terminal.
2. method according to claim 1, is characterized in that, the step according to described path unit list builder equivalent model figure comprises:
Each path unit etc. in described path unit list is all a node;
Directed connection is carried out to described node and adjacent node, forms described equivalent model figure.
3. method according to claim 1, is characterized in that, adopts depth-priority-searching method during all routes in described equivalent model figure between search starting point to terminal.
4. method according to claim 2, is characterized in that, the step of all routes in described equivalent model figure between search starting point to terminal comprises:
From described starting point, the direction along directed connection starts to access each node in described equivalent model figure;
Judge whether that all nodes are all accessed, if it is terminate search;
All accessed if not all nodes, then continue to judge whether the node of last access is terminal, if the node of last access is terminal, then record the circuit searched out, and return and judge whether that all nodes are all accessed;
If the node of last access is not terminal, then access next node is continued in the direction along described directed connection, returns afterwards and continues to judge whether that all nodes are all accessed.
5. the method according to claim 2 or 4, is characterized in that, the direction of described directed connection is from origin-to-destination.
6. an ATS application route search system, is characterized in that, comprising:
List Generating Module, for setting up path unit list according to all path unit in field, station, described path unit is the section between adjacent two stops;
Design of graphics module, for according to described path unit list builder equivalent model figure;
Search module, for all routes in described equivalent model figure between search starting point to terminal.
7. system according to claim 6, is characterized in that, described design of graphics module comprises:
Equivalent partition submodule, for being all a node by each path unit etc. in described path unit list;
Directed connection submodule, for carrying out directed connection to described node and adjacent node, forms described equivalent model figure.
8. system according to claim 6, is characterized in that, adopts depth-priority-searching method during all routes between described search module search starting point to terminal.
9. system according to claim 7, is characterized in that, described search module comprises:
First access submodule, for from described starting point, the direction along directed connection starts to access each node in described equivalent model figure;
First judges submodule, for judging whether that all nodes are all accessed, if it is terminates search; All accessed if not all nodes, then go to the second judgement submodule;
Second judges submodule, for judging whether the node of last access is terminal, if the node of last access is terminal, then records the circuit searched out, and is back to described first and judges submodule; If the node of last access is not terminal, then go to the second access submodule;
Second access submodule, for continuing access next node along the direction of described directed connection, returning described first afterwards and judging submodule.
10. the system according to claim 7 or 9, is characterized in that, the direction of described directed connection is from origin-to-destination.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410594729.6A CN104346453A (en) | 2014-10-29 | 2014-10-29 | ATS (Application Tracking System) path searching method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410594729.6A CN104346453A (en) | 2014-10-29 | 2014-10-29 | ATS (Application Tracking System) path searching method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104346453A true CN104346453A (en) | 2015-02-11 |
Family
ID=52502044
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410594729.6A Pending CN104346453A (en) | 2014-10-29 | 2014-10-29 | ATS (Application Tracking System) path searching method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104346453A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107640181A (en) * | 2017-08-30 | 2018-01-30 | 交控科技股份有限公司 | Any destination TD method and device based on truck traffic |
| CN108027985A (en) * | 2015-08-20 | 2018-05-11 | 株式会社赛班奥科 | Path generation program, path generating method and coordinates measurement device |
| CN111731351A (en) * | 2020-06-18 | 2020-10-02 | 中国铁道科学研究院集团有限公司通信信号研究所 | Method for double-period interactive real-time searching route and matching and modifying route trend |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2011169874A (en) * | 2010-02-22 | 2011-09-01 | Buaru Kenkyusho:Kk | Route searching system, method, and computer program for transportation |
| CN102343923A (en) * | 2011-07-07 | 2012-02-08 | 北京和利时系统工程有限公司 | Automatic train supervision system and train tracking method |
| CN102490769A (en) * | 2011-11-24 | 2012-06-13 | 广州市地下铁道总公司 | Track traffic driving state diagram realization method based on GIS (Geographic Information System) |
| CN102567389A (en) * | 2010-12-17 | 2012-07-11 | 日电（中国）有限公司 | Combined traffic network forming method and equipment as well as path searching method and equipment |
| CN102874279A (en) * | 2012-09-26 | 2013-01-16 | 北京交控科技有限公司 | Train route handling method |
| CN103738364A (en) * | 2013-12-16 | 2014-04-23 | 北京交控科技有限公司 | Zone searching method and system |
| CN103863365A (en) * | 2014-03-21 | 2014-06-18 | 上海富欣智能交通控制有限公司 | Method for generating track traffic route topological graph by directed graph method |
-
2014
- 2014-10-29 CN CN201410594729.6A patent/CN104346453A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2011169874A (en) * | 2010-02-22 | 2011-09-01 | Buaru Kenkyusho:Kk | Route searching system, method, and computer program for transportation |
| CN102567389A (en) * | 2010-12-17 | 2012-07-11 | 日电（中国）有限公司 | Combined traffic network forming method and equipment as well as path searching method and equipment |
| CN102343923A (en) * | 2011-07-07 | 2012-02-08 | 北京和利时系统工程有限公司 | Automatic train supervision system and train tracking method |
| CN102490769A (en) * | 2011-11-24 | 2012-06-13 | 广州市地下铁道总公司 | Track traffic driving state diagram realization method based on GIS (Geographic Information System) |
| CN102874279A (en) * | 2012-09-26 | 2013-01-16 | 北京交控科技有限公司 | Train route handling method |
| CN103738364A (en) * | 2013-12-16 | 2014-04-23 | 北京交控科技有限公司 | Zone searching method and system |
| CN103863365A (en) * | 2014-03-21 | 2014-06-18 | 上海富欣智能交通控制有限公司 | Method for generating track traffic route topological graph by directed graph method |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108027985A (en) * | 2015-08-20 | 2018-05-11 | 株式会社赛班奥科 | Path generation program, path generating method and coordinates measurement device |
| CN108027985B (en) * | 2015-08-20 | 2021-08-24 | 株式会社赛班奥科 | Storage medium, path generation method, and path generation device |
| CN107640181A (en) * | 2017-08-30 | 2018-01-30 | 交控科技股份有限公司 | Any destination TD method and device based on truck traffic |
| CN111731351A (en) * | 2020-06-18 | 2020-10-02 | 中国铁道科学研究院集团有限公司通信信号研究所 | Method for double-period interactive real-time searching route and matching and modifying route trend |
| CN111731351B (en) * | 2020-06-18 | 2022-06-24 | 中国铁道科学研究院集团有限公司通信信号研究所 | Method for double-period interactive real-time searching route and matching and modifying route trend |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102874279B (en) | A kind of train route handles method | |
| CN107798079A (en) | Section joining method and system based on track of vehicle data | |
| CN104751683A (en) | Airport plane taxi scheduling and commanding system and method | |
| CN101509783A (en) | Data checking method and device applying to navigation electronic map production | |
| CN104575108A (en) | Air traffic control automatic transfer system and method based on petri network | |
| CN106828544A (en) | A kind of movement across lines route triggering method and device | |
| CN114179873B (en) | Multi-road multi-time-interval all-day train operation diagram automatic compilation method and system | |
| CN109446381A (en) | A kind of public transport road network integrated approach based on temporal diagram | |
| CN101425154A (en) | Rolling stock scheduling apparatus and method | |
| CN102343923A (en) | Automatic train supervision system and train tracking method | |
| CN102567389B (en) | Combined traffic network forming method and equipment as well as path searching method and equipment | |
| CN104346453A (en) | ATS (Application Tracking System) path searching method and system | |
| CN103701122A (en) | Power grid topology analysis system based on incidence matrix and circuit matrix and method thereof | |
| WO2021073223A1 (en) | Interlocking device control method and system | |
| CN103020154B (en) | Complete backspacing searching method for tracing reasons of power failure after appearance of power distribution network fault | |
| CN107403550A (en) | Transit network collecting method, device and terminal device | |
| CN113562025B (en) | Computer interlocking table generation method and device, electronic equipment and storage medium | |
| CN114715228B (en) | Railway passenger station shunting plan comprehensive management method and system | |
| CN104933479A (en) | Accessibility based urban public transit hub stationing planning method | |
| CN105388897A (en) | Method and system for realizing AGV automatic exploration path algorithm and AGV | |
| CN113562037A (en) | Distributed autonomous dispatching centralized system supporting multiple turn-back functions | |
| WO2022100501A1 (en) | Operation diagram-based method for automatically changing traffic route and returning when operation is interrupted | |
| CN107525513A (en) | The optimal transit point system of selection of finite constraint condition based on existing navigation system | |
| CN104442929A (en) | Complex network structure based railway station technical operation planning method | |
| CN103738364B (en) | A kind of section searching method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 100070 Beijing science and Technology Park of Fengtai District Haiying Road No. 6 hospital of Beijing, the headquarters of the International 2 Building No. 3 Applicant after: TRAFFIC CONTROL TECHNOLOGY Co.,Ltd. Address before: 100070 Beijing science and Technology Park of Fengtai District Haiying Road No. 6 hospital of Beijing, the headquarters of the International 2 Building No. 3 Applicant before: Beijing Traffic Control Technology Co., Ltd. |
|
| COR | Change of bibliographic data | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 100070 Beijing science and Technology Park of Fengtai District Seahawks Hospital No. 6 2, No. 3 (Park) Applicant after: TRAFFIC CONTROL TECHNOLOGY Co.,Ltd. Address before: 100070 Beijing science and Technology Park of Fengtai District Haiying Road No. 6 hospital of Beijing, the headquarters of the International 2 Building No. 3 Applicant before: TRAFFIC CONTROL TECHNOLOGY Co.,Ltd. |
|
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20150211 |