Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

229 results about "Random tree" patented technology

Robot path planning method based on parallel sampling point optimization RRT algorithm

The invention discloses a robot path planning method based on a parallel sampling point optimization RRT algorithm. The robot path planning method mainly aims at the problems that the RRT algorithm is low in random tree search efficiency, the path is zigzag and discontinuous, and the algorithm adaptability to different environments is low. The method comprises the following steps: firstly, randomly sampling a plurality of nodes by adopting a multipoint parallel weighted heuristic sampling strategy, establishing an evaluation function introducing a distance factor and a corner factor, and selecting an optimal sampling node for expansion; a dual-tree guiding mechanism is constructed, information of newly-generated nodes is fully utilized, invalid sampling of a local space is reduced, and rapid fusion of the two trees is achieved; determining an extension step length according to the surrounding environment information of the node to obtain a collision-free path with low cost from a starting point to a target point; and then global and local rewiring optimization is performed on the initial path, a B spline curve is introduced for fitting smoothing, and finally an optimized path satisfying robot curvature constraint is generated. According to the method, the planning efficiency and the path quality can be improved, and the method has relatively high stability and robustness for different environments.
Owner:ANHUI NORMAL UNIV

Human skill based path generation

A method for robot path planning using skills extracted from human-taught motion programs applied to a new obstacle environment. A three-dimensional convolutional neural network is used to extract features characterizing an obstacle environment, where the feature vector representation of the obstacles overcomes problems encountered when using point cloud obstacle data. The obstacle feature data and robot path start and goal points are provided to an encoder / decoder neural network system which is trained to extract skills from a database of human-generated motion programs. The encoder / decoder neural network system produces a distribution of waypoints for the current obstacle environment and start / goal points. The distribution of waypoints is used to perform a final collision-free path generation using either a rapidly-exploring random tree (RRT) technique or an optimization-based technique.
Owner:FANUC LTD

Track generation method and device for deburring of casting blank and medium

The invention discloses a track generation method and device for casting blank deburring and a medium, and relates to the technical field of grinding process.The track generation method mainly comprises the steps that according to FPFH feature descriptors of respective outer contours of an actual point cloud model and a standard point cloud model, key points matched with the standard point cloud model are searched through a KD tree, and the FPFH feature descriptors of the outer contours of the actual point cloud model and the standard point cloud model are obtained; performing multi-contour segmentation division of the actual point cloud model according to the distance between the key points; receiving polishing parameters input by the user based on the segmentation division results of the contours, and generating an initial track according to the polishing parameters; smoothing discrete trajectory points of the initial trajectory through B-spline interpolation, and generating a local obstacle avoidance path in combination with an industrial robot kinematics model and a fast expansion random tree star algorithm; outputting the final polishing track to a control terminal, and adjusting the track depth in real time according to the feedback of the force sensor. According to the method, regional differentiation track generation is supported, and the process adaptability and the personalized demand response capability of a complex contour are improved.
Owner:ZHEJIANG YIMU INTELLIGENT TECH CO LTD

Robot path planning method based on RRT improved algorithm

The invention belongs to the technical field of path planning, and particularly relates to a robot path planning method based on an RRT improved algorithm, and the method comprises the steps: obtaining environment space information needing path planning, defining parameters, and obtaining the minimum distance between a coordinate point and an obstacle; a bidirectional random tree is constructed and initialized, and sampling points are obtained through a sampling function; finding a nearest neighbor point, selecting a new node, carrying out safety distance judgment, and if not, carrying out sampling again; generating a discretization path; setting a cost function during local node expansion; performing loop iteration to generate discrete point cost, taking a minimum cost value, searching an optimal node and inserting the optimal node into the current tree; an overall path Path after local optimization is obtained; and discretizing the whole Path, setting a cost function of nodes during global planning, selecting the node with the minimum cost for reconnection, and finally obtaining a smooth and effective optimal path. According to the method, the optimality and smoothness of the path are effectively improved.
Owner:SHANDONG INST OF BUSINESS & TECH

Mechanical arm obstacle avoidance path planning method based on improved RRT-Connect algorithm, smearing mechanical arm and masonry robot

The invention discloses a mechanical arm obstacle avoidance path planning method based on an improved RRT-Connect algorithm, a smearing mechanical arm and a masonry robot. The mechanical arm obstacle avoidance path planning method comprises the steps that firstly, a fixed sampling function is adopted in a three-dimensional space formed by a starting point Xinit and a target point Xgoal of a path to generate a fixed point; and respectively and simultaneously constructing four random trees between the starting point and the fixed point and between the fixed point and the target point to carry out path search, and generating a path from the starting point to the target point. A target guiding sampling method based on a heuristic function can be introduced into the algorithm of the four-random-tree collaborative path searching mechanism, and the sampling probability is adjusted; and a better path planning effect is achieved by setting a self-adaptive step length strategy, a greedy strategy and other technical means. According to the method, the path planning of the mechanical arm is realized by setting the fixed sampling points to perform the four-way RRT-Connect algorithm, so that the rapid planning is ensured, the path time consumption is reduced, the collision with an obstacle is avoided, and the robustness of the path is enhanced.
Owner:MCC5 GROUP SHANGHAI CORPORATION LIMITED +2

Robot path planning method based on K-value adaptive multi-algorithm cooperation

The invention provides a robot intelligent path planning method based on K-value adaptive multi-algorithm cooperation, and belongs to the field of robot path planning. The robot path planning method mainly comprises the following steps: preprocessing an environment map, and constructing a three-layer data structure of a quadtree, a Voronoi graph and a connected graph; generating an initial path based on an improved fast extension random tree algorithm, and extracting key points; establishing a K value evaluation system including five dimensions of obstacle density, local complexity, channel characteristics, path curvature and topology complexity, and realizing accurate quantification of the environment; carrying out adaptive region division based on the K value, and dividing the environment into an open region, a narrow channel region and an obstacle dense region; aiming at the characteristics of different regions, an improved bidirectional A algorithm and an improved fast expansion random tree algorithm are respectively adopted to carry out collaborative planning; and finally, smoothing the path through a Bezier curve. According to the method, the quality and the planning efficiency of path planning in a complex environment can be improved, and higher robustness is achieved.
Owner:UNIV OF ELECTRONICS SCI & TECH OF CHINA

Mechanical arm obstacle avoidance path planning method based on improved bidirectional RRT* algorithm

The invention discloses a mechanical arm obstacle avoidance path planning method based on an improved bidirectional RRT * algorithm, and the method comprises the steps: firstly obtaining parameter information needed by path planning, constructing a starting tree and a target tree, determining an initial search step size according to environment information, then carrying out the target bias sampling, and obtaining a random tree sampling point; finding a node closest to a sampling point on the random tree and pixelating a surrounding space of the node; calculating a dynamic extension step length; growing from the closest node to the sampling point of the random tree according to the dynamic extension step length to obtain a new node; carrying out collision detection; and applying a bidirectional end enhancement mechanism to obtain an initial path, finally optimizing a path turning position based on a path optimization method guided by a rotation vector, and outputting a final optimized path. According to the method, the path length can be remarkably shortened, the path quality can be remarkably improved, and the method is simple, easy to implement and suitable for mechanical arm path planning in the complex environment.
Owner:SOUTHWEST JIAOTONG UNIV

Ship route planning method

PendingCN119268693AOvercome the shortcomings of blind expansionhigh speedNavigational calculation instrumentsICT adaptationShip routingSimulation
The invention relates to a ship route planning method, and belongs to the technical field of path planning, and the method comprises the steps: S101, obtaining ship navigation starting point, terminal point and navigation sea area information, and constructing a random tree based on the starting point, the navigation sea area information comprising navigable sea areas, non-navigable sea areas and wind field information; s102, selecting a sampling point from the navigation sea area information, and selecting an adjacent point closest to the sampling point from the random tree; s103, calculating resultant force of the end point, the sampling point, the unnavigable sea area and the wind field to the adjacent points, and expanding the random tree to generate new nodes based on the direction of the resultant force; and S104, judging whether the distance between the new node and the terminal point is smaller than a threshold value or not, if so, outputting an optimal route, and if not, returning to S102. By introducing the artificial potential field method, the expansion direction of the random tree is adjusted and controlled in real time, and the convergence speed of the algorithm and the quality of the optimal solution are improved.
Owner:WUHAN UNIV OF TECH

Self-adaptive step length RRT path planning method based on collision detection

The invention relates to a self-adaptive step length RRT (Rapidly-expansion Random Tree, RRT) path planning method based on collision detection, and belongs to the field of robot path planning. The method comprises the following steps: firstly, initializing a system, namely initializing map information, determining a robot obstacle space and a non-obstacle space, determining position coordinates of a path initial point and a target point, a cardinal number of each connection step length, a distance target point threshold value and the like; then, path planning is carried out by using an improved RRT algorithm, including sampling in a non-obstacle space, optimization of random sampling points in combination with a target bias strategy and an APF algorithm, and expansion in a random tree expansion direction according to a dynamic step length strategy; then, judging whether the new node is smaller than a threshold value, if so, finding a path, otherwise, jumping to the sampling step; and finally, after the path is found, the path length is shortened by using a path pruning strategy, the final path is smoothed, and the path is output. Compared with a traditional RRT algorithm, the improved RRT algorithm has the advantages that the path searching speed is increased, redundant nodes are eliminated, and the path quality is improved.
Owner:KUNMING UNIV OF SCI & TECH

Unmanned aerial vehicle cruise detection method and device, electronic equipment and storage medium

The invention is suitable for the technical field of unmanned aerial vehicles, and provides an unmanned aerial vehicle cruise detection method and device, electronic equipment and a storage medium, and the method comprises the steps: carrying out the global path planning through employing an improved fast extension random tree algorithm; when a conflict risk is detected, a dynamic reward function is designed with returning to a global flight path after obstacle avoidance as a target, and a deep reinforcement learning model is adopted to realize control of actions of the unmanned aerial vehicle; and controlling the unmanned aerial vehicle to fly along the global aircraft path and the local obstacle avoidance path, and executing a target detection task based on the target detection model in the flight process until the task is completed and / or a target position is reached. According to the invention, global path planning is carried out by adopting the improved fast extended random tree algorithm, a local obstacle avoidance path is obtained in combination with the deep reinforcement learning model when facing an emergent obstacle, the autonomous cruising ability of the unmanned aerial vehicle is improved, real-time target detection is realized based on the target detection model in the flight process, and the task execution efficiency of the unmanned aerial vehicle is improved.
Owner:SHENZHEN UNIV

Bidirectional tree random search method based on complex environment node cost function

The invention relates to the technical field of unmanned aerial vehicle trajectory planning, in particular to a bidirectional tree random search method based on a complex environment node cost function, which comprises the steps of surveying obstacle data in a flight area and modeling, then introducing a target deviation strategy and a bidirectional search tree mechanism, and combining with an improved minimum cost method to obtain a random search result. Alternately expanding the two trees to generate an initial path, and integrating the path length, the obstacle distance and the flight height energy consumption by a cost function; and finally, pruning the initial path, removing redundant nodes, smoothing the trajectory by adopting a cubic spline interpolation method, ensuring curvature continuity, and generating an optimal path meeting the flight performance of the unmanned aerial vehicle. According to the invention, through an improved bidirectional minimum cost fast expansion random tree algorithm, dynamic association of obstacle constraint, target deviation and path cost in unmanned aerial vehicle path planning in a complex environment is represented, and a more efficient search convergence speed and better path quality are obtained. And rapid convergence and global optimization of the track of the unmanned aerial vehicle in a high-dynamic environment are realized.
Owner:YANGTZE DELTA REGION INST OF UNIV OF ELECTRONICS SCI & TECH OF CHINE (HUZHOU) +1

Adaptive step length Combine-RRT* path planning method

The invention relates to an adaptive step length Combine-RRT * path planning method, which belongs to the technical field of robot path planning, and comprises the following steps: modeling and binarizing according to an obstacle map, determining a starting point and a target point, and setting initial parameters; initializing a random tree according to the obstacle map; determining a normal distribution sampling process and parameters; a sampling strategy of a sampling process is selected by using a dynamic greedy factor for sampling to generate sampling points; determining a dynamic expansion step length during node expansion by using a variable step length growth strategy, and generating a new expansion node; performing collision detection, updating the tree atlas, and outputting an initial path; determining an elliptical sampling range; using a dynamic greedy factor to select elliptical region sampling or normal distribution sampling to generate sampling points; re-searching father nodes and re-connecting in a specified range of the new extended nodes, and searching a path with the minimum cost; and a B spline curve rear end optimization path is introduced.
Owner:CHONGQING UNIV

Improved robot path planning method based on RRT algorithm

The invention relates to the technical field of robot path planning, and discloses an improved robot path planning method based on an RRT algorithm, and the method comprises the steps: carrying out the global path searching through an improved fast exploration random tree (RRT) algorithm, and employing a special random sampling strategy and a KD-Tree to accelerate the nearest neighbor searching, and improving the searching efficiency; a greedy strategy is utilized to optimize a path, and redundant nodes are reduced; a smooth trajectory is generated by means of cubic spline interpolation, and control points are dynamically adjusted through collision detection. The method effectively solves the problems of path redundancy and poor smoothness of a traditional RRT algorithm, is suitable for the fields of robot navigation, logistics transportation and the like, and can remarkably improve the path planning efficiency and quality.
Owner:GUANGDONG ENG POLYTECHNIC COLLEGE

Insulator temperature monitoring method and system

The present invention relates to the field of data processing technology, and more specifically, to an insulator temperature monitoring method and system, the method comprising: constructing multiple random trees of a temperature data sequence, determining the numerical similarity between the current temperature data and any node in any random tree according to the numerical difference and the change rate difference between the current temperature data and the node, calculating the density similarity between the current temperature data and the node, calculating the final similarity between the current temperature data and the node according to the data similarity and the density similarity, using the final similarity between the current temperature data and each node in each random tree, screening random trees that meet preset conditions, performing abnormal detection on the current temperature data according to the screened random trees, and monitoring the temperature of the insulator according to the detection results. The present invention can improve the accuracy of abnormal detection of the temperature data of the insulator, so as to accurately monitor the state of the insulator.
Owner:BAODING JIKAI POWER EQUIP

Mechanical arm path planning method and system based on environmental parameter self-adaptive adjustment

The invention relates to the technical field of path planning, in particular to a mechanical arm path planning method and system based on environment parameter self-adaptive adjustment, and the method comprises the steps: taking the tail end position of a mechanical arm as a starting node, taking the position of a target object as a target node to construct a random tree, and setting a search radius to dynamically obtain obstacle data; the step length is dynamically adjusted according to obstacle data, an adaptive sampling strategy is introduced, and an initial path is generated by selecting an optimal father node and reconnecting peripheral nodes; smoothing the initial path, adjusting an offset point, optimizing a target node search area and constraining a path direction included angle to obtain a final path; and the path node coordinates are converted into mechanical arm physical coordinate system coordinates, and a mechanical arm is driven to execute an obstacle avoidance grabbing task. According to the method, the path planning efficiency is remarkably improved, the planning time is shortened, the path quality is optimized, and the safety and stability in a complex environment are enhanced.
Owner:SHANXI SHICHENG SHENGXIANG TECHNOLOGY CO LTD

Collaborative motion planning method and system for unmanned material grabbing machine

The invention relates to a cooperative motion planning method and system for an unmanned material grabbing machine, and belongs to the technical field of motion planning of material grabbing machines. The method comprises the following steps: defining a path planning task; under collision constraint, joint constraint and incomplete constraint, an optimal path searching scheme with the shortest path length, the maximum distance between a path node and an obstacle and the minimum joint configuration change of adjacent path nodes as targets is established; an improved fast expansion random tree algorithm with target offset is adopted to generate a target path, focusing processing is carried out on a moving area of a chassis of the material grabbing machine, and then a random number growth method is improved to obtain the target path; and the obtained target path is subjected to smoothing processing, including rotating angle optimization processing of a mechanical arm of the material grabbing machine and redundant node processing, and then the final motion path of the unmanned material grabbing machine is obtained. The system is based on the method.
Owner:CISDI RES & DEV CO LTD

Flexible cable operating method and system using double mechanical arms in confined environment

A flexible cable operating method and system using double mechanical arms in a confined environment. The flexible cable operating method using double mechanical arms in a confined environment comprises: receiving a global planned path sent by a global planner, the global planned path being a global planned path obtained by the global planner performing global planning on the basis of a constrained bidirectional rapidly-exploring random tree method and according to an initial configuration and a target expected configuration of a flexible cable (S101); and using the global planned path as a guide path, and controlling the movement of double mechanical arms by means of real-time feedback closed-loop control until the flexible cable reaches the target expected configuration (S102).
Owner:TSINGHUA UNIVERSITY

Tractor track iterative planning method based on improved search random tree algorithm

The invention provides a tractor track iterative planning method based on an improved search random tree algorithm, and belongs to the field of equipment intelligent guarantee. The method comprises the following steps: firstly, preliminarily constructing an optimal control problem according to an allocation demand and a motor tractor motion characteristic; 2, representing a tractor body by using a characteristic circle according to the actual shape of the tractor, and equivalently converting an obstacle avoidance problem; and thirdly, obtaining a grid map according to the actual map and the radius of the characteristic circle. Fourthly, a bidirectional fast search random tree algorithm based on a Reeds-Shepp curve is adopted to obtain a coarse path; fifthly, re-sampling the rough path to obtain an initial reference solution; sixthly, constructing a safety channel, and simplifying the form of obstacle avoidance constraint conditions; and 7, based on the obstacle avoidance constraint and the motion constraint of the tractor, softening a nonlinear term constraint condition, establishing an optimal control problem, and performing iterative solution. According to the method, the secure channel can be continuously updated, the influence of the initial guess solution on the final solution result is weakened, and a planned path with good quality is obtained.
Owner:DALIAN UNIV OF TECH

Robot path planning method based on improved RRT-Connect algorithm

PendingCN119063750ALimit sampling rangeGuaranteed probabilistic completenessInstruments for road network navigationRandom treeImproved algorithm
The invention relates to the technical field of path planning, and particularly discloses a robot path planning method based on an improved RRT-Connect algorithm, which comprises the following steps: initializing parameter information and constructing a map, setting parameters such as the maximum number of iterations, the positions of a starting point and a target point, and respectively constructing two random trees from the starting point and the target point; setting a dynamic limited sampling area, sampling in the limited sampling area, and guiding the two random trees to alternately expand nodes by adopting a target deviation self-adaptive step length strategy; cutting and smoothing the initial path by using a greedy strategy and constructing a B spline curve; and finally, outputting an optimized path. Compared with a traditional RRT-Connect algorithm, the method has the advantages that the sampling randomness is reduced by setting a dynamic limit sampling area, the random tree is guided to extend nodes by adopting a target deviation adaptive step length strategy, and the path is optimized by utilizing a greedy strategy and constructing a B spline curve, so that the robot path planning efficiency and the planning path quality can be effectively improved.
Owner:NORTH CHINA ELECTRIC POWER UNIV

Network attack processing method and system based on zero-sum game

The invention provides a network attack processing method and system based on a zero-sum game, relates to the field of data processing, and can solve the problem of low network attack processing accuracy. The method comprises the steps that a target sample in samples is determined according to the optimal weight of all classifiers in a classification system and predicted values of all the classifiers for the samples, the classification system at least comprises a random forest classifier, an extreme random tree classifier and a gradient boosting classifier, and the samples comprise network attack information; then, carrying out quantity expansion processing on the target class samples through a generative adversarial network model to obtain expanded samples; and then, carrying out network attack detection according to the expanded sample and the sample, and determining whether a network intrusion attack behavior exists or not. And an expansion sample with authenticity and diversity is generated through the generative adversarial network model, so that hidden network intrusion attack behaviors can be found. Therefore, the processing accuracy of the network attack is improved.
Owner:CHANGCHUN UNIV OF SCI & TECH +1

Motion planning method and device for tower crane in complex environment

The invention discloses a tower crane motion planning method and device in a complex environment, and the method comprises the steps: building a nonlinear model for comprehensively describing the motion characteristics and transient behaviors of a crane-load system on the basis of kinetic analysis, and carrying out differential flat analysis; a BiRRT * algorithm based on direction bias is provided, a node expansion process is optimized by introducing a target bias mechanism of fusion region probability sampling and based on an improved potential field function direction guiding mechanism, and the efficiency and quality of path planning are improved. An improved random tree extension mechanism is combined with a depth deterministic policy gradient (DDPG) of reinforcement learning, and adaptive adjustment of sampling direction and step length parameters is realized. Path points obtained through path planning serve as profile value points of trajectory planning, system full-state constraint conditions such as load obstacle avoidance and shimmy reduction are fully considered, multi-target trajectory planning is carried out based on an NURBS curve, and a multi-target comprehensive optimal trajectory on the aspects of total hoisting time, operation energy consumption and load shimmy suppression is obtained.
Owner:BEIJING WUZI UNIVERSITY

Incremental reinforcement learning path planning method based on dynamic reward remodeling

The invention provides an incremental reinforcement learning path planning method based on dynamic reward remodeling, which is used for solving the problems of training efficiency and composite optimization in path planning. According to the method, a rapid exploration random tree and an artificial potential field method are combined with reinforcement learning, a dynamic reward function is designed, real-time feedback is provided for an intelligent agent, and strategy learning is accelerated. The system specifically comprises a reward remodeling module which provides process rewards through a fast exploration random tree and an artificial potential field method; the sub-target course learning module is used for gradually increasing task complexity and optimizing sample utilization; the progressive reward adjustment module dynamically adjusts the reward weight and solves the reward coupling problem; and the strategy fine tuning module dynamically adjusts the learning rate and supports strategy optimization. Experimental results show that in static and dynamic path planning tasks, compared with a traditional method, the method has the advantages that the training efficiency and the composite optimization performance are remarkably improved, the reward coupling problem is effectively solved, and the intelligent agent can efficiently learn and converge to a global optimal strategy.
Owner:NORTHWESTERN POLYTECHNICAL UNIV

A robot path planning method based on improved RRT algorithm

The present invention discloses a robot path planning method based on an improved RRT algorithm. First, nodes are generated in the form of resultant vectors, which is conducive to quickly finding a path. Secondly, the use of dynamic step size allows the algorithm to avoid the problem of difficulty in finding a path in a complex obstacle environment to a certain extent, and the anti-random tree reverse growth avoids a large amount of calculation caused by too many nodes in the later stage. Further, based on the triangle pruning strategy, the path cost is effectively reduced on the basis of the initial path, and the pruned path is smoothed using a cubic B-spline curve, which reduces the jitter of the robot and reduces the wear and tear caused by the movement of the robot. By improving the RRT algorithm, the path distance is reduced and the path quality is optimized, and blind sampling is avoided while improving the planning efficiency.
Owner:ANHUI UNIV

Threat intelligence perception method and device, equipment and medium

The invention discloses a threat intelligence perception method and device, equipment and a medium, and relates to the technical field of information security, and the method comprises the steps: constructing a network matrix according to the historical threat intelligence data of each node in a target network; performing iterative simulation on the network matrix by using a fast extended random tree algorithm to obtain attack paths in the network matrix and pheromones of nodes in the attack paths; based on the attack paths and the pheromones of the nodes, acquiring pheromone important values among the nodes, and storing threat feature samples and threat intelligence data links screened from the historical threat intelligence data and the attack paths according to the pheromone important values in a preset rule base; and collecting current traffic data of each node in the target network, and comparing the current traffic data with the threat feature sample and the threat intelligence data link so as to determine whether the current traffic data has a threat attack according to an obtained comparison result. Through the scheme, the efficiency of threat intelligence perception can be improved.
Owner:HANGZHOU DBAPPSECURITY CO LTD

UUV path planning method based on improved fast search random tree

The invention discloses a UUV path planning method based on an improved fast search random tree. The method is suitable for the fields of autonomous navigation, task execution, obstacle avoidance, safety guarantee and the like of UUVs. The method comprises the following steps: S1, determining an initial step length; dynamically adjusting the initial step length according to the scale of the task space and the complexity of the environment; and S2, carrying out target bias sampling. In the sampling process, according to a set bias threshold value, an algorithm biases a sampling point to a target area according to a certain probability, so that the target guidance quality of search is enhanced; and S3, removing redundant points. A Dijkstra algorithm is adopted to simplify a path, unnecessary turning points are removed, and more nodes are inserted into the path to improve the intensity of the path, so that the optimization space is increased. Then, redundant point removal is executed again, so that the path is further simplified; and S4, smoothing the path. Through the maximum curvature constraint, it is ensured that the turning angle of the path does not exceed the preset limit, meanwhile, in combination with a polynomial fitting method, abrupt turning in the path is reduced, and the smoothness of the path is improved.
Owner:THE 76TH RES INST OF CHINA STATE SHIPBUILDING CORP

Robot path planning method and system with local search path optimization

The invention belongs to the technical field of path planning, and provides a robot path planning method and system with a local search path optimization function, and the method comprises the steps: determining the positions of a starting point and a terminal point, and the number and positions of obstacles according to a map environment of robot movement, initializing two random trees with the starting point and the terminal point as root nodes, determining the maximum number of iterations and a termination condition; a root node of a third random tree is generated and initialized; according to the position of the obstacle, iteratively utilizing three random trees to alternately carry out node expansion, and in the expansion process, adopting an adjacent point local search strategy, and when the random trees carry out continuous expansion to a certain node, carrying out local search on a newly generated node to seek a better path; and obtaining the current optimal planning path of the robot until the maximum number of iterations or the termination condition is met. According to the method, the trajectory planning efficiency can be remarkably improved, and the trajectory generation stability is improved.
Owner:SHANDONG UNIV +1

Mechanical arm path planning method and device based on improved random tree

The invention provides a mechanical arm path planning method and device based on an improved random tree, and the method comprises the steps: obtaining a real scene image, and constructing a three-dimensional obstacle model; performing grating processing on the three-dimensional obstacle model to generate a repulsive force field; planning a path trajectory in the three-dimensional obstacle model based on the improved random tree; and generating a joint space path point corresponding to the mechanical arm through the inverse motion so as to control the mechanical arm. According to the method, the repulsive force field of the obstacle is generated, and the randomness of the random tree is influenced by the repulsive force field, so that the obstacle can be bypassed in the random tree planning process, and the planning efficiency is improved.
Owner:LONGWOOD VALLEY MEDICAL TECH CO LTD

Mechanical arm path planning method and system based on self-adaptive expansion sampling

The invention discloses a mechanical arm path planning method and system based on self-adaptive expansion sampling, belongs to the technical field of path planning, and solves the problems of low sampling rate, low convergence rate and poor initial path quality caused by too random sampling area and improper selection of expansion step length during path planning of a mechanical arm in the prior art. According to the self-adaptive expansion sampling strategy provided by the invention, on the basis of the F-RRT * optimization algorithm, the growth direction of the random tree is corrected by introducing the target bias force, so that the random tree deviates to the target point, the inflection point is optimized, the generated path is smoother, and by introducing the concept of target point gravity deviation, the optimal path is obtained. A strategy is adaptively expanded according to the obstacle complexity in the environment, and expansion is performed by dynamic step length, so that the stability and precision of the trajectory are improved, and the length of the generated path, the sampling frequency and the convergence time are reduced.
Owner:ANHUI NORMAL UNIV

Automatic wiring method and system of secondary screen cabinet, medium and product

The invention discloses an automatic wiring method and system of a secondary screen cabinet, a medium and a product, and belongs to the field of automatic wiring of the secondary screen cabinet, and the method comprises the steps: obtaining the design drawing data of the secondary screen cabinet, and extracting the installation position of each component and the insertion starting point and end point of a wiring harness; setting a plurality of bundling middle points for each wire harness based on the positions of the components, and forming a node sequence by combining starting and ending points; generating path fragments for each pair of adjacent nodes in the sequence by adopting a fast exploration random tree connection algorithm with sampling region constraint and an obstacle approaching penalty term; and sequentially splicing all the segments into a complete wiring path, and controlling a wiring device to automatically complete wiring harness arrangement and fixation according to the complete wiring path. By implementing the method, the problems of low efficiency and poor safety of automatic wiring path planning of the wiring harnesses in the secondary screen cabinet in the prior art can be solved.
Owner:POWER DISPATCHING CONTROL CENT OF GUANGDONG POWER GRID CO LTD

Power inspection method and system based on big data and random tree algorithm

The invention discloses an electric power inspection method and system based on big data and a random tree algorithm, and relates to the field of electric power system management and maintenance. Comprising the following steps: collecting key information, historical information and personnel basic data information of power equipment in real time, and processing the obtained key information; based on the processed key data, a plurality of factors are comprehensively considered, and an inspection line model is constructed; solving the inspection line model by using a fast search random tree algorithm; and outputting the optimized power inspection path, and carrying out data storage. According to the method, the information subsets of the electric power equipment and the inspection maintenance personnel object provided by the big data platform are introduced, multiple feasible paths subjected to coarse screening are further screened, the optimal electric power inspection path is generated through iteration for a certain number of times, the line scheme is output and stored, and intelligent optimization of the electric power inspection path is achieved.
Owner:WUQIANG XISHUI POWER PLANT OF WULING ELECTRIC POWER CO LTD +2