CN107808061A - A kind of two-way across obstacle wiring method for supporting just to give oblique cabling - Google Patents
A kind of two-way across obstacle wiring method for supporting just to give oblique cabling Download PDFInfo
- Publication number
- CN107808061A CN107808061A CN201711157762.2A CN201711157762A CN107808061A CN 107808061 A CN107808061 A CN 107808061A CN 201711157762 A CN201711157762 A CN 201711157762A CN 107808061 A CN107808061 A CN 107808061A
- Authority
- CN
- China
- Prior art keywords
- wiring
- node
- grid
- oblique
- obstacle
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/39—Circuit design at the physical level
- G06F30/392—Floor-planning or layout, e.g. partitioning or placement
Landscapes
- Engineering & Computer Science (AREA)
- Computer Hardware Design (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Architecture (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Design And Manufacture Of Integrated Circuits (AREA)
Abstract
A kind of two-way across obstacle wiring method for supporting just to give oblique cabling, comprises the following steps：（1）The wiring parameter set according to user, is divided using grid to whole wiring area, chooses summit of the rectangular mesh as figure, and defines the orthogonal neighborhood node and oblique neighbor node structure grid map of each grid；（2）Between needing to carry out two groups of ports of wiring operations, route searching is carried out based on bidirectional research strategy；（3）By turning round, skip floor avoiding barrier is just being given oblique wiring；（4）Preview is carried out to wiring result and confirmed；（5）Repeat the above steps, complete the wiring of all of the port.The method of the present invention, wiring can be by turn, skip floor avoiding barrier, and wiring can carry out 45 ° and 90 ° turns；It is used for introducing, drawing port using non-grid path during wiring structure grid map；Connect up and use bidirectional research strategy, pathfinding speed is fast.
Description
Technical field
The present invention relates to EDA FPD design fields, are connected up more particularly to a kind of special-shaped domain mid-span obstacle
Method.
Background technology
For needed between the special-shaped panel design component such as manufacturer, pixel region, MUX, GOA driver elements into
Row wiring；For some designs, it is also required to carry out line between pixel, between GOA.These wiring environments are typically complex,
It is required that wiring possesses the ability of leaping over obstacles, and also to meet the geometrical constraint of design.In FPD design tools, common cloth
Other objects are not present between line device default port, without the ability across obstacle, such as minimum spacing wiring unit, serpentine wire
Device, determine resistance coiling, ladder wiring etc., this just develops across obstacle wiring unit there is an urgent need to EDA manufacturers for FPD.
The content of the invention
In order to solve the shortcomings of the prior art, support just giving oblique cabling it is an object of the invention to provide one kind
Two-way across obstacle wiring method, whole wiring area is divided using grid, using A Star Routing Algorithm,
Special-shaped domain carries out across obstacle wiring between points, meets the geometrical constraint of design.
To achieve the above object, two-way across the obstacle wiring method provided by the invention for supporting just giving oblique cabling, bag
Include following steps：
（1）The wiring parameter set according to user, is divided using grid to whole wiring area, chooses rectangular mesh conduct
The summit of figure, and define the orthogonal neighborhood node and oblique neighbor node structure grid map of each grid；
（2）Between needing to carry out two groups of ports of wiring operations, route searching is carried out based on bidirectional research strategy；
（3）By turning round, skip floor avoiding barrier is just being given oblique wiring；
（4）Preview is carried out to wiring result and confirmed；
（5）Repeat the above steps, complete the wiring of all of the port.
Further, the step（1）, further comprise step：
44 orthogonal neighborhood nodes of positive definition, oblique increase oblique neighbor nodes in each grid communicate therewith；
Each grid is initialized, mark starting point, terminal, and barrier.
Further, including step：Increase horizontal route or vertical-path intersect with existing path, generate new net
Lattice, wiring is drawn or introduced from non-grid port.
Further, step（2）The bidirectional research strategy, it is while since beginning and end to respective target exhibition
Search is opened, when two, which are searched, finds same node, now routing path is determined.
Further, the step（2）, further comprise the steps：
Ascending order arrangement is carried out according to the cost value of each node, and is added in Priority Queues；
If Priority Queues is not sky, the minimum node of cost value is taken out from Priority Queues, if it is empty, then exits circulation；
Judging the node, whether it is terminal, is to record this node, end loop；Otherwise it is marked as being accessed, so
Its each neighbor node is begun stepping through afterwards；
Judge whether each neighbor node is accessed, be, ignore this neighbor node, otherwise start to calculate its cost value, so
After add it in Priority Queues, and mark its parent attribute；
Reversely traveled through according to record node parent attributes, when optimal wiring route.
Further, the cost value of the node, is obtained by below equation：F=G+H, wherein, F is the cost of node
Value, G are the existing cost value that the node is moved to from starting point, and H is estimate cost value of the node to terminal.
Two-way across the obstacle wiring method of oblique cabling is just being given in the support of the present invention, is had the following technical effect that：
1st, wiring can pass through turn, skip floor avoiding barrier；
2nd, wiring can carry out 45 ° and 90 ° turns；
3rd, non-grid path is used during wiring structure grid map（off grid track）For introducing, drawing port；
4th, connect up and use bidirectional research strategy, pathfinding speed is fast.
Other features and advantages of the present invention will be illustrated in the following description, also, partly becomes from specification
Obtain it is clear that or being understood by implementing the present invention.
Brief description of the drawings
Accompanying drawing is used for providing a further understanding of the present invention, and a part for constitution instruction, and with the present invention's
Embodiment together, for explaining the present invention, is not construed as limiting the invention.In the accompanying drawings：
Fig. 1 is two-way across the obstacle wiring method flow chart that oblique cabling is just being given according to the support of the present invention；
Fig. 2 is to set page schematic diagram according to the wiring technique layer geometrical constraint of the present invention；
Fig. 3 is to select page schematic diagram according to port of the invention, routing model；
Fig. 4 is to carry out division schematic diagram to wiring area using grid according to the present invention；
Fig. 5 is that new grid schematic diagram is regenerated to the port outside grid according to the present invention；
Fig. 6 is the bidirectional research path schematic diagram according to the present invention；
Fig. 7 is the determination node cost value schematic diagram according to the present invention；
Fig. 8 is to select schematic diagram according to the port of the present invention；
Fig. 9 is the wiring cartoon effect diagram according to the present invention；
Figure 10 is the wiring result schematic diagram according to the present invention.
Embodiment
The preferred embodiments of the present invention are illustrated below in conjunction with accompanying drawing, it will be appreciated that described herein preferred real
Apply example to be merely to illustrate and explain the present invention, be not intended to limit the present invention.
Fig. 1 is two-way across the obstacle wiring method flow chart that oblique cabling is just being given according to the support of the present invention, below will
With reference to figure 1, the support to the present invention is just giving two-way across the obstacle wiring method of oblique cabling to be described in detail.
First, in step 101, according to geometrical constraint, start across obstacle wiring order, and wiring parameter is set.In the step
In rapid, receive user and process layer geometrical constraint is configured, and the selection of port/routing model.
Fig. 2 is to set page schematic diagram according to the wiring technique layer geometrical constraint of the present invention, as shown in Fig. 2 passing through wiring
Process layer geometrical constraint sets the dialog box of the page, receives user and wiring technique layer geometrical constraint is set.
Fig. 3 is to select page schematic diagram according to port of the invention, routing model, as shown in figure 3, passing through port, wiring
The dialog box of the model selection page, receive selection of the user to port/routing model.
In step 102, the wiring parameter set according to user, build grid chart and each grid is initialized.
In this step, the wiring parameter set first according to user builds data structure G=(V, the E) of figure, and wherein V is
Point set, E are line set.Whole wiring area is divided using grid, the summit that selection figure rectangular mesh is used as, and it is fixed
The orthogonal neighborhood node and oblique neighbor node of adopted each grid.
Fig. 4 is to carry out division schematic diagram to wiring area using grid according to the present invention, as shown in figure 4, having used net
Lattice divide to whole wiring area.Summit of the rectangular mesh as figure is have chosen herein, if defining each grid（Section
Point）It can be connected with the orthogonal neighbor node of its all directions 4, then can realize 90 ° of wirings；If increase northeast, northwest, west
South, the oblique neighbor node in the southeast four, then it can realize 90 °, 45 ° of wirings；If built according to each wiring technique layer a set of
Grid map, then each grid top layer and bottom there is also a neighbor node, then can realize cross-layer multi-angle（90°、
45°）Wiring.In traditional IC routing fields, it is only necessary to realize 90 ° of wirings；But largely oblique set be present in FPD routing fields
Meter, therefore our each node of grid map possesses 10 neighbor nodes, with 8 neighbor node of layer, 2 neighbours' sections of cross-layer
Point.
After grid division, each grid is initialized, whether grid can be marked as starting point, terminal, be barrier
Hinder the attributes such as thing, the grid of dark figure covering is set as barrier.
Fig. 5 is that new grid schematic diagram is regenerated to the port outside grid according to the present invention, as shown in figure 5, in reality
During building grid chart in border wiring scene, phenomenon of the starting/terminating port not on grid often occurs, generally cries
Do non-grid port（off grid pin）.In order to which successfully wiring is drawn or introduced from port, we introduce non-grid
Path（off grid track）To solve this problem.Basic thought is exactly to increase a horizontal route in the position of port
（horizontal track）Or vertical-path（vertical track）, this horizontal route（horizontal track）Or
Person's vertical-path（vertical track）With other existing paths（track）It is intersecting, generate new grid and be used for connection end
Node and other existing nodes where mouthful.
In step 103, selection needs to carry out two ports of wiring operations, and the Routing Algorithm based on A Star carries out path
Search, obtains optimal wiring route.
Fig. 8 is to select schematic diagram according to the port of the present invention, as shown in figure 8, needing to connect in editing area selective interconnection
Multigroup port.
A Star algorithms are the efficient solution party that the applications such as pathfinding, graph traversal are widely used in computer science
Case, it is the improvement of dijkstra's algorithm, adds the processing for inspiring sex factor wherein.
A Star algorithms need to safeguard the Priority Queues of a save mesh node, are carried out according to the cost value of each grid
Ascending sort, it is added to first dot grid is played in this queue.
If 1) Priority Queues is not sky, the minimum node of cost value is taken out from Priority Queues, if optimization queue is sky,
Then exit circulation, algorithm failure；
2) judging the node, whether it is terminal, is to record this node, end loop；Otherwise it is marked as being accessed
（visited）, then begin stepping through its each neighbor node；
3) to each neighbor node judging, whether it is accessed（visited）, it is to ignore this neighbour, otherwise starts to calculate it
Cost value F=G+H, be then added into Priority Queues, and mark its parent nodal community.Traversal terminates
After jump back to step 1）Circulation.
After circulation terminates, reversely traveled through according to the parent attributes of record node, obtain optimal path.
In practical wiring scene, because geometry constraint conditions are excessively strict（Min Width and Min Spacing）, lead
Cause grid overstocked, so as to cause cloth linear velocity excessively slow.In order to solve this problem, we introduce bidirectional research strategy to solve
This problem.General wiring is to be searched for from the off to terminal, and two-way wiring is simultaneously to respective since beginning and end
Target expansion is searched, and when two, which are searched, finds same node, now routing path is determined.
Fig. 6 is according to the bidirectional research path schematic diagram of the present invention, as shown in fig. 6, unidirectional search radius（Broken circle）It is
Bidirectional research radius（Two filled circles）Twice, in the ideal case, efficiency of algorithm improves one times.
Most important theoretical F=G+H in following interpretation algorithms.G represents the existing generation that the node is moved to from starting point
Valency；H represents the node to the estimate cost of terminal；G and H are added up to the cost value F for just having obtained the node.Priority Queues is just
It is to carry out ascending sort according to F values, ejects the minimum node of cost value every time.
Fig. 7 is according to the determination node cost value schematic diagram of the present invention, as shown in fig. 7, setting orthogonal movement（The four corners of the world）
Cost value be 10, oblique movement is 14, then G values add displacement equal to the G values of parent nodes.For H values, we adopt
By the use of manhatton distance as its evaluation criterion, H=abs (dx+dy), dx, dy be respectively present node on x directions and y directions
With the difference of terminal.G, H value of upper and lower skip floor can be modified according to the actual conditions of wiring technique to it.
In the figure 7, we have marked the G values, H values and F values of each node in the neighbor node of start nodes, respectively
It is labeled in the lower left corner, the lower right corner and centre of each grid.The F values for being readily available northeastward node are minimum（94）, then when
After start neighbours are pressed into Priority Queues, the node of first dequeue is just the node of northeastward.
For barrier node, a kind of easy method of comparison is that it is filtered, when decision node is barrier then
Ignore this node.For the more complicated scene of wires design rule, the cost value of barrier node can be heightened to control cloth
Line avoiding barrier.
In step 104, according to obtained optimal wiring route, across obstacle wiring is carried out.
In step 105, display wiring result, and complete to connect up according to design requirement.Fig. 9 is the cable-routing clip according to the present invention
Logical effect diagram, as shown in figure 9, clicking on preview icon, you can show the result cartoon design sketch for meeting wiring parameter.Figure
10 be that as shown in Figure 10, wiring has effectively got around barrier according to the wiring result schematic diagram of the present invention, meets DRC rule
Square.If wiring result meets design requirement, you can the button for clicking on generation wiring completes wiring.
In step 106, repeat the above steps 101-105, completes the wiring between other group of port.
Two-way across the obstacle wiring method of oblique cabling is just being given in the support of the present invention, and in wiring process, wiring can be with
By turn, skip floor avoiding barrier, and wiring can carry out 45 ° and 90 ° turns；Using non-during wiring structure grid map
Trellis paths（off grid track）For introducing, drawing port；Connect up and use bidirectional research strategy, pathfinding speed is fast.
One of ordinary skill in the art will appreciate that：The preferred embodiments of the present invention are the foregoing is only, and are not had to
In the limitation present invention, although the present invention is described in detail with reference to the foregoing embodiments, for those skilled in the art
For, its technical scheme that can be still recorded to foregoing embodiments is modified, or which part technical characteristic is entered
Row equivalent substitution.Within the spirit and principles of the invention, any modification, equivalent substitution and improvements made etc., all should include
Within protection scope of the present invention.
Claims (6)
1. a kind of two-way across obstacle wiring method for supporting just to give oblique cabling, comprises the following steps：
（1）The wiring parameter set according to user, is divided using grid to whole wiring area, chooses rectangular mesh conduct
The summit of figure, and define the orthogonal neighborhood node and oblique neighbor node structure grid map of each grid；
（2）Between needing to carry out two groups of ports of wiring operations, route searching is carried out based on bidirectional research strategy；
（3）By turning round, skip floor avoiding barrier is just being given oblique wiring；
（4）Preview is carried out to wiring result and confirmed；
（5）Repeat the above steps, complete the wiring of all of the port.
2. two-way across the obstacle wiring method according to claim 1 for supporting just giving oblique cabling, it is characterised in that institute
State step（1）, further comprise step：
44 orthogonal neighborhood nodes of positive definition, oblique increase oblique neighbor nodes in each grid communicate therewith；
Each grid is initialized, mark starting point, terminal, and barrier.
3. two-way across the obstacle wiring method according to claim 2 for supporting just giving oblique cabling, it is characterised in that enter
One step includes step：Increase horizontal route or vertical-path intersect with existing path, generate new grid, will connect up from non-net
Lattice port is drawn or introduced.
4. two-way across the obstacle wiring method according to claim 1 for supporting just giving oblique cabling, it is characterised in that step
Suddenly（2）The bidirectional research strategy, it is while deploys to search to respective target since beginning and end, when two searches are looked for
During to same node, now routing path is determined.
5. two-way across the obstacle wiring method according to claim 1 for supporting just giving oblique cabling, it is characterised in that institute
State step（2）, further comprise the steps：
Ascending order arrangement is carried out according to the cost value of each node, and is added in Priority Queues；
If Priority Queues is not sky, the minimum node of cost value is taken out from Priority Queues, if it is empty, then exits circulation；
Judging the node, whether it is terminal, is to record this node, end loop；Otherwise it is marked as being accessed, so
Its each neighbor node is begun stepping through afterwards；
Judge whether each neighbor node is accessed, be, ignore this neighbor node, otherwise start to calculate its cost value, so
After add it in Priority Queues, and mark its parent attribute；
Reversely traveled through according to record node parent attributes, when optimal wiring route.
6. two-way across the obstacle wiring method according to claim 5 for supporting just giving oblique cabling, it is characterised in that institute
The cost value of node is stated, is obtained by below equation：F=G+H, wherein, F is the cost value of node, and G is to be moved to this from starting point
The existing cost value of node, H are estimate cost value of the node to terminal.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711157762.2A CN107808061B (en) | 2017-11-20 | 2017-11-20 | Bidirectional obstacle-crossing wiring method supporting orthogonal and oblique wiring |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711157762.2A CN107808061B (en) | 2017-11-20 | 2017-11-20 | Bidirectional obstacle-crossing wiring method supporting orthogonal and oblique wiring |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107808061A true CN107808061A (en) | 2018-03-16 |
| CN107808061B CN107808061B (en) | 2021-01-19 |
Family
ID=61589636
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711157762.2A Active CN107808061B (en) | 2017-11-20 | 2017-11-20 | Bidirectional obstacle-crossing wiring method supporting orthogonal and oblique wiring |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107808061B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108595378A (en) * | 2018-05-10 | 2018-09-28 | 北京华大九天软件有限公司 | It is a kind of abnormity domain in nonopiate port definition selection method |
| CN110968983A (en) * | 2019-12-30 | 2020-04-07 | 北京华大九天软件有限公司 | Interactive wiring method |
| CN111027273A (en) * | 2019-12-04 | 2020-04-17 | 杭州广立微电子有限公司 | Layout automatic winding method, storage device and system based on pre-winding |
| CN111125993A (en) * | 2019-12-30 | 2020-05-08 | 北京华大九天软件有限公司 | Wiring method meeting minimum Cut number constraint |
| CN111125981A (en) * | 2019-12-26 | 2020-05-08 | 北京华大九天软件有限公司 | Wiring method for integrated circuit VLSI |
| CN111651958A (en) * | 2020-05-22 | 2020-09-11 | 深圳华大九天科技有限公司 | Interactive wiring method following wiring lattice points in integrated circuit layout |
| CN112685991A (en) * | 2020-12-22 | 2021-04-20 | 北京华大九天科技股份有限公司 | Wiring method meeting constraint |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101944149A (en) * | 2010-09-15 | 2011-01-12 | 清华大学 | Point-to-point wiring method for integrated circuit based on mesh-free model |
| CN101957876A (en) * | 2010-09-15 | 2011-01-26 | 清华大学 | Multilayer wiring method based on uneven grids in consideration of through holes |
| CN102346795A (en) * | 2011-09-16 | 2012-02-08 | 华中科技大学 | Automatic quick wiring method for electric and electronic virtual experiments |
| CN103679301A (en) * | 2013-12-31 | 2014-03-26 | 西安理工大学 | Complex terrain-based optimal path searching method |
| CN105716613A (en) * | 2016-04-07 | 2016-06-29 | 北京进化者机器人科技有限公司 | Method for planning shortest path in robot obstacle avoidance |
| CN106250579A (en) * | 2016-07-08 | 2016-12-21 | 广东科诺勘测工程有限公司 | The method and device that a kind of power circuit path intelligence generates |
| CN107239618A (en) * | 2017-06-06 | 2017-10-10 | 北京华大九天软件有限公司 | Across the obstacle wiring method of multiport in a kind of special-shaped domain |
-
2017
- 2017-11-20 CN CN201711157762.2A patent/CN107808061B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101944149A (en) * | 2010-09-15 | 2011-01-12 | 清华大学 | Point-to-point wiring method for integrated circuit based on mesh-free model |
| CN101957876A (en) * | 2010-09-15 | 2011-01-26 | 清华大学 | Multilayer wiring method based on uneven grids in consideration of through holes |
| CN102346795A (en) * | 2011-09-16 | 2012-02-08 | 华中科技大学 | Automatic quick wiring method for electric and electronic virtual experiments |
| CN103679301A (en) * | 2013-12-31 | 2014-03-26 | 西安理工大学 | Complex terrain-based optimal path searching method |
| CN105716613A (en) * | 2016-04-07 | 2016-06-29 | 北京进化者机器人科技有限公司 | Method for planning shortest path in robot obstacle avoidance |
| CN106250579A (en) * | 2016-07-08 | 2016-12-21 | 广东科诺勘测工程有限公司 | The method and device that a kind of power circuit path intelligence generates |
| CN107239618A (en) * | 2017-06-06 | 2017-10-10 | 北京华大九天软件有限公司 | Across the obstacle wiring method of multiport in a kind of special-shaped domain |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108595378B (en) * | 2018-05-10 | 2020-05-12 | 北京华大九天软件有限公司 | Definition selection method for non-orthogonal port in special-shaped layout |
| CN108595378A (en) * | 2018-05-10 | 2018-09-28 | 北京华大九天软件有限公司 | It is a kind of abnormity domain in nonopiate port definition selection method |
| CN111027273A (en) * | 2019-12-04 | 2020-04-17 | 杭州广立微电子有限公司 | Layout automatic winding method, storage device and system based on pre-winding |
| CN111027273B (en) * | 2019-12-04 | 2023-03-10 | 杭州广立微电子股份有限公司 | Layout automatic winding method, storage device and system based on prewinding |
| CN111125981B (en) * | 2019-12-26 | 2022-06-21 | 北京华大九天科技股份有限公司 | Wiring method for integrated circuit VLSI |
| CN111125981A (en) * | 2019-12-26 | 2020-05-08 | 北京华大九天软件有限公司 | Wiring method for integrated circuit VLSI |
| CN110968983A (en) * | 2019-12-30 | 2020-04-07 | 北京华大九天软件有限公司 | Interactive wiring method |
| CN111125993A (en) * | 2019-12-30 | 2020-05-08 | 北京华大九天软件有限公司 | Wiring method meeting minimum Cut number constraint |
| CN110968983B (en) * | 2019-12-30 | 2022-05-24 | 北京华大九天科技股份有限公司 | Interactive wiring method |
| CN111651958A (en) * | 2020-05-22 | 2020-09-11 | 深圳华大九天科技有限公司 | Interactive wiring method following wiring lattice points in integrated circuit layout |
| CN111651958B (en) * | 2020-05-22 | 2022-06-21 | 深圳华大九天科技有限公司 | Interactive wiring method following wiring lattice points in integrated circuit layout |
| CN112685991B (en) * | 2020-12-22 | 2022-11-01 | 北京华大九天科技股份有限公司 | Wiring method meeting constraint |
| CN112685991A (en) * | 2020-12-22 | 2021-04-20 | 北京华大九天科技股份有限公司 | Wiring method meeting constraint |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107808061B (en) | 2021-01-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107808061A (en) | A kind of two-way across obstacle wiring method for supporting just to give oblique cabling | |
| US10663300B2 (en) | UAV flight path generating method and device | |
| CN106371445B (en) | A kind of unmanned vehicle planning control method based on topological map | |
| CN102435200B (en) | Rapid path planning method | |
| CN104548598B (en) | A kind of method of pathfinding in virtual reality scenario | |
| CN109163722B (en) | Humanoid robot path planning method and device | |
| CN101840202B (en) | Functional block intelligent wiring method in modeling of control system | |
| CN103186710B (en) | Optimum route search method and system | |
| CN108444482A (en) | A kind of autonomous pathfinding barrier-avoiding method of unmanned plane and system | |
| CN102346795B (en) | Automatic quick wiring method for electric and electronic virtual experiments | |
| US20110310088A1 (en) | Personalized navigation through virtual 3d environments | |
| CN106525047A (en) | Unmanned aerial vehicle path planning method based on floyd algorithm | |
| CN105138859B (en) | Three-dimensional panorama roams method for searching and system | |
| CN102506849B (en) | Method for finding the shortest path with constraints | |
| CN110006429A (en) | A kind of unmanned boat path planning method based on depth optimization | |
| CN110220528A (en) | A kind of two-way dynamic path planning method of automatic Pilot unmanned vehicle based on A star algorithm | |
| CN107436148A (en) | A kind of robot navigation method and device based on more maps | |
| CN113009916B (en) | Path planning method, chip and robot based on global map exploration | |
| CN105354881B (en) | Distortion of the mesh optimized algorithm based on Category Attributes data | |
| CN110514204A (en) | Path planning method, device, aircraft and computer readable storage medium | |
| CN105928535A (en) | Vehicle routing planning method capable of avoiding road restrictions | |
| CN115638803A (en) | Personalized path planning method sensitive to urban interest points | |
| CN106030488A (en) | Portals for visual interfaces | |
| CN109341698A (en) | A kind of routing resource and device of mobile robot | |
| CN116700265A (en) | A multi-robot path planning method and system based on improved CBS algorithm |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210329 Address after: 518100 1001, building 5, Shenjiu science and Technology Pioneer Park, northwest, intersection of Taohua road and Binglang Road, Fubao community, Fubao street, Futian District, Shenzhen City, Guangdong Province Patentee after: Shenzhen Huada Jiutian Technology Co.,Ltd. Address before: 100102 floor 2, block a, No.2, lizezhong 2nd Road, Chaoyang District, Beijing Patentee before: HUADA EMPYREAN SOFTWARE Co.,Ltd. |
|
| TR01 | Transfer of patent right |