468 results about "Graph theoretic" patented technology

The present invention relates to a hierarchical system and method for task assignment (TA), coordination and communication of multiple Unmanned Aerial Vehicles (UAV's) engaging multiple attack targets and conceives an ad-hoc routing algorithm for synchronization of target lists utilizing a distributed computing topology. Assuming limited communication bandwidth and range, coordination of UAV motion is achieved by implementing a simple behavioral flocking algorithm utilizing a tree topology for target list routing. The TA algorithm is based on a graph-theoretic approach, in which a node locates all the detectable targets, identifies them and computes its distance to each target. The node then produces an attack plan that minimizes the sum of distances of the UAV's in the subtree of a given node to the targets.

This invention relates generally to medical imaging and, in particular, to a method and system for reconstructing a model path through a branched tubular organ. Novel methodologies and systems segment and define accurate endoluminal surfaces in airway trees, including small peripheral bronchi. An automatic algorithm is described that searches the entire lung volume for airway branches and poses airway-tree segmentation as a global graph-theoretic optimization problem. A suite of interactive segmentation tools for cleaning and extending critical areas of the automatically segmented result is disclosed. A model path is reconstructed through the airway tree.

A system and methods for the efficient segmentation of globally optimal surfaces representing object boundaries in volumetric datasets is provided. An optical surface detection system and methods are provided that are capable of simultaneously detecting multiple interacting surfaces in which the optimality is controlled by the cost functions designed for individual surfaces and by several geometric constraints defining the surface smoothness and interrelations. The present invention includes surface segmentation using a layered graph-theoretic approach that optimally segments multiple interacting surfaces of a single object using a pre-segmentation step, after which the segmentation of all desired surfaces of the object are performed simultaneously in a single optimization process.

A method and system are disclosed for changing the structure of one or more policies and / or the order of application of one or more policies to resolve conflicts among a set of policies using graph-theoretic techniques. Policies are used to govern the states of managed entities (e.g., resources and services). The set of states of the set of managed entities are represented as nodes of a graph. The output of the set of applicable policies governing all or part of the nodes is then used to control the transition between some or all nodes in the graph.

An improved method for matching traces derived from probe data to one or more line segments in a digital vector map. Points in a probe trace are provisionally matched one-by-one to line segments in the digital vector map to identify all possible matching candidates. A graph of the matching candidates is created having one or more paths. The graph has a plurality of sequential levels corresponding to the points in the probe trace. Each matching candidate is assigned to a level of the graph corresponding with trace point to which it relates. Edges are established between matching candidates in adjacent levels provided they are topologically related to one another. The graph is simplified and scored. The best paths deliver the matching results. The invention allows use of graph theoretic methods to find the best path through the graph, which in turn represents an efficient map matching algorithm. The concepts of this invention may be used in conjunction with longitudinal distance as matching criterion.

A novel method is presented for detecting coronary arteries as well as other peripheral vessels of the heart. After finding the location of the myocardium through a segmentation method, such as a graph theoretic segmentation method, the method models the heart with a biaxial ellipsoid. For each point of the ellipsoid, a collection of intensities are computed that are normal to the surface. This collection is then filtered to detect the cardiovascular structures. Ultimately, vessel centerline points are detected using a vessel tracking method, and linked together to form a complete coronary artery tree.

The invention discloses a transport network topological structure safety analytical method. The method comprises the steps of firstly, using a node, an apparatus, a circuit, an optical cable, an optical path, a sub-circuit and a sub-optical cable to describe the topological structure of the transport network; then using a graph theory model to express the topological structure of the transport network; and finally using a graph theory to perform structure safety analysis including structure index analysis, optical path route analysis, component failure analysis and / or standby route analysis on the topological structure. The invention also discloses a system for realizing the method. The system is capable of storing, calling and displaying the original data, generated intermediate data and the result data in the analytical processes of the method in real time. The invention can also enhance data normality and accuracy managements, quicken fault location and maintenance efficiency, enhance network risk identification and control, and vividly display network multimedia information so as to improve the accuracy extent and working efficiency of safety management of the transport network topological structure.

A method and a device for managing state changes (Init, Run, Suspend, Resume, End) of a managed entity (302) includes a memory (906) and a processor (904) adapted to represent each state change of a managed entity (302) as a separate node (1-5) in a graph (300), represent a state transition as an edge (Eij) connecting a first node with a first state value to a second node with a second state value, and determine a cost (C) of each edge (Eij) that is part of a set of edges (E) that form at least two paths connecting the first node and the second by applying at least one policy (P) to each edge (Eij), the first and second nodes representing an initial and a final state change of the managed entity (302).

The invention belongs to the field of unmanned ship global path planning and particularly relates to an unmanned ship global path multi-target planning method based on the improved ant colony algorithm. The method comprises steps of establishing a marine environment map model by utilizing a Maklink graph theory; improving a path heuristic information strategy to obtain a path average value; designing an ant pheromone volatilization adaptive adjustment strategy; designing a strategy combining local pheromone updating and global pheromone updating; improving the state transition probability of anext node searched by an ant colony through a heading angle deviation factor of an unmanned ship; and designing an evaluation function by integrating the requirements of the shortest global path length, the least optimization iteration times of the improved ant colony algorithm, the lowest path smoothing coefficient and the like. The method is advantaged in that multiple targets such as a globalpath distance of marine navigation of an unmanned surface vehicle, the iteration frequency of optimizing the global path by improving the ant colony algorithm and the smoothness coefficient of the planned global path are comprehensively considered, the optimal global path of marine navigation of the unmanned surface vehicle is finally planned, and the method has relatively high safety.

The invention provides an urban centralized charging station planning method based on an improved K-means algorithm. The method comprises the steps that a centralized charging station location map is established according to the geographical location information and the charging demand of each charging demand point in an area to be planned; for the centralized charging station location map, a charging station planning scheme is acquired based on a method combining a graph theory central point and a K-means clustering algorithm; and the construction cost of a charging station, the charging cost of a user and the operation annual income of the charging station are used as evaluation indexes to optimize the charging station planning scheme. The urban centralized charging station planning method based on the improved K-means algorithm has the advantages that fast location of the charging station is realized based on the clustering idea; the quantitative evaluation indexes are used to realize the optimal location planning of the charging station; and a scientific basis is provided for location planning and planning scheme evaluation of the charging station.

A functional coverage based test generation technique for pipelined architectures is presented. A general graph-theoretic model is developed that can capture the structure and behavior (instruction-set) of a wide variety of pipelined processors. A functional fault model is developed and used to define the functional coverage for pipelined architectures. Test generation procedures are developed that accept the graph model of the architecture as input and generate test programs to detect all the faults in the functional fault model. A graph model of the pipelined processor is automatically generated from the specification using functional abstraction. Functional test programs are generated based on the coverage of the pipeline behavior. Module level property checking is used to reduce test generation time.

The invention provides an energy efficient resource distribution algorithm based on interference coordination in an ultra-dense wireless network. A clustering-based ultra-dense wireless network is analyzed and given; inter-cluster and in-cluster interference coordination strategies are provided; inter-cluster interference coordination is carried out by adopting a graph colouring theory; and in-cluster interference coordination is carried out in a partial information interaction manner. The energy efficient resource distribution algorithm based on interference coordination in the ultra-dense wireless network is provided. Joint optimization of sub-channels and power of the ultra-dense wireless network is carried out through the algorithm. Firstly, the sub-channels are distributed by utilization of a user quality experience function and maximum and minimum algorithms; and secondly, optimization distribution of the power is carried out by optimizing an improved particle swarm algorithm, wherein to prevent particle swarm optimization from getting into local solution defect, a particle swarm optimization algorithm is improved by introducing damped vibration and fitness variation.

The invention provides a scheduling method and system for a shared bicycle. The scheduling method and system aim at the scheduling problem of the shared bicycle, a VRPSPD model is established, and anoptimal scheduling scheme is obtained through the mixed variable neighborhood discrete particle swarm algorithm; the established VRPSPD model integrates the graph theory and the mixed integer planningtheory and is established by combining with the VRPSPD model and an m-TSP model, and accordingly the model is more comprehensive; the adopted mixed variable neighborhood discrete particle swarm algorithm combines with the capacity of quick convergence and high precision of the discrete particle swarm and the local searching capacity of the variable neighborhood searching algorithm, the discrete particle swarm can be prevented from being caught in local optimum in the optimization process, and accordingly the optimal scheduling scheme can be truly obtained, so that the scheduling problem of the shared bicycle is solved; the operation efficiency and management scheduling level of the shared bicycle are improved, and the use rate of the bicycle is effectively improved.

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.

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.

A functional coverage based test generation technique for pipelined architectures is presented. A general graph-theoretic model is developed that can capture the structure and behavior (instruction-set) of a wide variety of pipelined processors. A functional fault model is developed and used to define the functional coverage for pipelined architectures. Test generation procedures are developed that accept the graph model of the architecture as input and generate test programs to detect all the faults in the functional fault model. A graph model of the pipelined processor is automatically generated from the specification using functional abstraction. Functional test programs are generated based on the coverage of the pipeline behavior. Module level property checking is used to reduce test generation time.

The invention discloses a Stackelberg game-based resource allocation method. According to the method, the interference of a cellular and femtocell-coexisting and spectrum-shared two-layer network is analyzed and managed; graph theory knowledge and the game theory are adopted to allocate resources used by users in femtocells and a macro base station, so that the quality of services for the users can be ensured. The method includes the following steps that: a graph theory-based clustering algorithm clusters the femtocells and sequentially allocates channels for macro users, and then matches the macro users with femtocell clusters so as to realize channel sharing; and a femtocell transmission power and macro user access selection-combined Stackelberg game is established, and the expression of the transmission power of the femtocells when Nash equilibrium is achieved is derived, and appropriate access strategies are selected for the macro users according to the transmission power of the femtocells, and iteration is repeated until Stackelberg game equilibrium is achieved, and network resource allocation is updated according to strategies which are selected when the equilibrium is achieved.

The invention discloses a method and a system for predicting power of a microgrid group. The method comprises steps: a microgrid graph theory model is built according to a communication relation between sub microgrids in the microgrid group; according to an intelligent agent node consistency theory and in combination with a micro Calman filter prediction algorithm, a power prediction algorithm for distributed prediction for needed power by a total grid of the microgrid group is determined; on the basis of the already-built communication relation graph theory topology, each sub microgrid in the microgrid group integrates grid needed power information of a local sub microgrid system and an adjacent sub microgrid system and uses a prediction algorithm to distributively perform short-term prediction on the needed power by the total grid of the microgrid group in the local sub microgrid system. Short-term prediction is carried out on the overall grid needed power of the microgrid group formed by multiple microgrids, and strong guarantee is provided for aspects of stable operation and power dispatching for the microgrid group power sharing system.

The invention discloses an ECDIS-based airline automatic design system and a construction method thereof. Recommended airlines and an airline information database are established by adopting a spatialdatabase management system; by constructing a weighted airline network graph, an optimal airline is solved in combination with the recommended airlines by adopting a Dijkstra algorithm; Matlab is used for performing modeling simulation; and different ships are subjected to an airline optimization simulation experiment. Based on the recommended airlines, the optimal airline is obtained by utilizing artificial intelligence and graph theory methods. According to the ECDIS-based intelligent airline automatic design system, a planned airline can be automatically generated; an extremely convenientairline information query function is realized; the workload of drivers is reduced to the maximum extent; and the system is of important practical significance for ensuring the ship navigation safetyand reducing the ship navigation operation cost.

The invention discloses a graph-theory-based intelligent optimization method for failure recovery of a smart distribution grid. The method comprises the following steps of 1) inputting network parameters including an original structure of a distribution network, line parameters of each branch, load of each node, DG (Distributed Generation) data and other parameters; 2) inputting a number of the current faulty line and zeroing the corresponding switching state thereof; 3) setting dimensionality, iterations and corresponding parameter values of a quantum particle swarm optimization algorithm; 4) initializing a position value xk, a quantum bit, a rotation angle, a local optimal vector xp and a global optimal vector xg of each particle; 5) correcting the position value of each particle based on a graph theory; 6) updating a rotation angle guiding value, a quantum rotation angle and a bit of each quantum particle in sequence; 7) updating the position value xk of each quantum particle; 8) updating the local optimal vector and the global optimal vector of each particle; 9) carrying out convergence test; and 10) outputting an optimal particle position value x to obtain a corresponding failure recovery strategy.

The invention relates to the technology of topology analysis in the field of an electric power system, and specifically relates to a method for rapid topology analysis and the establishment of a topological island based on a graph theory. The method includes three steps: modeling, generating topology points, and generating the topological island. According to the method, topology analysis of the electric power system can be conducted via a graph theory recognition analysis method; advantages and disadvantages of breadth and depth first search algorithms can be comprehensively considered, and search advantages of depth first for a ring network are fully used; rapid topology analysis of the electric power network and the establishment of the topological island are realized, and the accuracy and rapidity of the topology analysis result of the electric power network are greatly improved.

Automated, standardized and accurate extraction of relationships within text. Automatic extraction of such relationships / information allows the information to be stored in structured form so that it can be easily and accurately retrieved when needed. Such information can be used to build online search engines for highly specific and accurate information retrieval. The current invention discloses a novel approach to extract such information from raw text based on natural language processing (NLP) and graph theoretic algorithm. The novel method can be applied, for example, to extract protein-protein relationships in biomedical literature. The method can be easily extended to extract other biological relationships between biological terms such as proteins, genes, pathways, diseases and drugs. The method can also be applied to other information domains to extract other relationships.

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.

The invention relates to a target retrieval system applied to a moving platform and belongs to the image processing field. The target retrieval system applied to the moving platform aims to provide a grading significance information method applied to the moving platform, can not only improve discrimination capability for characteristics in a significance area, but also can reserve retrieval content in a non-significance area. The method comprises steps that, pre-processing on images in an image database in a server is carried out, grading significance areas are extracted according to a significance model based on the graph theory and a two-dimensional maximum entropy rule, a global histogram with significance labels is generated by utilizing a word bag model, SIFT characteristics of the images are calculated and queried, the global histogram is generated by utilizing the word bag model, first 1000 retrieval image sequence numbers having shortest distances are recorded, and first 10 images in the final retrieval result are returned to a mobile terminal and are displayed. The target retrieval system is a relatively rapid and effective mobile visual searching system and can detect error coupling with more robustness.

According to the structure characteristic of an alternating current region power supply system of a ring-shaped bus, through improvement on several short circuit computing methods which are widely used in the prior art at home and abroad, the original short circuit current computing method for a tree-shaped power grid is deformed into a short-circuit current computing method suitable for a ring-shaped ship power grid. The method comprises the following steps of: firstly, computing the short-circuit current of a simple grid by a star-network transformation and local equal effect method; and secondly, providing a method in which a line impedance matrix is obtained by a graph theoretic approach and then the short circuit current is calculated. According to the method, the short-circuit current computing method for a ship ring-shaped region power distribution system can be explored, the thermal stability and power stability checkout when types of the equipment are selected can be realized, and the basis can be provided for fault protection when the equipment runs.

The invention discloses a self-repairing system and a self-repairing method for an optical fiber distributed sensor network. The system consists of a plurality of optical fiber grating sensors, a self-repairing controller, an optical fiber grating demodulator and a PC. The method is to arrange the self-repairing controller inside an optical fiber network, judge local failure of the optical fiber network after damage by a granularity calculation method, and perform recombination repair on a failed local network by a graph theory method so as to guarantee that the optical fiber network can be operated normally when partial optical fibers fail locally. When an optical fiber sensing system is damaged and partially fails, the self-repairing system and the self-repairing method can automatically recombine the network and repair the functions of the network, make an intelligent material structure capable of realizing self-repairing, and improve the reliability of the optical fiber intelligent structure in engineering application.

The invention discloses an unmanned vehicle multi-lane navigation formation method based on a graph theory and a potential field method. The method comprises the following steps of 1), transmitting the predefined formation structure information to the vehicles according to the formation control of an unmanned vehicle fleet, wherein the formation structure information comprises the number of vehicles with a team forming relation, the positions of the vehicles, and the expected distances between the vehicles; 2) planning the speed and displacement required for keeping the formation by using a graph theory method and according to the predefined unmanned vehicle formation and the distance between the unmanned vehicles; 3) obtaining the unmanned vehicle formation trajectory planning according to the unmanned vehicle fleet formation planning, and performing unmanned vehicle obstacle avoidance trajectory planning on the formation trajectory planning; and 4) weighting the unmanned vehicle formation trajectory planning and the planning result of the unmanned vehicle formation trajectory planning to obtain the final planning result of the vehicle and generate the final trajectory. The methodcan adapt to the traffic scene change and automatically change the formation so as to improve the traffic safety and efficiency.