43 results about "Intersection graph" patented technology

A method, system, computer system, and computer program product including an algorithm that performs the constraints-based global routing step in the physical design of integrated circuits. The algorithm is based on finding routes for the entire circuit based on constraints being satisfied for the entire design. Initially, for each net, a set of possible routing solutions is determined based on applicable constraints. The possible solutions for the nets are combined to create a highly-connected “intersection graph,” with each intersection graph node representing a net. The intersection graph is partitioned based on constraints and performance criteria. An optimal solution is determined for each partition. The optimal solutions for the partitions are then combined to produce a global routing solution. The global routing solution is provided to a detailed router, which completes the routing for the design.

The invention discloses an intersection free steering lane setting method under automatic driving, which belongs to the field of traffic information engineering and control and relates to a traffic control technology for automatic driving vehicles by urban roads so as to enable the automatic driving vehicle to drive left, straight and right at any approach in front of the intersection. At the intersection under automatic driving, a rectangular coordinate system is built, the inner space of the intersection is divided to a plurality of grids, and a coordinate range of each grid is determined. The planned arrival time and the target lane of the vehicle are inputted. The driving path equation of the vehicle in the intersection is determined in the coordinate system, the grid coordinates are combined to calculate the grid passed by the vehicle, and the occupied time of each grid is calculated. According to an objective function with the minimum total delay, the best time for each vehicle to enter the intersection is optimized and acquired. Thus, the automatic driving vehicle can select any lane for driving at the intersection approach and passes across the intersection in a mode with the minimum total delay, lane changing is not needed, and the traffic flow convenience is improved.

The invention relates to a design method for associated intersection groups division based on hierarchical clustering, and belongs to the technical field of methods for the associated intersection groups division. The method comprises the following steps of: (1) quantitatively calculating the degree of traffic demand, and dynamically determining key intersections by using a farthest point queuingmodel improved by a least squares method; (2) quantifying the influence of cyclic variation of the intersection signals on the traffic correlation between the intersections to improve a calculation model of existing correlation degree through cyclic variation influence coefficients by an inverted S-curve function; and (3) using a hierarchical clustering idea to judge the relationship between the degree of association between each adjacent intersection in the intersection groups and a threshold value, thereby determining the associated intersection groups division and a critical path searchingalgorithm in the intersection groups. According to the design method for the associated intersection groups division based on the hierarchical clustering, multiple intersections in a road network aredivided into a plurality of associated intersection groups, the traffic correlation within each group is high, and the correlation between groups is low. Regional coordination control is transformed into critical path coordination control to prepare for the coordination control for multiple intersections in the road network.

The invention discloses a signal timing optimization method of an intersection with a construction area. The method comprises the following steps: step 1, calculating the saturation flow rate of an island type construction area; step 2, calculating the time when the release rate state of the inlet channel changes; step 3, calculating the vehicle delay of the entrance road of the intersection; step4, calculating the phase emptying time under the condition of having the construction area; and step 5, establishing an objective function and solving an optimal solution as the signal timing in caseof having the construction area. The FVD model is improved and the saturation flow rate model of the island type construction area at the signal intersection is put forward. The island type construction area intersection signal optimization model is proposed on the basis of the vehicle arrival-departure delay model so as to ensure the traffic safety of motor vehicles and non-motor vehicles to themaximum extent at the intersection of the island type construction area. The island type intersection has better signal optimization and the passengers are ensured to have better travel experience.

The invention provides a quantitative forecasting method and device for oil-gas possibility of reservoirs. The method comprises the following steps: obtaining post-stack seismic data on the oil-gas reservoirs; estimating seismic wavelets based on the post-stack seismic data; performing frequency division processing on the post-stack seismic data based on the seismic wavelets; performing inversion on the post-stack seismic data subjected to frequency division processing, so as to obtain the seismic frequency variable attributes of the oil-gas reservoirs; performing forward modeling of the different oil-gas saturation degrees based on a rock physical model and rock physical parameters of a known well, so as to obtain the frequency variable attribute of the known well; based on the frequency variable attribute of the known well, building an intersection graph template between the frequency variable attributes of the different oil-gas saturation degrees and reflection coefficients; based on the graph template, obtaining the reservoir oil-gas saturation degrees corresponding to the seismic frequency variable attributes.

The invention discloses a traffic organization and signal control method facing a left-and-right type staggered intersection. The basic principle of the invention is to, by targeting the left-to-right type staggered intersection, optimally use the intersection staggering space and the optimally design the signal timing of the intersection on the basis of the traditional intersection design. The traffic organization and signal control method fully uses the time space resource of the intersection, reduces the purging time in a signal period, and improves the traffic capacity of the left-to-right type staggered intersection. In order to achieve that, the traffic organization and signal control method disclosed by the invention comprises steps of performing data collection on the related parameters of the intersection, performing intersection traffic organization design, performing the intersection signal optimization timing, and determining whether the intersection satisfies the preset condition and chooses the corresponding scheme.

The invention provides a dynamic data-based public traffic vehicle intersection running bottleneck distinguishing method. The method comprises the steps of: S1, performing data pre-processing; S2, acquiring longitude and latitude data of an intersection range and screening out a public traffic vehicle running database in the intersection range from a public traffic vehicle GPS database; S3, estimating the actual running time at each intersection of public traffic vehicles by using a speed-time integral model and further calculating the intersection delay of each public traffic vehicle; S4, calculating the public traffic vehicle delay time average value of each intersection of a statistical interval; S5, judging the type of the intersections according to the levels of intersecting roads; S6, performing classified statistics on cumulative frequency distribution conditions of the average delay of the intersections of all types, determining a bottleneck degree distinguishing threshold anddynamically identifying the running bottleneck of the intersections of all types. The method can improve the running efficiency of public traffic vehicles at intersections and is great in universality.

The invention discloses an arbitrary polygon intersection area calculation method based on probability statistics. The arbitrary polygon intersection area calculation method comprises steps that with help of a GPU, rasterization of arbitrary polygons is realized, and the polygons expressed by vertex coordinates are converted into polygon raster images expressed by rasters; the valuation and the correction of the position identifiers of the rasters are carried out according to the intersection condition of the raster images; the arbitrary rasters are selected from a raster field to simulate the whole raster area to improve time performance; the number of the intersection rasters in the arbitrary rasters is counted, and then the intersection area is calculated. The above mentioned calculation method is not restricted by the concavity and the convexity of the polygons, and the parallelism feature of the GPU is adopted, and by comparing with the calculation methods with the help of the GPU, a processing speed is greatly improved, a principle is simple, and realization is convenient. According to an experimental result, the calculation method is suitable for the arbitrary complicated polygons, and the singularity problems of the conventional calculation methods are prevented, and therefore good robustness is provided.

The invention provides a road network important intersection extraction method based on floating car data. Road network intersection data are extracted by using road network data according to the road network intersection characteristics, and the intersection types are subdivided according to the types of the road sections connected with the intersections; then O and D matching is performed on floating car traveling tracks based on the road network intersections, and the intersections closest to the traveling start and end points act as the traveling O and D; then taxi traveling route data based on the road sections are converted into the traveling data based on the intersections by using the extracted intersections; then the intersection route data are split and the traveling data are screened so as to eliminate the unreasonable data; and finally the intersection correlation is introduced to define and select the appropriate correlation parameter, the intersections having high influence on the traveling behavior are acquired under the condition that the traveling O point and D point or the OD are/is known and the difference is analyzed so as to extract the important intersections.

The embodiment of the invention provides a method, a device and a storage medium for marking a lane in an intersection. By collecting a large amount of driving data of a vehicle, the driving data areclassified into different types of sub-data, and the driving behavior corresponding to the same type of sub-data is the same. According to the type, according to each type, curve fitting each type ofsub-data to get the virtual lane in the intersection; Mark virtual lanes on high-precision maps. In this process, the virtual lane in the intersection is automatically fitted, and the virtual lane ismarked as the intersection lane, so as to improve the efficiency and accuracy of marking the intersection lane.

A method for determining a master ring for an optical communications network having nodes arranged in a plurality of interconnected ring structures. (A master ring is a ring structure which contains every node in the network exactly once, and which also respects the node ordering of every individual ring.) An efficient solution to the master ring problem is provided by advantageously limiting the enumeration process based on the consistency of the enumeration of individual rings with each other. Illustratively, an intersection graph of the network is generated; one or more of the rings is chosen and possible openings of each of these rings are enumerated; and a limited number of possible openings of one or more other (i.e., non-chosen) rings are enumerated such that the enumeration of the possible openings of the other (i.e., non-chosen) rings are consistent therewith.

The invention is a simple 3D crossing T-shaped intersection, a novel T-shaped road intersection, simple-structured, small-scale, excellent-performance, convenient to construct, cost-saving, and widely applied. And it is composed of two one-way through bridges spanning trunk road with interval turning lane and intersecting road and connecting the trunk road with the intersecting road through flat ramp, or a one-way through bridge spanning trunk road and intersecting road and a footpath spanning the trunk road and the intersecting road. And it uses the through bridge spanning the trunk road to implement 3D-crossing complete or limited interconnection, increasing flux and efficiency of T-shaped road intersection, improving intersection traffic order and assuring city roads are smooth in high efficiency. And it can be used in reconstruction of intercity highways, city fast trunks, or T-shaped road intersections in city zones, limited by surroundings, and exert its efforts to improve city traffic environments and speed up complete and sustainable development of cities.

The invention discloses a labyrinth feature recognition and walking method of a humanoid robot. The method comprises the specific steps that step 1, a camera at the head of the humanoid robot collectsan image; step 2, the humanoid robot performs image processing and image feature extraction on collected image information, wherein the processes include edge detection, circle detection, straight line detection and line splicing to identify the features of the labyrinth; step 3, the humanoid robot identifies intersection types according to the features of the labyrinth; and step 4, the humanoidrobot passes through the current intersection according to the intersection types and walking strategies. The method uses vision, sonar and information of fewer markers, obtains the relative positioninformation of the robot in the labyrinth, identifies the intersection types in the labyrinth and develops corresponding walking strategies according to different intersection types to make the humanoid robot successfully pass the intersections, realize the labyrinth navigation and realize the direction calibration when deviation occurs during the walking.

The invention relates to a system for realizing intersection channelization graph configuration and automatic graph docking functions. The system comprises: an intersection channelization graph feature warehouse for storing intersection channelization graph feature information; an artificial configuration module for configuring an artificial intersection graph; a scats converter for extracting intersection channelization feature information from a scats signal platform; a platform protocol converter for extracting intersection channelization graph feature information from the signal platform;and an intersection channelization graph production algorithm module for adaptively calculating intersection graph point location information according to the intersection channelization graph featureinformation. The invention also relates to a method for realizing intersection channelization graph configuration and automatic graph docking processing. By adopting the system and the method, batchtransformation of intersection channelization is completed, information of a real intersection is directly displayed to a client, intuitive display of a signal operation state is realized, graph configuration work is completed within 10 seconds by drawing an algorithm model, and the work of configuration personnel is greatly liberated.

The invention discloses a railway transportation risk probability calculation method based on a hybrid heuristic rule system. The method comprises the steps that firstly, the environment monitoring quantity, the equipment monitoring quantity and the carrying monitoring quantity of a certain railway transportation interval are collected, and the railway transportation risk probability is output; secondly, reducing the intersection heuristic confidence rule through a reduction rule to obtain a hybrid heuristic rule system comprising the intersection and the union; and finally, an evidence reasoning (ER) algorithm is utilized to fuse the confidence structure in the item after the activated confidence rule is input to obtain the risk probability. According to the invention, various elements ofrailway transportation risk calculation, including environment monitoring quantity, equipment monitoring quantity, carrying monitoring quantity and the like, can be processed; the method comprises intersection rules and union rules, so that the total number of the rules can be reduced, the rule combination explosion problem is avoided, and the calculation efficiency is improved.

The invention discloses a perceiving area intersection method of a directed sensor network node. In a two-dimensional plane, the covering area of the directed sensor node can be approximately regardedas a sector, the algorithm abandons a previous way of dividing to small square grid areas and enabling the sensor coverage range in the two-dimensional plane to be regarded as a triangle, and the analysis to the sector intersection relation is used for calculating the intersection area between two nodes. In the algorithm, the intersection area of the sector is divided, if an arc is existent, thecalculation is executed by using a mode of dividing to an arch and a polygon, and if the arc is not existent, the calculation is executed by directly using a solution mode of the convex polygon intersection area.

Embodiments of the invention provide a service data forwarding method and device for an RPR intersection ring. An intersection node in the RPR intersection ring determines node roles in intersection ring instances according to pre-configured corresponding relations between the intersection ring instances and intersection group nodes; and aiming at any intersection ring instance, according to the node roles of the intersection node in the intersection ring instances, node forwarding states in the intersection ring instances are set so as to forward inter-ring service data in the intersection ring instances, wherein the intersection group roles of the same intersection group in different intersecting ring instances are different, the intersection ring instances are bound with corresponding data VLAN groups in advance, and the data VLAN groups are obtained by dividing the configured inter-ring service data in advance. Through the scheme, the forwarding efficiency of the inter-ring servicedata can be improved.

The invention relates to the technical field of vehicle video tracking, in particular to an encirclement type moving vehicle video tracking method based on fusion multi-source data analysis, which improves the accuracy of a prediction result and the continuity of video tracking. The method comprises the following steps: step 1, aiming at urban traffic road network data and road video monitoring numbers, constructing a monitoring video-road section-intersection graph relation model according to a visual relation and a spatial topological relation of the urban traffic road network data and the road video monitoring numbers, so as to form video tracking graph data as a data basis of the video tracking method; step 2, aiming at the set moving vehicle target, monitoring the target vehicle through a man-machine combination mode; step 3, acquiring GPS data of personnel equipment or a vehicle in the moving target vehicle, and performing precision correction on the position of the moving vehicle; and step 4, aiming at the road section where the target vehicle is located, solving a possible driving path in a default second-order encirclement circle range through a graph relation network.

The invention belongs to the technical field of oil and gas exploration and development, and discloses a method for automatically determining complex lithology based on intersection graphs and Fisherdiscrimination, and the method comprises the following steps of establishing a connection between the lithology of core discrimination and corresponding logging curve data by taking the lithology discrimination data of core data as a female parent, establishing an automatic lithology discriminative model that fuses the intersection graphs and Fisher discrimination by taking the logging curve dataas a learning sample, discriminating a large number of logging curves by using the mode, and automatically discriminating the lithology of all wells. The method provided by the invention has clear principles and accurate results, is mainly proposed for the development of complex lithology discrimination of multiple lithology types, is suitable for the lithology discrimination of a large number ofunderground complex geological bodies with logging data, is particularly suitable for automatic lithology discrimination under complex conditions with more than four kinds of lithologies, and can greatly improve efficiency and degree of discrimination accuracy.

The invention discloses a saturation modeling method with equivalent J function constraint. The saturation modeling method with the equivalent J function constraint comprises the following steps of 1)establishing a sedimentary microfacies model, a porosity model and a permeability model of a target work area; 2) establishing a height model above an oil-water interface according to the oil-water interface; 3) establishing an equivalent J function model; 4) generating a height logging curve above the oil-water interface of each single well in the target working area; 5) generating an equivalentvariable curve of different sedimentary facies; 6) establishing an intersection graph of the equivalent variable curve and a logging water saturation curve under different sedimentary facies conditions, and establishing a linear fitting distribution function; 7) converting the equivalent J function model generated in the step 3) into a fitted water saturation geological model; 8) establishing anoil-containing boundary model; and 9) obtaining a water saturation model after boundary constraint, further obtaining an oil saturation model of the target work area, and obtaining a geological modelof the original oil saturation of the oil reservoir.

A system that generates interactive intersection areas receives a graphic diagram that includes a plurality of intersecting shapes and intersection areas. The system then creates or receives a definition for each of the shapes and determines a number of possible intersection areas for the diagram. The system defines a clipping path for each possible intersection area and defines a mask for each possible intersection area. The system then draws each intersection area using the defined clipping paths and masks