CN106951635A - A kind of flexible cable path Intelligent planning method for considering gravity constraint rule - Google Patents

A kind of flexible cable path Intelligent planning method for considering gravity constraint rule Download PDF

Info

Publication number
CN106951635A
CN106951635A CN201710165179.XA CN201710165179A CN106951635A CN 106951635 A CN106951635 A CN 106951635A CN 201710165179 A CN201710165179 A CN 201710165179A CN 106951635 A CN106951635 A CN 106951635A
Authority
CN
China
Prior art keywords
wiring
wiring space
flexible cable
space region
model
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
CN201710165179.XA
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.)
Nanjing University of Aeronautics and Astronautics
Original Assignee
Nanjing University of Aeronautics and Astronautics
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 Nanjing University of Aeronautics and Astronautics filed Critical Nanjing University of Aeronautics and Astronautics
Priority to CN201710165179.XA priority Critical patent/CN106951635A/en
Publication of CN106951635A publication Critical patent/CN106951635A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/20Design optimisation, verification or simulation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/10Geometric CAD
    • G06F30/18Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00Details relating to CAD techniques
    • G06F2111/04Constraint-based CAD
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2113/00Details relating to the application field
    • G06F2113/16Cables, cable trees or wire harnesses

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Geometry (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • Evolutionary Computation (AREA)
  • Computational Mathematics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Optimization (AREA)
  • Mathematical Analysis (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

A kind of flexible cable path Intelligent planning method for considering gravity constraint rule, it comprises the following steps:Wiring space three-dimensional environment is modeled first, subregion division is carried out to the whole machine space of product using partition type space-division method, obtains needing what is connected up to treat wiring space region and non-wiring space region;Secondly treat that wiring space region carries out rasterizing processing to what is marked off, set up barrier and surround BOX Model, set up the abstract model of wiring space grid model and routing path point;Intelligent search and the optimizing in flexible cable path are finally carried out using ant colony optimization algorithm and consideration gravity constraint rule.The present invention can realize automatic obstacle-avoiding, and generation meets the routing path of certain engineering rule, improve the final overall performance of wiring efficiency and product and reliability of flexible cable.

Description

A kind of flexible cable path Intelligent planning method for considering gravity constraint rule
Technical field
The present invention relates to a kind of computer wiring technique, especially a kind of cable trails planning technology, specifically one Plant the flexible cable path Intelligent planning method for considering gravity constraint rule.
Background technology
With developing rapidly with the large electric system such as Aeronautics and Astronautics, ship, electronics, war industry, modern electrical system day Benefit complicate, it is integrated.Substantial amounts of electrical equipment is intensive in system platform, and the cable connected for each equipment and part is passed The signal sent is more and more, and frequency more and more higher, the power of consumption is also increasing, and higher want is proposed to laying for cable Summation challenge.Cable is in itself due to belonging to flexible body, and the pact by product structure space is moved towards in size, form and the space of cable Beam, lays complex process changeable.Irrational cable lays the probability increase that cable part can be caused to break down, and then causes Electric property is unstable, Electro Magnetic Compatibility is poor, the performance of final influence product overall performance.
A key for carrying out area of computer aided cable assembling is the planning that cable to be solved lays path.Cable lays road Footpath planning should consider space constraint, and the constraints such as mechanical performance and electric property is considered again, is the special band of a class The location problem that can be constrained, wherein undetermined parameter are more, feas ible space is complicated.The path of laying of cable not only influences arrangement space Structure design, cable total length and gross weight, and it is also relate to performance, reliability, installation and maintenance and the electricity of whole system Electro Magnetic Compatibility of sub- equipment room etc., is one of key issue urgently to be resolved hurrily in engineering design.
The content of the invention
It is an object of the invention to in product whole machine model wiring process, unreasonable, cloth is laid in flexible cable path The low problem of line efficiency, invents a kind of flexible cable path Intelligent planning method for considering gravity constraint rule.
A kind of flexible cable path Intelligent planning method for considering gravity constraint rule, it is characterised in that:First to wiring Space three-dimensional environment is modeled, and is carried out subregion division to the whole machine space of product using partition type space-division method, is needed What is connected up treats wiring space region and non-wiring space region;Secondly treat that wiring space region carries out rasterizing to what is marked off Processing, sets up barrier and surrounds BOX Model, set up the abstract model of wiring space grid model and routing path point;Finally utilize Ant colony optimization algorithm and intelligent search and the optimizing for considering gravity constraint rule progress flexible cable path.
It includes step in detail below:
Step 1:Create product complete machine structure model;
Step 2:Subregion division is carried out to the whole machine space of product using partition type space-division method;
Step 3:Wiring space region and non-wiring space region are treated in acquisition;
Step 4:Treat that wiring space region carries out rasterizing processing to what is marked off;
Step 5:Set up barrier and surround BOX Model;
Step 6:Set up the abstract model of wiring space grid model and routing path point;
Step 7:Using ant colony optimization algorithm and consider gravity constraint rule carry out flexible cable path intelligent search and Optimizing.
Finally, test of heuristics and emulation experiment are carried out, is further optimized according to the simulation experiment result, is wanted until meeting and using Ask.
As a kind of path planning optimization method of above-mentioned flexible cable, in step 2, the whole machine space of product is marked off Treat that wiring space areal requires to determine according to the complexity and wiring environment of product structure.
As a kind of path planning optimization method of above-mentioned flexible cable, in step 4, the grid in wiring space region is treated Change processing and consider accuracy that spatial abstraction represents and the calculating amount of storage of structural model simultaneously.
As a kind of path planning optimization method of above-mentioned flexible cable, in step 5 and step 6, it is contemplated that product knot Influence of other parts to flexible cable path planning inside structure.
It is used as a kind of path planning optimization method of above-mentioned flexible cable, in step 7, intelligence of the flexible cable in path The gravity factor of cable itself is considered in search and searching process, the path come is searched out and more meets practical wiring requirement.
As a kind of path planning optimization method of above-mentioned flexible cable, marked off treat wiring space region respectively by It is defined as A1、A2And A3, non-wiring space region is defined as A4
It is used as a kind of path planning optimization method of above-mentioned flexible cable, the region A1There is electric wire connecting junction S1, region A2Connect Line device S2, region A3There is hub C.
As a kind of path planning optimization method of above-mentioned flexible cable, the hub C has wiring arrival end T1And cloth Line port of export T2
Beneficial effects of the present invention are:
The present invention proposes a kind of flexible cable path Intelligent planning method for considering gravity constraint rule, and it is by considering Cable trails point during the gravity constraint rule of cable, flexible cable path planning can depend on relevant device entity table Face, meets the adherent rule of flexible cable and equipment room, more meets the installation scenarios of compliance cable.This flexible cable path Planing method can realize automatic obstacle-avoiding, and generation meets the routing path of certain engineering rule, improves the wiring of flexible cable Efficiency and the final overall performance of product and reliability.
The present invention, which is solved, carries out that the calculating amount of storage brought of rasterizing processing is big, computational efficiency to the whole machine space of product Low the problem of, also solve path point when basic ant colony optimization algorithm carries out route searching under three-dimensional environment and easily dissipate The problem of phenomenon.By considering the gravity constraint rule of cable, cable trails point during flexible cable path planning can be according to Relevant device solid object surface is invested, the adherent rule of flexible cable and equipment room is met, more meets the wiring of compliance cable Situation.This flexible cable paths planning method can realize automatic obstacle-avoiding, and generation meets the routing path of certain engineering rule, carried The wiring efficiency and the final overall performance of product and reliability of high flexible cable.
Brief description of the drawings
Fig. 1 is the regular flexible cable path intelligent planning flow chart of the consideration gravity constraint of the present invention.
Fig. 2 divides schematic diagram for the partition type of the wiring space of the present invention.
Fig. 3 handles model schematic for the wiring space rasterizing of the present invention.
Fig. 4 is wiring barrier bounding box model schematic of the invention.
Fig. 5 considers the regular schematic diagram of gravity constraint for the present invention in three dimensional wiring environment.
Embodiment
The present invention is further illustrated with reference to the accompanying drawings and detailed description.
As Figure 1-5.
A kind of flexible cable path Intelligent planning method for considering gravity constraint rule, it is applied to Complex Mechatronic Products Cable is laid.Specifically designed for cable wiring, the cable laying method that cable assembly technology is formulated, this method can improve flexibility The final overall performance of the wiring efficiency and product of cable and reliability.
As shown in figure 1, a kind of flexible cable path Intelligent planning method for considering gravity constraint rule, first to utilizing The product complete machine structure model that the Three-dimensional Design Softwares such as CREO, CATIA, UG are created carries out wiring space three-dimensional environment modeling, adopts Subregion division is carried out to the whole machine space of product with partition type space-division method, obtain need connect up treat wiring space region and Non- wiring space region;Secondly treat that wiring space region carries out rasterizing processing to what is marked off, set up barrier bounding box mould Type, sets up the abstract model of wiring space grid model and routing path point;Finally utilize ant colony optimization algorithm and consideration gravity Constraint rule carries out intelligent search and the optimizing in flexible cable path.
Specific step is as follows:
Step 1:Using Three-dimensional Design Softwares such as CREO, CATIA, UG, according to the product type drawing of engineering in practice and Data message, creates product complete machine structure model;
Step 2:Subregion division is carried out to the whole machine space of product using partition type space-division method;
Step 3:Wiring space region and non-wiring space region are treated in acquisition;
Step 4:Treat that wiring space region carries out rasterizing processing to what is marked off;
Step 5:Set up barrier and surround BOX Model;
Step 6:Set up the abstract model of wiring space grid model and routing path point;
Step 7:Using ant colony optimization algorithm and consider gravity constraint rule carry out flexible cable path intelligent search and Optimizing.
In step 2, what the whole machine space of product was marked off treats complexity of the wiring space areal according to product structure Require to determine with wiring environment, wires design engineer can often complete according to abundant design experiences.
In step 3, Fig. 2 divides schematic diagram for the wiring space partition type that present embodiment is provided.In this figure by cloth Space of lines is divided into the union in 4 sub-spaces regions:A=A1∪A2∪A3∪A4, wherein A represents the whole model space.Work as Ai(i =1,2,3,4) when for the fixed route section of cable wiring (fixed card slot of such as cable), cable will have by this section of region It is directly connective, it can skip the region when carrying out route searching.A3, should when cable passes through the structure as hub Route segment is considered as arrival end T1With port of export T2Direct connection, solve S1S2Between routing path when, without herein Route segment is made excessive algorithm and expended.So S1S2Between route searching can be reduced to S1T1With S2T2Two sections of routing path Search, A1∪A2It is the solution room of inventive algorithm.
In step 4, to mark off whne wiring space region carry out rasterizing processing when, using the summit in the lower left corner as The origin of coordinates A of three dimensions, three-dimensional system of coordinate A-xyz is set up in point A.In the coordinate system using A as summit, along x-axis side To the maximum length AB for taking product 3 d structure model, the maximum length AA' of product 3 d structure model is taken along the y-axis direction, along z Direction of principal axis takes the maximum length AD of product 3 d structure model, thus constitutes the cubical area for including product 3 d structure model ABCD-A'B'C'D', the region is the planning space in three dimensional wiring path, as shown in Figure 3.To obtain abstract environmental model, It point operation such as need to carry out on the basis of above-mentioned planning space ABCD-A'B'C'D':N deciles are carried out along side AB, n+1 is obtained and puts down Face Πi(i=0,1,2 ..., n), then carry out m deciles along side AD to this n+1 plane, carry out l deciles along side AA', and ask Solve the intersection point of the inside.
In step 4, treat that the rasterizing in wiring space region is handled while considering the accuracy that spatial abstraction is represented With the calculating amount of storage of structural model.Treat wiring space region and carry out the storage sky that rasterizing processing will greatly save algorithm Between.
In steps of 5, barrier is classified as on the parts that flexible cable path planning can produce influence inside product structure, " expanded " processing is completed by setting up bounding box to barrier, safe space is reserved:Ω Ω | and r≤Ω≤2r }, wherein r is The diameter of cable, so as to set up the safety zone (Fig. 4) that cable is laid.Blocking surfaces may be regarded as safety zone, when cable is tight When pasting blocking surfaces, cable does not produce interference with barrier.
In step 6, Fig. 5 considers gravity constraint rule signal for what present embodiment was provided in three dimensional wiring environment Figure.Comparative analysis considers cable deadweight and does not consider the cable trails planning situation of cable deadweight in this figure.Cable conduct Entity with certain mass, in actually laying, the laying to generally require of cable depends on relevant device solid object surface, that is, has Plant " gravity trend " and press close to body surface.As shown in figure 5,1. occurring hanging route segment in path, path planning is unreasonable;② Path considers cable deadweight, lays path and depends on equipment entity surface, meet actual specification, is high-quality solution.
In step 7, flexible cable considered in the intelligent search and searching process in path the gravity of cable itself because Element, the path searched out more meets practical wiring specification.
Carry out again if necessary test of heuristics and emulation experiment further optimize with meet be actually needed.
Part that the present invention does not relate to is same as the prior art or can be realized using prior art.

Claims (9)

1. a kind of flexible cable path Intelligent planning method for considering gravity constraint rule, it is characterised in that:It is empty to wiring first Between three-dimensional environment be modeled, using partition type space-division method to the whole machine space of product carry out subregion division, needed What is connected up treats wiring space region and non-wiring space region;Secondly treat that wiring space region is carried out at rasterizing to what is marked off Reason, sets up barrier and surrounds BOX Model, set up the abstract model of wiring space grid model and routing path point;Finally utilize ant Colony optimization algorithm and intelligent search and the optimizing for considering gravity constraint rule progress flexible cable path.
2. according to the method described in claim 1, it is characterised in that it comprises the following steps:
Step 1:Create product complete machine structure model;
Step 2:Subregion division is carried out to the whole machine space of product using partition type space-division method;
Step 3:Wiring space region and non-wiring space region are treated in acquisition;
Step 4:Treat that wiring space region carries out rasterizing processing to what is marked off;
Step 5:Set up the abstract model of wiring space grid model and routing path point;
Step 6:Set up barrier and surround BOX Model;
Step 7:Intelligent search and the optimizing in flexible cable path are carried out using ant colony optimization algorithm and consideration gravity constraint rule.
3. method according to claim 2, it is characterised in that in step 2, what the whole machine space of product was marked off waits to connect up Area of space number requires to determine according to the complexity and wiring environment of product structure.
4. method according to claim 2, it is characterised in that in step 4, treats the rasterizing processing in wiring space region Accuracy that spatial abstraction represents and the calculating amount of storage of structural model are considered simultaneously.
5. method according to claim 2, it is characterised in that in step 5 and step 6, it is considered to inside product structure its His influence of the parts to flexible cable path planning.
6. method according to claim 2, it is characterised in that in step 7, flexible cable path intelligent search and The gravity factor of cable itself is considered in searching process, the path come is searched out and more meets practical wiring requirement.
7. method according to claim 2, it is characterised in that what is marked off treats that wiring space region is respectively defined as A1、 A2And A3, non-wiring space region is defined as A4
8. method according to claim 7, it is characterised in that treat wiring space region A1There is electric wire connecting junction S1, treat wiring space Region A2There is electric wire connecting junction S2, treat wiring space region A3There is hub C.
9. method according to claim 8, it is characterised in that hub C has wiring arrival end T1With wiring port of export T2
CN201710165179.XA 2017-03-20 2017-03-20 A kind of flexible cable path Intelligent planning method for considering gravity constraint rule Pending CN106951635A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710165179.XA CN106951635A (en) 2017-03-20 2017-03-20 A kind of flexible cable path Intelligent planning method for considering gravity constraint rule

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710165179.XA CN106951635A (en) 2017-03-20 2017-03-20 A kind of flexible cable path Intelligent planning method for considering gravity constraint rule

Publications (1)

Publication Number Publication Date
CN106951635A true CN106951635A (en) 2017-07-14

Family

ID=59472762

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710165179.XA Pending CN106951635A (en) 2017-03-20 2017-03-20 A kind of flexible cable path Intelligent planning method for considering gravity constraint rule

Country Status (1)

Country Link
CN (1) CN106951635A (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109583667A (en) * 2019-01-08 2019-04-05 北京航空航天大学 A kind of cable trails solving optimization method
CN109740256A (en) * 2019-01-02 2019-05-10 北京航空航天大学 A kind of wire cable layout design optimization method merging equipment Maintainability
CN110502803A (en) * 2019-07-29 2019-11-26 兰州容大信息科技有限公司 Wiring method and device based on BIM technology
CN110555224A (en) * 2019-01-02 2019-12-10 北京航空航天大学 Wiring area environment constraint quantification method based on grid division
CN112102476A (en) * 2020-09-11 2020-12-18 中国核电工程有限公司 Automatic arrangement method and system for nuclear power plant pipeline
CN112100786A (en) * 2020-10-30 2020-12-18 天津飞眼无人机科技有限公司 Partitioned underground pipe network three-dimensional planning system and method

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103678828A (en) * 2013-12-31 2014-03-26 北京理工大学 Automatic layout method and device of flexible cables
CN104317293A (en) * 2014-09-19 2015-01-28 南京邮电大学 City rescue intelligent agent dynamic path planning method based on improved ant colony algorithm

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103678828A (en) * 2013-12-31 2014-03-26 北京理工大学 Automatic layout method and device of flexible cables
CN104317293A (en) * 2014-09-19 2015-01-28 南京邮电大学 City rescue intelligent agent dynamic path planning method based on improved ant colony algorithm

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
JUN LIU 等: "The Research on Path Planning of Wall Climbing Robot based on Ant Colony Algorithm and Minimum Gravity Consumption Algorithm", 《APPLIED MECHANICS AND MATERIALS》 *
刘利强 等: "基于蚁群算法的水下潜器三维空间路径规划", 《***仿真学报》 *
吴宏超 等: "基于改进A*算法的管路自动布局设计与优化方法", 《计算机集成制造***》 *
王发麟 等: "线缆虚拟装配关键技术研究现状及其发展", 《中国机械工程》 *
高扬 等: "复杂机电产品刚柔混合装配仿真技术研究", 《制造业自动化》 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109740256A (en) * 2019-01-02 2019-05-10 北京航空航天大学 A kind of wire cable layout design optimization method merging equipment Maintainability
CN110555224A (en) * 2019-01-02 2019-12-10 北京航空航天大学 Wiring area environment constraint quantification method based on grid division
CN110555224B (en) * 2019-01-02 2021-05-04 北京航空航天大学 Wiring area environment constraint quantification method based on grid division
CN109583667A (en) * 2019-01-08 2019-04-05 北京航空航天大学 A kind of cable trails solving optimization method
CN109583667B (en) * 2019-01-08 2023-04-18 北京航空航天大学 Cable path solving and optimizing method
CN110502803A (en) * 2019-07-29 2019-11-26 兰州容大信息科技有限公司 Wiring method and device based on BIM technology
CN110502803B (en) * 2019-07-29 2023-04-07 兰州容大信息科技有限公司 Wiring method and device based on BIM technology
CN112102476A (en) * 2020-09-11 2020-12-18 中国核电工程有限公司 Automatic arrangement method and system for nuclear power plant pipeline
CN112100786A (en) * 2020-10-30 2020-12-18 天津飞眼无人机科技有限公司 Partitioned underground pipe network three-dimensional planning system and method

Similar Documents

Publication Publication Date Title
CN106951635A (en) A kind of flexible cable path Intelligent planning method for considering gravity constraint rule
CN107664954B (en) Automatic generation method of electromagnetic transient visual simulation model of power system
US9459600B2 (en) Method and automation system for processing information extractable from an engineering drawing file using information modeling and correlations to generate output data
CN103093007B (en) Power transmission iron tower three-dimensional virtual assembly method
CN110401145A (en) A kind of cable laying method and laying system
CN108984910B (en) A kind of parametric modeling method of Three-Dimensional Braided Composites
CN110502803B (en) Wiring method and device based on BIM technology
CN104866613A (en) Method for establishing three-dimensional component model database of power grid equipment and facility
CN104077727B (en) Substation Electric Equipment account intelligence input method and system
CN103678828A (en) Automatic layout method and device of flexible cables
CN103488838A (en) Computer-assisted plotting method for waste heat boiler pipes
CN112487626B (en) Photovoltaic power station wiring method and device
CN103678776A (en) Railway vehicle electrical wiring engineered design method
CN104361185A (en) Wire distribution space automatic generating method for cable virtual design
CN104268321B (en) Satellite cable lightweight modeling method
CN102968519A (en) Model of electronic current transformer with hollow coil in electrical system and modeling method thereof
CN104239589A (en) Method for implementing intelligent analysis system of distribution network business expansions
Tamayo et al. Design automation of control panels for automated modular construction machines
CN114004000A (en) System for intelligent pipeline arrangement based on BIM technology
CN103093493A (en) High-precision three-dimensional object modeling method with power grid equipment existing
CN103838935A (en) Drawing system and method for subway signal system designing
Peddada et al. A novel two-stage design framework for 2d spatial packing of interconnected components
CN105279574A (en) Satellite cable shortest path planning method based on digraph optimization technology
CN105335581A (en) Optimization method of airplane wiring harness mass distribution data
CN112968398A (en) Intelligent wiring method for BIM cable bridge based on inventory list

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: 20170714

RJ01 Rejection of invention patent application after publication