Product
Eureka
For R&D, Eureka makes reading and utilizing patents & technical documents easy.
Eureka AIR
Designed for self-driven R&D workflows. Generate viable solutions, solve complex R&D challenges, empower your innovation with AI.
Eureka Materials
Designed for material experts only. Revolutionize your material R&D, from search, analyze, to developing new materials.
Feature
TechResearch
Generate reliable direction feasibility study reports for your R&D in just a few steps.
TechSeek
Discover and master advanced knowledge NOW. Basics, ideas, possibilities, all at once.
TechMind
As an expert in R&D Theories, TechMind can generates customized viable solutions instantly.
TechRisk
Analyze your overall solution with one click, know your potential R&D risks in advance.
TechMonitor
Get weekly tech updates, stay abreast of the latest tech innovations and key insights.
Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
68 results about "Path (graph theory)" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction.
Entity attribute information extraction method and device based on syntactic dependency
ActiveCN107957991AEliminate semantic ambiguityImprove accuracyNatural language data processingSpecial data processing applicationsPart of speechAmbiguity
The invention discloses an entity attribute information extraction method and device based on syntactic dependency. The method comprises the steps that firstly, a to-be-extracted text is preprocessedto obtain a to-be-extracted text entity; then, according to the syntactic dependency and the part-of-speech relation of the to-be-extracted text, an undirected weighted graph between words is established, and candidate attribute information of the to-be-extracted text entity is obtained according to the part-of-speech relation; the shortest path between the to-be-extracted text entity and the words of the candidate attribute information is searched for, and the words passing through the shortest path form an association information word set; finally, the semantic similarity between each attribute in the attribute set and the association information word set is calculated, an entity attribute is obtained, and the entity, the entity attribute and the attribute information are integrated to serve as a final extraction result. The natural language processing technology and the graph theory model are combined, the ambiguity of text information is solved, and the text extraction accuracy isimproved; the semantic similarity of the keywords is utilized, the attributes of the abstract information are automatically summarized, and the extraction efficiency is improved.
Owner:湖南星汉数智科技有限公司
Terminal sector dividing method based on graph theory and spectral clustering algorithm
InactiveCN103473955ALittle coordinationMeet minimum distance constraintsSpecial data processing applicationsAircraft traffic controlGraph theoreticDegree (graph theory)
The invention discloses a terminal sector dividing method based on the graph theory and the spectral clustering algorithm. The method is carried out with the help of a computer system which comprises a sector dividing subsystem. The terminal sector dividing method comprises the first step of putting forward a calculating model of a peak connection degree according to the basic airline network structure and air traffic flow in controlled airspace, the second step of effectively dividing peaks of an airspace image based on the spectral clustering algorithm to solve the problem of a division error in short-distance parallel air routes and to achieve construction and division of a sector convex hull, the third step of putting forward a boundary optimized path selection algorithm based on sectors of an MAKLINK image, and the last step of carrying out optimizing to eliminate a sawtooth shape of the boundaries of the sectors to some degree to enable the sector boundaries to be more conform to actual operations so that the final dividing of the sectors can be finished. By means of air traffic flow, reverse deduction is carried out conveniently while the sectors are divided. By means of the terminal sector dividing method based on the graph theory and the spectral clustering algorithm, flows of the sectors are balanced, coordination is small, minimum distance constraint is met, the difficulty of commanding of a controller is reduced, and the security of operation in the terminal area is guaranteed.
Owner:CIVIL AVIATION UNIV OF CHINA
An automatic scheduling method in warehouse management
InactiveCN109214755ARealize intelligent schedulingOrder managementForecastingResourcesTime efficientDirected graph
The invention relates to an automatic order arranging and scheduling method in warehouse management. Firstly, goods are stored according to preset rules and order information is managed. Secondly, theroute planning management is carried out according to the storage situation of goods and the order information. In the path planning management, by introducing the TSP problem in graph theory, multi-AGV path planning is carried out for orders with large demand, and a collision-free and coordinated path is planned for each AGV by using the time window and one-way directed graph method, so as to eliminate collision and deadlock in multi-AGV path planning. For the orders with small demand, the single AGV path planning is carried out, and the TSP problem in graph theory is used to solve the problem, so as to achieve the shortest total distance. The invention can save time and improve the picking efficiency.
Owner:XIAMEN UNIV TAN KAH KEE COLLEGE
Plane switching operation hook planning compilation method
InactiveCN103507836AFunction increasePractical operationRailway traffic control systemsVertex (graph theory)Directed graph
The invention discloses a plane switching operation hook planning compilation method for a middle railway station. A modularization structure is adopted. The modularization structure comprises a hook planning graph automatic compilation module, and is characterized in that the graph automatic compilation module is a graph theory model for designing an optimal train set arrangement sequence, wherein the graph theory model is about converting solving of the compiled optimal arrangement sequence into solving of a minimum Hamilton path of a digraph, namely, the minimum Hamilton path is a path passing each vertex of a graph or the diagraph only once.
Owner:张伯敏 +2
Routing method in FC-AE-1553 switch-type network
ActiveCN109246013ASolve real-timeAddress reliabilityData switching networksShort path algorithmDependability
The invention discloses a routing method in an FC-AE-1553 switch-type network, and the method comprises the steps: first grading links, classifying different types of messages and setting priorities,and setting a plurality of message transmission queues; and then building a graph model of a complex topology network based on the graph theory; generating a hard real-time link set according to the application demands; calculating a plurality of unrelated candidate routes for the transmission of a hard real-time message based on the graph theory and a shortest path algorithm, and setting a link reserved bandwidth; calculating the maximum feasible flow of all candidate paths based on the link reserved bandwidth and the maximum stream solving theory; Finally, describing the respective transmission strategies of hard real-time messages and non-hard real-time messages. The invention solves the problems that the switch-type network (complex topology network) based on the FC-AE-1553 protocol needs to ensure the real-time and reliability of data transmission, and needs reasonable flow control for different types of traffic.
Owner:GUILIN UNIV OF ELECTRONIC TECH
Chemical process fault diagnosis method for Bayesian network based on mechanism correlation analysis
InactiveCN110766173ASimple calculationImprove calculation accuracyMathematical modelsGraph theoreticPrincipal component analysis
The invention provides a chemical process fault diagnosis method for Bayesian networkbased on a mechanism correlation analysis and the method comprises the steps: analyzing the mechanism correlationsbetween unit variables of a chemical process, and obtaining a relation matrix; calculating the conditional probability of the Bayesian network by using confidence interval estimation of historical data, and establishing the Bayesian network in combination with the relationship matrix; adopting a principal component analysis method to monitor the process; when a fault is detected, conversing data state, and calculating Bayesian contribution of a variable; adding evidences of fault nodes into the Bayesian network, finding out propagation paths and root nodes of faults, obtaining real reasons ofthe faults according to the propagation paths and the root nodes of the faults, and finding out root reasons of the faults from the Bayesian network in combination with mechanism-related process knowledge. The graph theory modeling of the technological process model is realized, the priori knowledge of the mechanism model and the quantitative calculation of the historical data are combined, and the method has the characteristics of simplifying the calculation amount and improving the calculation precision.
Owner:QINGDAO UNIV OF SCI & TECH
Intelligent path planning method for fire-fighting robot
PendingCN112161627AImprove accuracyImprove optimization efficiencyNavigational calculation instrumentsArtificial lifeGraph theoreticIterative search
The invention relates to an intelligent path planning method for a fire-fighting robot. The method comprises the steps: performing preprocessing according to space environment information of a fire scene where the fire-fighting robot is located; constructing a concave-convex polygonal obstacle fire scene space environment model according to an extended MAKLINK graph theory; planning an initial path by adopting a Dijkstra algorithm according to the stationing point and the fire extinguishing point of the fire-fighting robot; and on the basis of the fire scene space environment model and the initial path, introducing a self-adaptive dynamic adjustment strategy of pheromones and heuristic values, performing iterative search on path nodes in an ant transfer process by utilizing an improved antcolony algorithm, and finally obtaining an optimal planned path. According to the method, the advantages of an extended MAKLINK graph theory and an improved ant colony algorithm are combined, optimalpath planning can be achieved in a complex fire scene space environment containing concave-convex polygonal obstacles, the algorithm convergence speed is high, and the path planning capacity is high;in addition, the feasibility and effectiveness of the provided technical scheme are verified through a simulation test.
Owner:TONGJI UNIV
Method for planning and deciding path of aircraft around multiple no-fly zones
ActiveCN112162569AAvoid the case of a single solutionSimple methodTarget-seeking controlNo-fly zoneDirected graph
The invention provides a method for planning and deciding a path of an aircraft around multiple no-fly zones. The method comprises the following steps of 1, establishing a directed graph model; 2, traversing all paths from a starting point to an end point; 3, planning a path and designing a path evaluation index; 4, making a path decision scheme. Through the above steps, the directed graph model can be constructed based on the graph theory, the path planning and decision making of the aircraft around multiple no-fly zones are achieved, the problems of fusing on guidance and neglecting planningexisting at present are solved, and multiple feasible schemes can be provided for aircraft guidance. The method is scientific, is good in manufacturability and has wide application and popularizationvalue.
Owner:BEIHANG UNIV
Travel accessibility calculation and display method based on graph theory under networked operation condition, computer equipment and storage medium
PendingCN111368149ARealize computingGood estimateForecastingOther databases indexingGraph theoreticSimulation
The invention discloses a graph theory-based travel accessibility calculation and display method under a networked operation condition. The method comprises the steps of S1, establishing a line network static model based on a graph theory and storing station basic information; s2, receiving OD information to perform dynamic travel accessibility calculation; s3, providing travel accessibility queryand display to the outside through a cross-terminal platform; according to the scheme, the urban rail transit station simplified model is established through the graph theory; a Dijkstra algorithm isused to find the shortest path between any OD; according to the method, the effective path set existing in the line network is searched according to the depth-first search algorithm, meanwhile, subway travel calculation associated with the train running chart is achieved, development of travel calculation query programs of a computer terminal and an enterprise WeChat terminal is completed, passengers can estimate travel conveniently, and the passing efficiency is improved.
Owner:CHENGDU ZHIYUANHUI CULTURE & MEDIA CO LTD
Medium-voltage power distribution network topology simplification and abstraction method based on graph model
ActiveCN111353267AReduce complexityMaintain propertiesData processing applicationsCAD circuit designAlgorithmGraph theoretic
The invention discloses a medium-voltage power distribution network topology simplification and abstraction method based on a graph model. The method comprises the steps: modeling the medium-voltage distribution network topology by using the graph model; simplifying a medium-voltage power distribution network, and realizing the progressive abstract simplification of an original path, a key path, acore path and a core extremely-simple path by utilizing technologies such as homomorphic transformation and heavy edge elimination in a graph theory, and providing applicable topology levels for microscopic, mesoscopic and macroscopic application scenes such as feeder line maintenance inspection, distribution network maintenance and regulation and control operation and power grid planning. Through layer-by-layer abstraction, the complexity of the distribution network topology is effectively reduced while the characteristics of the distribution network are maintained, so rapid analysis and visualization of various microscopic, mesoscopic and macroscopic business scenes such as feeder line patrol inspection, distribution network transfer analysis and power grid planning are realized.
Owner:STATE GRID JIANGSU ELECTRIC POWER CO ELECTRIC POWER RES INST +3
Task scheduling system and method for unmanned motor sweeper
InactiveCN113377111ATimely collectionIncrease profitPosition/course control in two dimensionsVehiclesPublic placeGraph theoretic
The invention discloses a task scheduling system and method for an unmanned sweeper. The system comprises an area camera detection system and an unmanned sweeper. The area camera detection system comprises a foreign matter detection positioning system, a foreign matter cleaning path planning system and a command measurement and control system. The novel garbage cleaning method is invented by combining thousand-seeking position positioning and graph theory path planning, information can be collected in time through real-time monitoring of the area camera, different cleaning tasks can be issued at high and low peaks, and the utilization rate of the trolley is increased. Meanwhile, an obstacle avoidance function is added, and a movebase package in the ROS is utilized, so that pedestrians and other obstacles can be prevented from being collided during a cleaning task, and new local path planning can be carried out in time according to the positions of the obstacles. According to the scheme, the trolley can be utilized more efficiently, low manpower resource consumption is achieved, multiple extension functions can be achieved, and a better leisure space is provided while ground cleaning of public places is guaranteed.
Owner:HANGZHOU DIANZI UNIV
Automatic layout method and device based on Euler path algorithm
PendingCN114154454AAutomatic layout implementationSmall footprintCAD circuit designSpecial data processing applicationsAlgorithmGraph theoretic
According to the automatic layout method and device based on the Euler path algorithm and the storage medium provided by the invention, the MOS transistors to be placed can be classified according to the characteristic parameters of the MOS transistors to be placed to obtain a plurality of MOS transistor groups, and then the gate sequences of the MOS transistors in each group of MOS transistors are classified by taking the drain electrodes and the source electrodes of the MOS transistors as the nodes of the graph theory; whether the nodes of the graph theory form an Euler path or not is judged, if the nodes of the graph theory do not form the Euler path, preset components are added to the nodes with odd degrees in the graph theory so that the nodes which do not form the Euler path can be converted into the nodes forming the Euler path, and then the MOS transistors are placed according to the arrangement sequence in the formed Euler path. And forming a plurality of MOS tube grouping sequences after placement. According to the method provided by the invention, the automatic layout of the MOS tube is realized, so that the time required for designing the layout of the MOS tube by manually considering the integrated circuit is reduced, meanwhile, the active region of the MOS tube is ensured to be correctly shared, the layout occupied area is reduced, and the design period of the integrated circuit is shortened.
Owner:TSINGHUA UNIV
Electric vehicle charging navigation and path selection method based on traffic balance
ActiveCN112686441AImprove travel efficiencyEfficient selectionForecastingDesign optimisation/simulationTraffic equilibriumGraph theoretic
The invention provides an electric vehicle charging navigation and path selection method based on traffic balance, and the method comprises the specific steps: abstracting intersections and road sections in a traffic network into points and lines in a graph theory, and building a mathematic model of the traffic network; taking the sum of the impedance integrals of all the road sections in the traffic network as an objective function of a traffic balance mathematical model, taking factors related to the road section flow and the path flow in the traffic road network as constraint conditions, and establishing the traffic balance mathematical model; taking the minimum travel road resistance of the vehicle as a target function of path selection, taking the charge capacity constraint and the charge capacity constraint of the electric vehicle as constraint conditions of path selection, and establishing a mathematical model of path selection; solving an optimal path by applying a Dijkstra algorithm, building an available path set through a branch pricing algorithm, and solving the optimal path through mutual iteration of a traffic balance problem and a path selection problem. According to the invention, the travel efficiency of the vehicle in the whole system is improved while the optimal individual path selection is ensured.
Owner:YANSHAN UNIV
Method for automatically reconstructing tree structure from ground-based laser radar point cloud
PendingCN114219912AAccurate and detailed branch geometryAccurate and Detailed GeometryImage enhancementImage analysisVertex (graph theory)Graph theoretic
The invention provides a method for automatically reconstructing a tree branch structure from a ground-based laser radar point cloud, which is characterized in that in order to accurately fit a tree branch geometric structure and a topological relation from a TLS point cloud, a single tree geometric structure and topology are reconstructed on the basis of a graph theory method in combination with the advantages of prior hypothesis modeling and lightweight expression; the method for reconstructing the fine geometric structure of the individual tree branches and trunks is high in universality and precision. Firstly, triangulation of an input point cloud is completed based on three-dimensional Delaunay, and a shortest path of a directed weighted graph is calculated based on a Dijkstra algorithm. And then extracting an initial tree skeleton by using a minimum spanning tree (MST) algorithm framework, designing a merging algorithm of redundant vertexes and edges, and completing simplification and optimization of the initial skeleton. And finally, based on the tree skeleton, single tree branch structure cylinder fitting and an optimization algorithm thereof are completed, and a fine single tree branch geometric structure is reconstructed.
Owner:BEIJING FORESTRY UNIVERSITY
Comprehensive cost optimal path planning method for rolling polyhedron tensioning whole robot
InactiveCN110703748ACutting costsPosition/course control in two dimensionsVehiclesDirected graphGraph theoretic
The invention belongs to the technical field of robot path planning, and discloses a comprehensive cost optimal path planning method for a rolling polyhedron tensioning whole robot, which comprises the steps of predetermining possible positions and movement paths of a robot according to a rolling advancing mode of the robot and polyhedron configuration characteristics, and obtaining a possible position and path diagram of the robot; establishing a path planning model in a directed graph G (V, H) mode according to the possible position and path diagram of the robot and terrain environment characteristics, and determining a starting point and a target point; and obtaining a path with the minimum comprehensive cost by using an algorithm for solving the shortest path between two points in a graph theory. The comprehensive cost optimal path planning method is suitable for a polyhedral-structured tensioning whole robot taking rolling as a traveling mode, comprehensively considers the influence of factors such as distance, terrain and the like on path planning decision, and executes the algorithm for solving the shortest path between two points in the graph theory to obtain the path withthe minimum comprehensive cost, thus the comprehensive cost optimal path planning method of the invention has effectiveness and reliability, and a planning result is still applicable when the robot isin an off-line state.
Owner:ZHEJIANG UNIV
Method for solving optimal path of wireless sensor network by using differential evolution
ActiveCN105142198AAverage qualityOptimal Evolutionary AlgebraNetwork topologiesHigh level techniquesLine sensorGraph theoretic
The invention relates to a method for solving the optimal path of a wireless sensor network by using differential evolution. According to the method, an undirected graph is utilized to describe wireless sensor network path problems and research nodes and information transmission in the wireless sensor network according to graph theory knowledge; the undirected graph can be expressed by an equation that G=(V,E), wherein V indicates the set of all nodes of the network, E is the set of all communication lines, V=Vhead, V1,... , Vk,... , Vn, and E=E1,... , Ek,... En; Vhead is assumed to be the target node in the cluster, namely, a cluster head node; a k-th node is adopted as a source node, and a path optimization model is established; a differential evolution algorithm is adopted as a search tool to find minimum energy consumption required by information transmission from the source node to the target node; and a path with minimum energy consumption required by information transmission from the source node to the target node is found. With the method adopted, an optimal transmission path with minimum energy consumption can be calculated quickly and accurately.
Owner:HENAN UNIV OF CHINESE MEDICINE
Method for economically optimizing design scheme of electric collection system of large-scale offshore wind farm
PendingCN112909981APower network operation systems integrationElectric power transfer ac networkGraph theoreticCollection system
The invention provides a method for economically optimizing a design scheme of an electrical collection system of a large-scale offshore wind farm, which is characterized by comprising the following steps: 1) selecting the large-scale offshore wind farm, and carrying out fan string division on the wind farm in a power transformation area by adopting a regional radiation fuzzy clustering algorithm; and 2) searching an optimal cable topology link path for the fan after each partition and string division, wherein the step can be completed by using a graph theory and a minimum spanning tree Primer shortest path optimization algorithm; 3) calculating the total cost of the optimal collection topology under all the sub-methods according to the sub-regions and the types of the fan strings, seeking the optimal cost, and ending the algorithm. The combinatorial algorithm solves the problem of curse of dimensionality of a topological structure optimized by an exhaustion method, and provides support for simply and quickly solving the problem of economical efficiency optimization of a large offshore wind power plant collection system. And finally, example analysis of the combinatorial optimization algorithm is performed on a wind power plant example in northern peninsula of Shandong, and the effectiveness of the combinatorial optimization algorithm is proved.
Owner:YANTAI POWER SUPPLY COMPANY OF STATE GRID SHANDONG ELECTRIC POWER +2
Double-layer economic optimization method for microgrid grid connection
ActiveCN111552912AAchieve economic optimizationForecastingComplex mathematical operationsElectricity priceGraph theoretic
The invention discloses a double-layer economic optimization method for microgrid grid connection, and the method comprises the steps: 1, building a lower-layer microgrid optimization model; 2, solving the electricity purchasing / selling potential of each microgrid participating in the upper-layer transaction and electricity purchasing / selling price information; 3, constructing an upper-layer optimization model of the energy transfer path based on a graph theory; and 4, based on a JAYA-Dijkstra algorithm, solving the lower-layer microgrid optimization model and the upper-layer microgrid optimization model to obtain an optimal transmission path of the output power of each microgrid. According to the double-layer economic optimization method for microgrid grid connection, the economic benefits of multiple microgrids can be effectively improved.
Owner:CHINA THREE GORGES UNIV
Graph-based hypersonic flight vehicle path modeling method around multiple no-fly zones
ActiveCN113311860AImplement Path ModelingImprove performancePosition/course control in three dimensionsNo-fly zoneDirected graph
The invention provides a graph-based hypersonic flight vehicle path modeling method around multiple no-fly zones. The method comprises the specific steps of 1, obtaining a task area; 2, arranging path points; 3, formulating an edge connection strategy, and connecting directed edges; and 4, completing weighted directed graph modeling. Through the above steps, the directed graph model can be constructed based on the graph theory to guide the formulation of an avoidance strategy and path point planning of the hypersonic aircraft around multiple no-fly zones, the overall performance of the flight path is improved, a large quantity of tests and iterations during the artificial design of the avoidance path are avoided, and the efficiency is improved; and the modeling method is scientific and good in manufacturability, and has wide popularization and application values.
Owner:BEIHANG UNIV
Ant colony sequencing and positioning method for circular layout in cable processing
PendingCN112231939ANarrow down the search spaceTo overcome the shortage of large search spaceArtificial lifeDesign optimisation/simulationAlgorithmGraph theoretic
Owner:ZHENGZHOU UNIVERSITY OF LIGHT INDUSTRY
Crowd evacuation bottleneck congestion condition analysis method and system
The invention provides a crowd evacuation bottleneck congestion condition analysis method and system, and the method comprises the steps: constructing an evacuation network according to the layout condition of a building, and enabling the evacuation network to comprise nodes and edges for connecting the nodes; determining the shortest path from each node in the evacuation network to an exit; and in the crowd evacuation process, determining people flow data corresponding to the bottleneck position on the shortest path. According to the method, people flow data of different bottleneck positionsof any building can be obtained, so that guidance is provided for safe evacuation; a user can understand the topological structure of the building from the perspective of the graph theory, so that thearchitecture suggestion of the evacuation network is given in the early stage of building design, and the internal design of the building is more reasonable.
Owner:SHANGHAI INST OF TECH
Path optimization control method and device for liquid metal battery pack
ActiveCN113065305AAchieve energy transferIncrease the equalization pathArtificial lifeConstraint-based CADGraph theoreticControl theory
The invention discloses a path optimization control method and device for a liquid metal battery pack, and belongs to the technical field of liquid metal battery application, and the method comprises the following steps: S1, building a graph theory model corresponding to a battery module composed of a plurality of liquid metal batteries; s2, designing a double-layer equalization topology corresponding to an inductor and a multi-winding transformer in the graph theory model; s3, calculating the equalization efficiency and the equalization speed of the graph theory model by utilizing the equalization parameter of each section of path in the double-layer equalization topological graph theory model, and taking the equalization efficiency and the equalization speed as constraint conditions; s4, taking the index function of the circuit loss and the equalization time added with the weight as a target function to establish an equalization path optimization model; and S5, solving the equilibrium path optimization model by using an ant colony algorithm to obtain an optimal equilibrium path meeting the objective function and the constraint condition. According to the invention, the battery equalization problem is converted into a function optimization problem with constraint conditions, the optimal equalization path is obtained by using the ant colony algorithm, and the equalization efficiency and the equalization speed can be improved.
Owner:HUAZHONG UNIV OF SCI & TECH
Combined cooling heating and power system construction method and system based on graph theory and equivalent electrical method
PendingCN111709638AScientific Judgment Advantages and DisadvantagesResourcesGraph theoreticEngineering
The invention provides a combined cooling heating and power system construction method and system based on a graph theory and an equivalent electrical method. The method comprises steps of constructing an energy supply and energy consumption model of the energy flow network according to a graph theory thought, selecting the maximum equivalent electric weight as a target function, analyzing and comparing each selectable path in the graph theory model to obtain an optimal energy supply path, and determining an energy supply structure of the combined cooling heating and power supply system. According to the node type and graphical design method provided by the invention, the aspects of multi-energy types, multi-equipment structures, multi-energy supply path coupling and the like are considered, and an idea is provided for the structural design of the multi-source multi-sink multi-path coupling CCHP system.
Owner:SHANDONG UNIV
Online fault detection method for digital microfluidic biochip on basis of reinforcement learning
The invention discloses an online fault detection method for a digital microfluidic biochip on the basis of reinforcement learning. The method comprises the following steps of: establishing a mathematical model of the digital microfluidic biochip on the basis of a grid method, an undirected graph method in a graph theory and a chip constraint condition; obtaining set initial parameters based on areinforcement learning algorithm, a target number Max of algorithm iteration and information sharing time Tx, and establishing a Q table corresponding to each test liquid drop; selecting a next electrode of the test liquid drops based on the updating rule function, greedy function and tabu matrix of the reinforcement learning algorithm; and outputting target test time and the target paths of the test liquid drops based on a judgment condition. Through parallel online testing of multiple liquid drops, the utilization rate of the test liquid drops is increased, and the energy consumption problemof the test liquid drops is reduced; and therefore, the test liquid drops can optimize test paths in a short time, the fault detection of the chip is completed, and the reliability of the digital microfluidic chip is guaranteed.
Owner:GUILIN UNIV OF ELECTRONIC TECH
Piping shaft optimization algorithm
ActiveCN112241563AGeometric CADSpecial data processing applicationsGraph theoreticDegree (graph theory)
The invention discloses a piping shaft optimization algorithm, and relates to the field of architectural design and electromechanical design. The method is characterized by comprising the following steps of: extracting room information and possible positions of the piping shafts from a building information model, and automatically solving a shortest path pipeline from each possible position of each piping shaft to each tail end by adopting a Pramer algorithm on the basis of a graph theory and a minimum spanning tree thought in combination with an arrangement position of tail end equipment in electromechanical design; and calculating the resistance of each solved shortest path pipeline and the unbalance degree of the system, and selecting the piping shaft with the minimum pipeline resistance within 15% of the unbalance degree of the system as the optimal piping shaft position. The comprehensive optimal design of simple system pipeline arrangement, good system balance, resistance reduction, energy-saving operation and the like is achieved.
Owner:TONGJI UNIV
Energy bidding scheduling method and system based on graph theory
PendingCN114066019AMeet transaction needsForecastingResourcesGraph theoreticIntegrated energy system
The invention relates to an energy bidding scheduling method and system based on a graph theory. The method comprises the following steps: firstly, obtaining input and output power limit data and energy transaction quotation of all users participating in transaction in a period; carrying out transaction priority ranking according to the energy transaction quotation, and constructing a priority ranking list; according to the priority ranking list and the obtained input and output power limit data of the users participating in the transaction, judging transaction feasibility and contructing an initial matrix; searching a feasible energy path according to transaction feasibility, creating a path tree, and generating a path tree sorting list; and carrying out matrix correction to obtain a scheduling instruction. According to the quotation information of the distributed users, the energy supply and demand priority is determined, multi-element energy supply and demand flexible matching in the integrated energy system can be realized, and the transaction demand of a multi-element load subject is met.
Owner:STATE NUCLEAR ELECTRIC POWER PLANNING DESIGN & RES INST CO LTD
Substrate design method and device of power module and terminal equipment
The invention provides a substrate design method and device of a power module and terminal equipment, and belongs to the technical field of power modules. The method comprises the following steps: acquiring input parameters of a substrate for designing a power module; according to the information of the circuit topology and a pre-stored structure diagram of each basic layout unit, determining the type and the number of the basic layout units on the circuit topology; and connecting the communication paths of the graph elements of the basic layout units on the circuit topology by using a path-finding model to obtain a connection graph of the substrate of the power module. In the application, the graph theory model of the basic layout unit is defined, the relative position and the connection relation of the basic layout unit are described, the optimal communication path in each commutation network is determined on the circuit topology through the integer programming model, and the node and the interconnection edge of the line unit corresponding to each optimal communication path are established. In the process, the input of a manual layout template is not needed, and the substrate layout autonomous design of the power module is realized.
Owner:HUAWEI DIGITAL POWER TECH CO LTD
Multi-beam channel modeling method based on propagation graph theory
ActiveCN113162712ASpatial transmit diversityTransmission monitoringAlgorithmTheoretical computer science
The invention provides a multi-beam channel modeling method based on a propagation graph theory, which corrects propagation path gains related to a transmitting and receiving end by solving gains of a transmitting and receiving end antenna array at various angles, and divides scatterers into a static discrete scattering point set and a dynamic discrete scattering point set in consideration of mobility of obstacles, and different scattering times are considered for two different scattering point sets to construct a multi-beam channel model based on a propagation graph theory. According to the method, the defect that beam forming is not considered in an existing propagation graph channel modeling theory is overcome, and the accuracy of channel modeling is improved.
Owner:BEIJING JIAOTONG UNIV
Path optimization method for concrete 3D printing
ActiveCN113733295AReduce idle travelLess inflection pointAdditive manufacturing apparatusCeramic shaping apparatusAlgorithmGraph theoretic
The invention discloses a path optimization method for concrete 3D printing. The path optimization method comprises following steps: step 1, slicing a printed piece model; step 2, converting the sliced model into a geometric model; step 3, initializing position information of geometric points in the geometric model, and dividing the geometric model into a plurality of areas which can be printed at a time according to a graph theory principle; and step 4, finding out a shortest printing path by adopting an ant colony algorithm. According to the method, the scanning sequence and the scanning starting point of each contour are reasonably planned, inflection points of a contour path in the 3D printing and scanning process are reduced, the idle stroke of the contour path is shortened, and the forming speed and quality are improved.
Owner:XI'AN UNIVERSITY OF ARCHITECTURE AND TECHNOLOGY
A method and system for urban rail transit passenger route planning based on graph theory
ActiveCN107545320BImprove travel experienceImprove travel efficiencyForecastingTravel modeGraph theoretic
Owner:BEIJING JIAOTONG UNIV
Who we serve
- R&D Engineer
- R&D Manager
- IP Professional
Why Eureka
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Social media
Eureka Blog
Learn More Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com