Product
Patsnap Eureka
For R&D, Patsnap Eureka makes reading and utilizing patents & technical documents easy.
Patsnap Eureka AIR
Designed for self-driven R&D workflows. Generate viable solutions, solve complex R&D challenges, empower your innovation with AI.
Patsnap 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.
311 results about "Breadth-first search" 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
Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key'), and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.
Method and system for ascribing a reputation to an entity from the perspective of another entity
Owner:OPEN RATINGS
Method and device for evaluating system security based on correlation analysis
InactiveCN104348652AAccurate Security AssessmentEfficient Safety AssessmentData switching networksAttackTheoretical computer science
The invention discloses a method and a device for evaluating system security based on correlation analysis. The method comprises the following steps of using an attack graph model to perform the correlation analysis on the network security condition, adopting an attack graph generation algorithm based on breadth-first search, introducing a PageRank calculation model to quantize the weights of state nodes of the attack graph, utilizing the difference of the weights to judge the critical attack nodes of the attack graph, utilizing a depth-first search algorithm to find the critical attack path in the attack graph, finally providing the network security amount based on the attack graph, quantizing the risk value of the critical attack path of the attack graph, and quantizing the security of the whole network.
Owner:CHANGSHU RES INSTITUE OF NANJING UNIV OF SCI & TECH
Power distribution network topology layout method
ActiveCN103762591ARealize real-time monitoringLive UpdateAc network circuit arrangementsTopology informationElectric power system
The invention provides a power distribution network topology layout method. The method comprises the step of obtaining geographical position data of nodes of an electric power system, the topology information of connection of the nodes and line hardware parameter information among the nodes and selecting the node closest to a power transmission network as an original female node, the step of obtaining the on-off state, power parameters, interphase faults and grounding faults of spot switches of the nodes of the power transmission network and the voltage and current parameter information of the spot switches when the faults happen, the step of extracting the topology relation among the nodes through a first-level breadth-first search method, the step of determining the types of devices of the nodes through a second-level breadth-first search method, the step of traversing, searching for and determining the types of the devices of the nodes through the breadth-first search methods to carry out layout numbering, and the step of determining the distance between every two adjacent nodes on a topology graph and the transverse distance and the longitudinal distance of the nodes relative to the female node and carrying out the topology layout and display. The repeated nodes in the current power transmission network topology graph are removed through a longitudinal symmetrical layout method and a longitudinal draw type wiring method, and the power transmission network topology layout is carried out.
Owner:STATE GRID CORP OF CHINA +2
Adaptive 2n-ary tree generating method, and method and apparatus for encoding and decoding 3d volume data using it
A method and apparatus for encoding and / or decoding depth image-based representation (DIBR) data are provided. The encoding method includes: converting 3-dimensional (3D) volume data into adjustable octree data with predetermined labels given to nodes; by referring to the labels, encoding nodes of the adjustable octree from the root node to leaf nodes by a modified breadth-first search (BFS) method allocating priorities among children nodes; and generating a bitstream with predetermined header information and encoded node data. The decoding method includes: extracting header information containing at least resolution information of an object, from a bitstream and decoding the header information; calculating the number of nodes by using the resolution information of the header, and by a modified BFS method allocating priorities among children nodes, decoding each node of a tree from the root node to leaf nodes; and restoring an adjustable tree by using decoded nodes. According to the method and apparatus, a huge amount of 3D volume data can be encoded with a high efficiency, and volume data with an arbitrary resolution as well as volume data with a fixed resolution can be encoded with a high efficiency. Accordingly, with a small amount of data, 3D volume data with a high picture quality can be restored. In addition, since a progressive bitstream is generated, 3D volume data can be shown progressively when decoding is performed.
Owner:SAMSUNG ELECTRONICS CO LTD
Discovery and monitoring of an environment using a plurality of robots
ActiveUS8751043B2Instruments for road network navigationAutonomous decision making processComputer visionDiscretization
Owner:TERRACE LICENSING LLC
Webpage classification technology based on vertical search and focused crawler
InactiveCN101520798AImprove search efficiencySpecial data processing applicationsWeb siteWeb page categorization
The invention provides a method for identifying webpage classification based on vertical search and focused crawler. The method comprises two parts, namely a webpage source code acquisition method and a webpage content analysis method, wherein the webpage content analysis method is a key method, and comprises two main parts, namely extraction of structured information of the webpage and crawling strategy of the focused crawler. First, a URL is selected from a navigation site URL list to acquire a source file of the URL; and then, all classified URL of the navigation URL sites can be identified and acquired by the webpage content analysis method. The key method in the method is the webpage content analysis method, which is to first extract the webpage structured information, then carry out URL snatch by a directional breadth-first search strategy based on webpage content feature, and finally store the snatched URL and corresponding website classification in a list Category.
Owner:苏州锐创通信有限责任公司
System and method for a safe depiction of terrain, airport and other dimensional data on a perspective flight display with limited bandwidth of data presentation
ActiveUS7262713B1Limited bandwidthReduce usageAnalogue computers for trafficNavigation instrumentsTerrainSystem capacity
The present invention is directed to a system and method for a safe flight display through increasing situation awareness by an optimal presentation, given limited capacity of the system. The system may determine which terrain area needs a detail representation and which area needs a coarse representation. A view-dependent visual error metric may be utilized to define and maintain an error bound and accurately minimize the amount of terrain data being depicted. By performing a breadth-first search on the terrain database, a user can determine amount of geometry to be displayed with limited bandwidth of data presentation. The user may be allowed to scale the application to his / her desired level of detail, given a capacity of the system. Therefore, the system may provide a safe flight display with an anticipated and graceful (all portions of the screen would be given an equal quality representation) degradation in performance upon the choice of the user.
Owner:ROCKWELL COLLINS INC
Generating performance tests from UML specifications using markov chains
InactiveUS20060253839A1Error detection/correctionSpecific program execution arrangementsSoftware development processMarkov chain
An automated approach to generating test cases for performance testing may be used for test case planning, early in the software development process, when a UML use case model and its activity diagram refinement are specified. The planned performance tests are executed later in the software development process, after the system is developed. The use case model is annotated with operation arrival rates and departure rates. Deterministic state testing (DST) generation and execution are applied for performance test generation and execution. In addition, a technique is described to generate the most likely test scenarios, labeling each arch in the activity diagram with transition probabilities and applying a breadth first search algorithm to select the most likely paths to be tested for each state generated by the DST algorithm.
Owner:SIEMENS MEDICAL SOLUTIONS USA INC
Three-dimensional laser radar point cloud target segmentation method based on depth map
ActiveCN109961440AAvoid splittingImprove real-time performanceImage enhancementImage analysisPoint cloudRadar
Owner:CHONGQING UNIV OF POSTS & TELECOMM
Hybrid sphere decoding method and system
A hybrid sphere decoding method is disclosed. Received data is processed to obtain preliminary parameters. Mbf layers are determined to use breadth-first search and Mdf layers to use depth-first search. A search process is implemented based on the preliminary parameters, in which Mbf layers are searched using breadth-first search and Mdf layers are searched using depth-first search.
Owner:IND TECH RES INST
Arteriovenous retinal blood vessel classification method based on eye fundus image
ActiveCN104573712AImprove accuracyIncrease credibilityCharacter and pattern recognitionOthalmoscopesVeinMedicine
The invention discloses an arteriovenous retinal blood vessel classification method based on an eye fundus image. The method includes the steps that first, a global blood vessel set and optic disk positioning information of the fundus image are acquired, the global blood vessel set is a set of all blood vessels in the fundus image, and the optic disk positioning information comprises the optic disk center of the fundus image; second, main blood vessels are determined according to the global blood vessel set and the optic disk positioning information and classified so that main blood vessel classification information can be obtained; third, the main blood vessel classification information is used for classifying the blood vessels in the global blood vessel set through a breadth first-search algorithm based on SAT so that global classification information can be obtained. According to the method, the classification information of the main blood vessels around an optic disk is first obtained, external expansion diffusion is performed from the main blood vessels through the breadth first-search algorithm based on SAT so that all the blood vessels can be obtained, a complete automatic blood vessel classification method is achieved, manual intervention is not needed, and classification precision is high.
Owner:杭州求是创新健康科技有限公司
Unmanned vehicle track real-time planning method based on road structure weight fusion
ActiveCN110081894AGuaranteed stabilityFlexible and stable trajectory planning resultsInstruments for road network navigationInternal combustion piston enginesVehicle dynamicsCollision detection
The invention provides an unmanned vehicle track real-time planning method based on road structure weight fusion, which is suitable for intelligent track planning of an unmanned vehicle in an autonomous driving process. The technical scheme adopted by the invention comprises the following steps: 1. simplifying the calculation of a vehicle motion equation by a table lookup mode; 2. adopting a structured and unstructured environment weighting method based on breadth-first search; 3. conducting a dynamic target area decision; 4. adopting an improved A* path search algorithm fused with vehicle dynamics; and 5. conducting an incremental track planning of a dynamic scene. The unmanned vehicle track planning problems under various environments are unified by using a structured and unstructured environment weighting method; the continuity and the stability of the track are realized by utilizing the incremental track planning of a dynamic scene, and the running stability of the unmanned vehicleat low, medium and high speeds is ensured; and a vehicle motion equation and a collision detection process are simplified and approximated, the efficiency of a track planning algorithm is effectivelyenhanced by avoiding floating point operation, the track planning algorithm is enabled to achieve nearing real time, and the correctness of track planning is guaranteed.
Owner:TONGJI UNIV
Virtual network mapping method of elastic optical network facing SDN
ActiveCN106059799AOvercome the disadvantage of high blocking rateReduce blocking rateMultiplex system selection arrangementsData switching networksShort path algorithmResource consumption
The invention provides a virtual network mapping method of an elastic optical network facing an SDN, and mainly solves the problem in the elastic optical network facing the SDN that a network virtualization mode is utilized to realize flexible distribution and scheduling of network resources. The method specifically comprises the steps of: 1, obtaining underlying networking information; 2, receiving virtual network request information; 3, obtaining an alternative programmable physical node set; 4, mapping virtual network nodes; 5, judging whether all virtual node of the current virtual network have been mapped into a physical network; and 6, carrying out virtual network link mapping. According to the invention, the virtual node mapping method based on distance and comprehensive resource sensing, a breadth-first search method and an improved shortest path algorithm based on available space closest matching are utilized, the blocking probability of virtual network mapping is lowered, the bandwidth resource consumption of the physical network is reduced, and the future virtual network business bearing capability of the network is improved.
Owner:XIDIAN UNIV
Method and system for building binary decision diagrams efficiently in a structural network representation of a digital circuit
ActiveUS20060047680A1Digital data information retrievalData processing applicationsDepth-first searchDynamic resource
A method, system and computer program product for building decision diagrams efficiently in a structural network representation of a digital circuit using a dynamic resource constrained and interleaved depth-first-search and modified breadth-first-search schedule is disclosed. The method includes setting a first size limit for a first set of one or more m-ary decision representations describing a logic function and setting a second size limit for a second set of one or more m-ary decision representations describing a logic function. The first set of m-ary decision representations of the logic function is then built with one of the set of a depth-first technique or a breadth-first technique until the first size limit is reached, and a second set of m-ary decision representations of the logic function is built with the other technique until the second size limit is reached. In response to determining that a union of first set and the second set of m-ary decision representations do not describe the logic function, the first and second size limits are increased, and the steps of building the first and second set are repeated. In response to determining that the union of the first set of m-ary decision representations and the second set of m-ary decision representations describe the logic function, the union is reported.
Owner:GLOBALFOUNDRIES US INC
Adaptive 2n-ary tree generating method, and method and apparatus for encoding and decoding 3D volume data using it
ActiveUS20050195191A1Efficient codingImage codingCharacter and pattern recognitionImage resolutionData conversion
A method and apparatus for encoding and / or decoding depth image-based representation (DIBR) data are provided. The encoding method includes: converting 3-dimensional (3D) volume data into adjustable octree data with predetermined labels given to nodes; by referring to the labels, encoding nodes of the adjustable octree from the root node to leaf nodes by a modified breadth-first search (BFS) method allocating priorities among children nodes; and generating a bitstream with predetermined header information and encoded node data. The decoding method includes: extracting header information containing at least resolution information of an object, from a bitstream and decoding the header information; calculating the number of nodes by using the resolution information of the header, and by a modified BFS method allocating priorities among children nodes, decoding each node of a tree from the root node to leaf nodes; and restoring an adjustable tree by using decoded nodes. According to the method and apparatus, a huge amount of 3D volume data can be encoded with a high efficiency, and volume data with an arbitrary resolution as well as volume data with a fixed resolution can be encoded with a high efficiency. Accordingly, with a small amount of data, 3D volume data with a high picture quality can be restored. In addition, since a progressive bitstream is generated, 3D volume data can be shown progressively when decoding is performed.
Owner:SAMSUNG ELECTRONICS CO LTD
Content route managing method of fusion type content distribution network
ActiveCN104022911AReduce settlement costsImprove service qualityData switching networksContent distributionNode deployment
The invention provides a content route managing method of a fusion type content distribution network, belonging to the technical field of internet. The invention aims to provide a two-layered content node deployment mechanism aiming at ISP-CDN (Internet Service Provider-Content Distribution Network) and design an indexing and synchronization mechanism to improve a content route policy under a CDN environment; a flow settlement cost and data transmission quality are considered. The network data is singly processed, namely the flow cost consumed by primary transmission is only related with a passed route hop count and the size of the data is not considered; an inverse ratio relation is formed between the node quantity selected from a core route node set F and the repeated flow; a synchronous cost is in direct proportion to the node quantity; a synchronous initial source is an inter-domain router node; with regard to an inter-domain route node t, a breadth first search algorithm is used for generating k content nodes covered by a minimum spanning tree TR which takes the t as a root; the k notes are found and an RC+SC minimum is realized by adopting an algorithm based on a greedy strategy.
Owner:HARBIN INST OF TECH
Hybrid-detection-technology-based network topology discovery and automatic topology method and system
ActiveCN102546251AImprove real-time performanceShow simpleData switching networksNetwork onSimple Network Management Protocol
The invention discloses a topology automatic-discovery and breadth-first loop tree layout method based on a simple network management protocol (SNMP) and an Internet control message protocol (ICMP), and belongs to the field of network management and control. The method comprises the following steps of: performing SNMP polling to automatically discover connection relations among all the network equipment of a managed network and connection relations between the network equipment and sub-networks, and storing the connection relations into a database; discovering active hosts in all the sub-networks by using a ping tool in the ICMP, and storing the connection information of the active hosts into the database; and obtaining the loop topology of all the network equipment and the sub-networks in the managed network on the basis of a breadth-first search algorithm, wherein the active hosts in the sub-networks form Y connection with routers of the sub-networks. By the method, the connection relations among all the network equipment, the connection relations between the network equipment and the sub-networks and the active hosts in the sub-networks in the managed network are automatically discovered, and the topology of the managed network is hierarchically and visually displayed to a network manager.
Owner:TSINGHUA UNIV
Method for micro service of monolithic application
ActiveCN108279926ALow costReduce investmentCode refactoringProgram code adaptionCall graphSoftware engineering
The invention discloses a method for micro service of monolithic application. The method mainly comprises the steps of a call analysis stage, a module resolution stage and a framework adaptation stage, wherein a method call relationship among classes in application codes is obtained by analyzing byte codes in a package file, and thereby a call chain in the application is analyzed and a call graphis generated; for the call graph, all codes of which in-degree is zero are taken as entries, the entries are taken as starting points in turn to conduct breadth first search on a digraph to find all lower nodes, the starting point and the search result are taken as a to-be-split out micro service module together, according to the rule, an integrated item is divided into a plurality of independentmicro service modules, each module can be separately conducted with development and deployment, and the monolithic application also achieves quick micro service. The method for micro service of the monolithic application has the advantages that the input of the process for a monolithic framework to be converted into a micro service framework is reduced, the learning cost of the development is reduced, and the method can help the item be smoothly transferred into the micro service framework.
Owner:浙江网新恒天软件有限公司
Power distribution network islanding method based on harmonic algorithm
ActiveCN103971299AThe principle is simpleFew adjustable parametersData processing applicationsPower balancingPower Balance
The invention relates to a power distribution network islanding method based on a harmonic algorithm. Aiming for largest recovered load switching value and smallest motion switching value, and considering constraint conditions such as active power balance and non-overload of line current in an island, the power distribution network islanding method based on the harmonic algorithm provided by the invention carries out 0-1 encoding for each node in the power distribution network, obtains a specific islanding scheme in combination with a breadth-first search algorithm, calculates an objective function value of each island, adjusts, evaluates and updates the islanding scheme by utilizing the harmonic algorithm, then carries out trend inspection on the current optimal solution, and finally gives a better islanding scheme. The method for realizing full search of a solution space to solve the power distribution network islanding problem based on the harmonic algorithm provided by the invention can utilize individual local information and group global information guidance algorithm for further search, is simple in principle and few in adjustable parameters, and can obtain the optimal islanding scheme in a relatively short period of time when the islanding problem is solved.
Owner:HUNAN UNIV +2
Heuristic method for working out a plurality of shortest simple routes in network under multiple constraints
InactiveCN101753425AIncrease the number ofQuality improvementData switching networksRound complexityComputer science
The invention discloses a heuristic method for working out a plurality of shortest simple routes in network under multiple constraints. The method uses improved route control rules and predication of lower price limit after extending the routes to destination nodes, and abandon the routes which contain rings, break the constraints and exceed the cost of the k obtained shortest simple route. In the reserved routes, front k shortest simple routes meeting constrain conditions are searched in the breadth-first way and adjustable precision. The method has strong adaptability on network types, scales and change of constrain degrees, and the complexity of the method is approaching to the traditional breadth-first searching method. The heuristic method for working out a plurality of shortest simple routes in network under multiple constraints can shown excellent and stable performances on the aspects like route quantity, quality and capacity for discovering routes by setting the probing depth of middle ring of route and retracting coefficients of controlled decision.
Owner:BEIHANG UNIV
Efficient tracing of shorts in very large nets in hierarchical designs using breadth-first search with optimal pruning
InactiveUS6275974B1Effective trackingCAD circuit designSoftware simulation/interpretation/emulationTheoretical computer scienceHierarchical design
Tracing a short as a shortest path of explicit VLSI design component instances between two VLSI design component instances with different net names in a hierarchical design is a non-hierarchical problem. The method described in this document computes a shortest path of VLSI design leaf component instances containing at least one of the leaf design components causing the sort. To avoid exceeding available storage, the non-hierarchical instance information maintained during the process is pruned optimally. To achieve feasible performance, two methods to find "good" starting points are provided, based on geometrical distribution or based on connectivity information from the net build (if available).
Owner:IBM CORP
Virtual network mapping method and system based on cut set
The invention provides a virtual network mapping method and system based on a cut set. A breadth-first search tree is firstly built based on the network topology of a virtual network, the cut set of the virtual network is calculated, virtual nodes in the virtual network are mapped based on the breadth-first search tree, and after each virtual node is mapped, virtual links connected with the virtual nodes are mapped; when the virtual links are mapped, whether a cut set including the virtual links exits or not is firstly judged, the virtual links are mapped to the physical link with the minimum load if the cut set does not exist, whether other virtual links in the cut set except for the virtual links are mapped to physical links connected with the same physical node or not is judged if the cut set exists, and the virtual links are mapped to the physical link with the minimum load except for the physical links directly connected with the same physical node if the other virtual links in the cut set except for the virtual links are mapped to the physical links directly connected with the same physical node. The light reliable need of the virtual network is met, and the long-term even operating benefit of a physical network is improved.
Owner:BEIJING UNIV OF POSTS & TELECOMM
Complex three-dimensional building model simplification method capable of maintaining appearance characteristics
ActiveCN108961411AImprove simplified qualityReduce visual errorsGeometric CADSpecial data processing applicationsGeometric errorComputer science
The invention discloses a complex three-dimensional building model simplification method capable of maintaining appearance characteristics. The method includes the following steps that: (1) a model surface grid is divided into a plurality of sub-grids according to topological relations and color features and on the basis of a breadth-first search-based grid segmentation; (2) the geometrical simplification error calculation and texture simplification error calculation are integrated to calculate the simplification error of each edge of the model, and a simplification error formula comprehensively considers grid segmentation information as well as geometric error and texture error; and (3) with the half-edge collapse simplification of texture discontinuity features considered, edges with thesmallest error are selected from the grid so as to be subjected to half-edge collapse simplification, and after the simplification is performed, texture coordinate adjustment is carried out. After the above steps are completed, the simplification error of the adjacent edges is updated, and half-edge collapse is continued until a simplification rate reaches a set threshold. With the method adopted, geometry and texture can be effectively balanced, and a simplification result has good simplification quality and a great visual effect.
Owner:NANJING UNIV
Transmission line relay protection control service channel route configuration method and device
ActiveCN105553843ARouting configuration optimizationEmergency protective circuit arrangementsData switching networksTime delaysNetwork topology
The embodiment of the invention provides a transmission line relay protection control service channel route configuration method and device. The specific implementation way of the method comprises the following steps: according to information of an initial node and a terminal node in a received route configuration request, and network topology information, determining a plurality of routes between the initial node and the terminal node by adopting breadth-first search, and obtaining a first route set; determining a risk value corresponding to each route according to a node included in each route in the first route set and a risk value of each conserved node; recognizing routes that the corresponding risk values of the routes are smaller than a preset risk threshold and the born service quantity and the residual bandwidth meet a preset condition from the first route set, and acquiring a second route set; and recognizing routes of a preset first quantity threshold with smaller time delay values in the second route set, and taking the recognized routes as configured routes. By applying the embodiment of the invention, the route configuration of a relay protection service can be optimized.
Owner:STATE GRID JIBEI ELECTRIC POWER COMPANY +2
Datapath placement using tiered assignment
Datapath placement defines tiers for placement sets of a cell cluster, assigns cells to the tiers constrained by the datapath width, and then orders cells within each tier. Clusters are identified using machine-learning based datapath extraction. Datapath width is determined by computing a size of a bounding box for cells in the cluster. Placement sets are identified using a breadth-first search beginning with input cells for the cluster. Tiers are initially defined using logic depth assignment. A cell may be assigned to a tier by pulling the cell from the next higher tier to fill an empty location or by pushing an excess cell into the next higher tier. Cells are ordered within each tier using greedy cell assignment according to a wirelength cost function. The datapath placement can be part of an iterative process which applies spreading constraints to the cluster based on computed congestion information.
Owner:GLOBALFOUNDRIES US INC
Method for physically implementing special integrated circuit chip under deep sub-micron
The invention provides a method for physically implementing a special integrated circuit chip under deep sub-micron. The method mainly comprises the following steps of: 1) planning layout; 2) laying out; 3) generating a clock tree; 4) wiring; and 5) extracting parameters and analyzing a static time sequence: extracting a parasitic parameter of the layout by adopting a parasitic parameter extraction tool, analyzing the static time sequence, and searching a key path according to the Breadth first search principle. The method has been applied to the practical chip developing process, passed practical tests, and has good practical using effect.
Owner:杭州开鼎科技有限公司
System analyzer and method for analyzing an impact of a change in a component of a distributed control system
A system analyzer and a method for analyzing an impact of a change in a component of a distributed control system (DCS) are disclosed. The system can collect and store data representing the DCS components and their interconnection as well as signals of the DCS components. The DCS can be graphically modeled with nodes and directed edges, wherein a node represents either a type of DCS component or a signal of a DCS components, and wherein an edge is an “influence”-edge, or a “contains”-edge. Information on a change of a DCS components is received, a depth first or breadth first search is performed over the “influence”-edges and “contains”-edges and determine unchanged DCS components which would be affected by a malfunction, a removal or a taking out of operation of the at least one DCS component, and information on the affected DCS components is transmitted to an operator interface.
Owner:ABB (SCHWEIZ) AG
Robot path planning method and system based on skeleton extraction of passable area
ActiveCN110823241AMeet security needsImprove accuracyInstruments for road network navigationSimulationMap design
The invention provides a robot path planning method and system based on skeleton extraction of a passable area. The method comprises the following steps of constructing an environment grid map, and projecting an initial position of a robot, an obstacle and a target position into the grid map; determining the passable area of the robot in the grid map, and then performing skeleton extraction on thepassable area by using a Zhang-Suen algorithm; positioning a path start point and an end point to the grid map, designing an eight-neighborhood grid state of the grid map, so that a grid point wherethe path start point and the end point are located can be reserved as a skeleton point in a passable area refinement process; and using a breadth-first search algorithm to find a shortest connected skeleton connecting the path start point and the end point to obtain a shortest path that the robot can pass. A path trajectory obtained by the method is approximately in a middle position of the passable area, the safety requirement of the robot path planning can be better met, a skeleton extraction algorithm is improved, and a skeleton extraction result retains path start point and end point information.
Owner:山东同其智能科技有限公司
Method for converting ladder diagram into PLC (Programmable Logic Controller) program command
InactiveCN102354144AQuick searchAnalyzing the time complexity of the job is easyProgramme control in sequence/logic controllersRelation graphDepth-first search
The invention relates to a method for converting a ladder diagram into a PLC (Programmable Logic Controller) program command, which comprises the following steps of: 1, presenting a topological structure of a ladder diagram by using a directed graph; 2, traversing a transposed graph GL <T> by using a depth-first search method, storing a topological sorting relation of parallel-connection peaks and coil peaks in a queue Q; 3, carrying out breadth-first search on the parallel-connection peaks according to a connection relation of the directed graph GL, carrying out depth-first search on serial-connection peaks adjacently connected with the parallel-connection peaks, generating an AND expression of the directed graph GL on the whole serial-connection path and an OR expression of the serial-connection peaks; 4, generating a final expression of the maximum combining item of the parallel-connection peaks; 5, carrying out breadth-first search on a connection relation graph Gp by using the Q,figuring out an OR expression of the corresponding parallel-connection peaks and verifying, finally, constructing the maximum combining item into the AND expression to form a final result; 6, judgingwhether a queue Q' is empty; and 7, processing a starting peak. The invention can be widely applied to the process of converting the ladder diagram into the PLC program command.
Owner:BEIJING UNION UNIVERSITY
Who we serve
- R&D Engineer
- R&D Manager
- IP Professional
Why Patsnap Eureka
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Social media
Patsnap 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