140 results about "Path search" patented technology

This application discloses a path planning method, apparatus, medium, and product for an aircraft traction system in confined spaces, relating to the field of aircraft path planning technology. The method includes: establishing a kinematic model of the aircraft traction system located in a hangar; constructing a path planning mathematical model based on the kinematic model; employing an improved hybrid algorithm to perform path search on the aircraft traction system based on the path planning mathematical model to obtain the target path of the aircraft traction system; the improved hybrid algorithm is derived from a hybrid algorithm, and the improvements include: using RS curves for bidirectional node expansion; setting the cost function to include the cumulative historical cost from the starting node to the current node and the heuristic cost from the current node to the target node; and establishing a closed table distinguishing between forward and backward directions. This application realizes path planning for an aircraft traction system in confined spaces.

The application discloses a mine area ship route planning method and belongs to the field of ship route planning. The method comprises the following steps: establishing a physical field characteristic model of a ship; constructing a first risk field model containing a predicted position sequence and a fuse trigger rule for each proven mine; constructing a navigable grid map; performing global path search based on the physical field characteristic model and the first risk field model to minimize the comprehensive navigation cost, and generating an initial global route; detecting a newly appeared mine in real time during navigation, predicting a movement trajectory of the mine, and constructing a second risk field model containing a predicted position sequence and a fuse trigger rule of the mine; performing space-time correlation analysis on the initial global route and the second risk field model to mark a dangerous navigation section; and performing path re-planning to obtain a local avoidance path. The application realizes accurate evaluation and dynamic avoidance of navigation risks in a mine area, and improves the safety and task completion capability of a ship during navigation in a mine area.

This invention discloses an event prediction method and apparatus based on subgraph segmentation and entity relationship model. It transforms an academic knowledge graph into a sequence of temporal historical subgraphs. Segmentation operations determine the segmentation points of the temporal historical subgraph sequence and the number of segments corresponding to different times. The number of continuous segments is also determined. A DQN network is used to perform secondary path search through target operations to obtain the final search path. The entity in the last node is the object to be predicted. This invention achieves this by segmenting the temporal historical subgraph sequence to give the input data a focus, enabling better selection of answer nodes. Secondly, the use of a DQN network better considers the intrinsic connections between entities and relationships. Finally, the global nature of convolutional neural networks captures the global features of the search path, significantly improving prediction accuracy.

The application discloses a path planning method, system, device and medium based on an improved A-star algorithm, relates to the technical field of path planning, and solves the technical problems of poor path planning safety and low efficiency in a warehouse robot system. Technical solution points estimate the area openness degree through a cost function based on obstacle density, so that the planned path is more inclined to the open area. The node expansion is performed through the optimized node expansion strategy, the nodes adjacent to the current node up and down or left and right are preferentially processed, the expansion of internal obstacle nodes is skipped, the number of expanded nodes is greatly reduced, and the nodes that may cause path collision or insecurity are effectively excluded to avoid meaningless path search. The final expanded node array is subjected to path optimization through a bidirectional path preprocessing optimization algorithm, so that the path is more concise and smooth, and the overall time consumption is reduced.

The application relates to the technical field of robot path planning, and discloses a building logistics robot carrying path optimization method and system based on obstacle avoidance, which comprises the following steps: acquiring an environment point cloud to construct a three-dimensional physical attribute grid map containing flatness and friction coefficient; extracting an unknown obstacle bounding box and performing cross-stage matching with a model database to grade a completed building in advance and extract construction process attributes; using an exponential decay formula to radiate outward to correct surrounding grid physical parameters and generate an environment degradation gradient; combining the current total mass and speed of the robot to calculate a maximum safe curvature limit value, cutting off branches exceeding the limit value in path searching to generate a local detour path; reporting the path to the cloud after the vehicle passes, and calculating a safe relaxation degree according to the wheelbase and total mass of the subsequent vehicle to determine whether to issue a detour template. The application solves the problems of obstacle avoidance deadlock caused by construction progress and robot side slip out of control, and reduces the total computing power consumption of multi-machine cooperation.

The present application belongs to the technical field of grinding processing, and discloses a control method of a point cloud polishing remote control system based on a sliding mode and adaptive control. The control method comprises the following steps: S1, establishing a dynamic equation of the remote control system to obtain control equations of a master robot and a slave robot; S2, performing point cloud scanning on a weld to be polished to obtain corresponding point cloud data, calculating the depth gradient, dexterity and stiffness of each point in the point cloud data, setting a starting point and an ending point of polishing, and planning an optimal polishing path; and S3, inputting the control equations obtained in step S1 and the optimal polishing path obtained in step S2 into a controller to control the slave robot to polish. Through the present application, the accuracy of the control algorithm and the optimization of the point cloud path search are combined, and the efficiency of remote operation control under polishing conditions is improved.

This invention discloses an intelligent traffic prediction and scheduling method based on user behavior data, comprising: acquiring the user's actual driving trajectory and matching it to a digital road network; extracting expert trajectory data containing state-action sequences and contextual features; constructing a generative adversarial learning model and using the expert trajectory data for adversarial training, wherein the generator learns to imitate the user's driving behavior, and the discriminator learns to distinguish between the real user trajectory and the trajectory simulated by the generator; using the output of the discriminator after training convergence, assigning a personalized cost value of the user's subjective preference to each state-action pair in the digital road network; based on the constructed personalized cost network, using the A* path search algorithm to plan an optimal personalized driving route for the user; this invention, through inverse reinforcement learning, can automatically learn the user's inherent preferences from the user's behavior, and the planned route is more in line with the user's true intention, improving user satisfaction and system adoption rate.

The application discloses a wafer crack detection method and device, electronic equipment and storage medium, and belongs to the technical field of crack detection. The wafer crack detection method comprises the following steps: obtaining a difference image by comparing and analyzing a to-be-detected wafer image and a standard wafer image; constructing a plurality of sub-images in the difference image based on a dynamic programming method; performing path searching on each sub-image to obtain a sub-path; merging the sub-paths to obtain a first crack path; and obtaining a crack based on the first crack path. The method obtains a difference image by comparing and analyzing a to-be-detected wafer image and a standard wafer image, and then adopts a dynamic programming method to split the crack detection of the difference image into the crack detection of a plurality of sub-images, so that the difficulty of crack detection is reduced, and the accuracy of crack detection is improved.

This application relates to a library self-service navigation method, device, equipment, and medium. The method includes: acquiring multi-source heterogeneous data from the library, and performing data cleaning and structuring processing on the multi-source heterogeneous data to obtain structured multi-source data; extracting spatial features and performing semantic association analysis on the structured multi-source data to obtain environmental feature data; constructing topological relationships and assigning weights to the environmental feature data to construct a navigation topology map; based on user-input navigation request data, performing optimal path search under multiple constraints within the navigation topology map to obtain initial navigation path data; and segmenting the initial navigation path data and generating turning instructions to obtain the path navigation result. This method enables end-to-end coherent navigation from resource semantics to spatial paths, effectively improving the intelligence level and user experience of library self-service navigation.

This invention relates to the field of path planning technology and provides a path planning method based on a multi-cooperative particle swarm optimization algorithm. This method constructs a multi-cooperative particle swarm structure with a main population and auxiliary populations evolving in tandem, and introduces a dual-center guidance mechanism to achieve a dynamic balance between global exploration and local fine-tuning during UAV path search. Furthermore, a closed-loop adaptive parameter control mechanism is constructed, enabling key particle swarm parameters to adaptively adjust with changes in the search state, avoiding premature convergence and improving search stability. Simultaneously, through a diversity-driven population information exchange control method, the ability of the particle swarm to escape local optimal path solutions is enhanced, achieving stable and high-quality planning of UAV flight paths. This invention effectively improves the autonomous path planning performance and engineering applicability of UAVs in complex 3D environments.

This invention relates to the field of navigation assistance technology, and in particular to a dynamic obstacle prediction and obstacle avoidance path planning method based on multi-sensor fusion. This invention achieves comprehensive perception of dynamic obstacles through multiple sensors, providing a rich and reliable data foundation for subsequent processing. At the same time, it predicts the motion of dynamic obstacles through data processing fusion and model prediction, fully considering the motion inertia of obstacles to make their trajectory prediction closer to real physical laws. Furthermore, by "delineating the final obstacle avoidance target area", the global path search problem is transformed into a local but sufficiently large spatial search problem, significantly reducing the number of grids to be processed and the amount of search computation, meeting the stringent real-time requirements of mobile devices. Moreover, by constructing a cost function, it avoids areas that obstacles may occupy in the future in real time, thereby generating an obstacle avoidance planning path, which helps to improve path safety.

This invention discloses a mountain path planning method based on an improved A* algorithm, comprising: acquiring lidar or image data of the target area using a UAV and generating point cloud data to construct a digital elevation model containing elevation and slope information; subsequently, performing coordinate unification, noise reduction, and downsampling processing on the point cloud data, and combining the start and end points for region clipping and rasterization to construct a local raster map; employing the improved A* algorithm during path search, introducing a slope correction mechanism and an equivalent distance cost model, comprehensively incorporating distance, slope, and elevation factors into the path cost function, and dynamically adjusting the path cost based on the slope influence coefficient, while simultaneously constraining high-slope and impassable areas. This method can effectively reduce the search space and computational complexity, improve the efficiency and accuracy of path planning in complex mountainous environments, and is applicable to scenarios such as power transmission line planning and mountain engineering path design.

This invention discloses an unstructured road path planning method based on the JPS algorithm and gradient descent, comprising the following steps: Step 1: Initialize map information and path node information; Step 2: Obtain a series of collision-free control nodes from the starting point to the target point, and obtain the angle between the path formed by the connecting lines of the nodes and the map x-axis; Step 3: Add auxiliary control points to the control nodes and perform path curve fitting; Step 4: Optimize the path curve to obtain the optimal path. This invention solves the problems of low path search efficiency and non-optimal generated trajectories in existing path planning methods.

This invention discloses a method for constructing a database for the survey of traditional Chinese medicine (TCM) cultural resources based on knowledge graphs, belonging to the field of database construction technology. Specifically, it includes: collecting classical texts and field survey texts; extracting core entity terms using sequence labeling technology; establishing an ontology model including lineage and medicinal material origin dimensions to form a knowledge architecture for the TCM field; extracting entities and events from the text using neural networks, aligning entities to ontology nodes according to the domain knowledge architecture, and generating a basic TCM resource graph; calculating feature vectors of graph nodes, using inference algorithms to mine implicit connections between origin changes and treatment customs, and completing missing semantic edges in the graph; performing multiple path searches for resource nodes, aggregating their associated nodes in the lineage and regional dimensions, and generating a subgraph containing spatiotemporal evolution trajectories; and converting the generated subgraph into topological data to complete the construction of a network survey database.

This invention discloses an indoor wireless signal coverage prediction method based on Monte Carlo integration. A transmitting antenna and receiver are deployed within an indoor scene. The geometric model of the indoor scene and the attribute parameters of the transmitting antenna are acquired and input into a computer to build a simulation model. Rays are generated to describe electromagnetic wave propagation for simulation. Through multiple iterative processing, an indoor wireless signal coverage map is predicted. This process is repeated, applying random rotations for multiple simulations, and the final indoor wireless signal coverage prediction result is obtained by combining the results. This invention avoids performing path search and field strength calculation for each receiver point individually, significantly improving computational efficiency. It also avoids the exponential growth problem of ray number caused by ray splitting in traditional ray tracing, thus significantly reducing memory usage and improving computational efficiency. This enhances the stability and accuracy of signal coverage prediction, enabling rapid acquisition of signal coverage information in complex indoor scenes while maintaining prediction accuracy.

This invention discloses a personalized learning path recommendation method based on learner profiles, comprising the following steps: S1, acquiring learner's historical learning behavior data; S2, extracting behavioral features using Field-Silverman learning style theory; S3, identifying keywords using a Bert-BiLSTM-CRF model and constructing an association matrix between exercises and knowledge points; S4, statistically analyzing the answers to exercises corresponding to each knowledge point and calculating the accuracy rate; S5, constructing an educational knowledge graph; S6, performing entity alignment and fusion on the knowledge graph; S7, setting a path evaluation function, selecting multiple path features and configuring corresponding weights; S8, using the mastered knowledge points as the starting point and the weak knowledge points as the ending point, performing path search using an ant colony algorithm; S9, scoring the candidate paths according to the path evaluation function. This invention combines learning behavior modeling and profile generation, natural language processing and keyword recognition, and heuristic search optimization techniques to achieve personalized learning path recommendation based on learner profiles.

The application discloses a new energy battery pouring anti-collision control method and system, and relates to the technical field of new energy battery manufacturing automation. The method uses an eye-in-hand vision system installed at the end of the Z-axis to fit a dynamic reference plane to eliminate assembly tolerance. In the path search stage, the application constructs an asymmetric weight matrix based on adaptive adjustment of the dynamic viscosity of glue, and forcibly locks the Z-axis height. At the same time, fluid dynamics pre-check is introduced, the instantaneous angular velocity of the bottom interpolator is extracted, the preset glue rheology database is combined, the lateral spreading amount of the centrifugal force on the glue width is calculated in real time, and the planning speed is automatically limited. When local deadlock triggers obstacle avoidance lifting, the millisecond glue breaking-displacement-glue connecting timing containing negative pressure back absorption and advance pressure building is strictly executed. Through multi-dimensional fluid-motion coupling solution, the application effectively solves the glue throwing distortion caused by high-speed obstacle avoidance in the complex battery pack and the glue breaking and wire drawing problem when obstacles are crossed, and ensures the high consistency of the pouring process.

The application provides a multi-target path collaborative optimization method based on space-time feature enhancement and graph neural network guidance, comprising the following steps: step 1, constructing a basic data system supporting path optimization; step 2, generating a node embedding vector capable of guiding path search; step 3, reconstructing the relevance of the distribution task in the feature space, and generating a high-quality initial solution set through heuristic guidance; step 4, realizing fine iteration of the distribution scheme through an improved genetic operator; and step 5, establishing a fast lookup table mechanism based on time axis discretization preprocessing and state recursion. The method effectively improves the real adaptability and algorithm optimization accuracy of the path planning scheme, realizes the collaborative optimization of distribution efficiency and driving safety, greatly reduces the calculation complexity in the dynamic scene, can generate a Pareto optimal solution considering multi-target requirements, meets the real-time scheduling and decision-making requirements of complex urban distribution scenes, and has good engineering application value.

This invention relates to the field of voice interaction technology, and more particularly to a voice dialogue system based on a large model, comprising: a feature extraction module for acquiring samples containing multi-turn dialogue information and extracting multi-dimensional features; an alignment and processing module for achieving fine alignment through cross-modal alignment matrices and path search, and calculating a contextual consistency score based on role transition states; a stability calculation module for determining sample stability scores based on a teacher-student model mechanism; an anomaly assessment module for constructing a sample nearest neighbor graph based on semantic embedding vectors, calculating structural anomaly scores and sample retention values, and rescuing correctable samples by supplementing with nearest neighbor information; and a training module for selecting voice dialogue training samples according to sample retention values ​​and training the model. This invention provides high-quality samples for model training through a multi-dimensional quality assessment and data filtering mechanism, improving the accuracy and fluency of voice dialogue.

The present application belongs to the technical field of image data processing, and particularly relates to a brake pad surface damage detection method and system based on machine vision, which comprises the following steps: acquiring an image of the brake pad surface and calculating the gradient vector of each pixel point; constructing a gradient interaction field based on the strength of the gradient amplitude and the gradient direction angle to obtain the structural saliency of each pixel point; performing path search along the local principal direction, accumulating the structural saliency and direction consistency weight of the pixel points on the path to obtain the linear propagation potential of each pixel point; and performing adaptive threshold segmentation and morphological processing based on the linear propagation potential map to realize accurate detection of the damage area on the brake pad surface. The present application solves the technical problems of strong noise interference on the brake pad surface and difficulty in detecting the intermittent characteristics of small cracks, and improves the robustness and accuracy of damage detection.

The application relates to the technical field of network security and discloses an attack surface management method based on multi-source intelligence fusion, which comprises the following steps: collecting original data through a dynamic asset fingerprint library construction module and generating asset portrait data by using a machine learning algorithm; mapping the asset portrait data into a graph database node and an edge through an attack path simulation engine, executing a graph path search algorithm, outputting an attack path simulation result and a business influence score; executing a repair suggestion instruction through an automatic repair verification module, sending a re-simulation request to the attack path simulation engine, and verifying whether the attack path is blocked according to a secondary simulation result. The application can realize real-time discovery of dynamic assets and supply chain risks, accurate quantification of attack path influence by using a graph database, effective cutting of attack paths by repair measures and non-introduction of new risks through a secondary simulation and an abnormality detection mechanism, and dynamic and accurate closed-loop management of attack surface risks.

The application discloses an indoor distribution cable path intelligent generation method combined with building environment characteristics, and comprises the following steps: constructing a semantic grid map capable of distinguishing different building function areas by performing layer identification, semantic annotation and space discretization on an input building plan design map; based on the semantic grid map, different basic passing generation values are given to different types of areas, and a dynamic engineering constraint function comprising a corner turning penalty and a wall sticking reward rule is defined; path search of an improved A* algorithm is performed, in an engineering constraint cost field fused with the basic passing generation value and the dynamic engineering constraint function, a heuristic search algorithm with a dynamic penalty term is used to calculate and generate a candidate cable path meeting engineering specifications; virtual convergence points are determined through node clustering, the path search algorithm is applied hierarchically, a backbone path limited in a public area is generated, branch paths entering rooms are generated, and a complete indoor distribution system cable path topology is generated by merging.

This invention discloses a navigation system based on an intelligent bicycle, belonging to the field of navigation technology. It addresses the problems of path planning and safety control under dynamic road conditions. The system first constructs a digital situational awareness model of the vehicle by synchronously acquiring data from a multi-dimensional motion sensor group and wheel speed pulse sequences to calculate real-time attitude angles, speed decay, and lateral sway amplitude. A road condition analysis module uses computer vision algorithms to reconstruct a three-dimensional digital model of the road surface, identifying height abrupt changes and determining obstacle crossing costs. A cost fusion module uses a multi-modal data fusion algorithm to map vehicle condition parameters into energy factors and generates a navigation cost chain that has undergone local smoothing. A path generation module performs path search based on this cost chain and outputs the optimal steering command. This invention achieves a deep mapping between the physical driving environment and the digital cost space, significantly improving navigation accuracy under complex dynamic road conditions.

The application discloses a data path identification method and device and electronic equipment. First, data packet information is acquired, and then the data packet information is standardized to obtain standardized data. The standardized data and a preset hybrid model are used for processing in a privacy protection feature space to obtain abnormality discrimination information. The adaptive threshold strategy is used for detecting the abnormality discrimination information to obtain a first detection result. The first detection result is identified based on a subspace to obtain position information. The position information is processed based on a path search algorithm to obtain a first path. The first path is processed, so that micro data transmission abnormalities can be captured in real time, and the demand for rapid response in a high-speed network environment can be met.

The embodiment of the invention provides a path searching method and device, and can solve the technical problem that the related technology cannot meet the path searching requirement in a complex network environment. The method comprises the steps of obtaining at least one search node based on search parameters corresponding to a path search request; forming a search path based on the search parameters and the at least one search node; generating a path comprehensive weight of the search path according to an adjacent node and a corresponding edge attribute of each search node in any search path; and under the condition that the search path meets the search path generation condition, in response to the condition that the path comprehensive weight meets a weight threshold value, determining a target path. According to the method, multiple path attributes are comprehensively considered in the path searching process, self-definition and dynamic adjustment of weights are supported, path selection can be flexibly adapted according to actual service requirements, threshold setting and efficient pruning operation are achieved, and the technical problems that an existing path searching strategy is single, weight configuration is rigid, and complex constraint scenes are difficult to adapt are solved.

This invention discloses a knowledge graph completion method and system based on path-structure fusion, relating to the field of data storage technology. The method includes: at the data preprocessing level, a path filtering strategy based on PMI (Progressive Mindset Analysis) is used to accurately eliminate redundant and noisy paths by quantifying the co-occurrence correlation between entities, providing high-quality semantic context for subsequent inference. Secondly, during path modeling, the Mamba state-space model is used for path sequence modeling, and multi-level attention is used to aggregate path information. Thirdly, at the decoding and scoring level, a dual-tower architecture of path-structure is constructed, adaptively fusing and scoring global path semantic features with local graph topological features. Finally, through a mechanism of attribute completion—similar node determination—bidirectional path search, high-scoring interpretable paths are automatically mined from known entities and their similar nodes, and a hybrid scoring formula is used for comprehensive evaluation, ultimately outputting the inference link.

This invention relates to the field of geological exploration technology. It discloses a method, apparatus, equipment, and storage medium for geological exploration path planning. The method includes acquiring basic data of the area to be explored and extracting topological features from the basic data to obtain a regional topology map; performing constraint analysis based on the regional topology map to obtain a constraint quantification lookup table; constructing a node connectivity network based on the constraint quantification lookup table; using the node connectivity network as a search vehicle, performing a multi-objective path search for the exploration target to obtain a set of multi-objective candidate paths; resolving conflicts in the multi-objective candidate path set to obtain a set of compliant paths; scoring all paths in the compliant path set based on preset evaluation criteria, and determining the path with the highest score as the optimal geological exploration path. This invention performs path planning based on regional topology analysis and constraint quantification, generating an optimal geological exploration path that balances target coverage integrity and path compliance.