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

224 results about "Mobile robots path planning" patented technology

Mobile robot fusion path planning method based on Voronoi skeleton

The invention relates to a mobile robot path planning method based on a Voronoi skeleton, and belongs to the field of path planning. The method comprises the following steps: firstly, constructing a working environment grid map of the mobile robot by using a laser mapping radar, and constructing a working environment Voronoi skeleton diagram by sequentially using a plurality of steps of Delaunay triangulation, dual Voronoi diagram construction and undirected graph adjacency matrix transformation through a grid-skeleton diagram construction method; secondly, performing global path planning by using an A * algorithm based on a skeleton vertex, and performing path point optimization according to a space obstacle avoidance demand to generate a global optimization prior path; and then, optimizing a DWA algorithm speed sampling space, introducing global optimization guidance by improving an evaluation function, and constructing a global guidance type DWA algorithm. And finally, the local path planning and the global planning path are fused through the dynamic target point, and surrounding obstacles are detected in real time to perform obstacle avoidance operation until the mobile robot arrives at a terminal point. According to the method, the navigation safety, the path smoothness and the operation efficiency of the mobile robot are remarkably improved.
Owner:NANJING UNIV OF AERONAUTICS & ASTRONAUTICS

Distributed multi-mobile robot path planning and obstacle avoidance method based on ACO-DWA

The invention discloses a distributed multi-mobile robot path planning and obstacle avoidance method based on ACO-DWA, and belongs to the technical field of path planning. The invention discloses a distributed multi-mobile robot path planning and obstacle avoidance method based on ACO-DWA. The method comprises the following steps: constructing an environment model; performing global path planning by using an ant colony algorithm ACO; establishing a motion model of the robot, and selecting an optimal speed group; and designing a conflict judgment rule, introducing a priority strategy, and solving conflicts according to the importance and urgency of robot tasks. According to the distributed multi-mobile-robot path planning and obstacle avoidance method based on ACO-DWA, an improved dynamic window method (DWA) and an ant colony optimization (ACO) algorithm are utilized, effective local path planning and global path optimization are achieved in the environment with high-density obstacles and unknown static obstacles, and safe obstacle avoidance of the robots is ensured. Meanwhile, a motion conflict judgment rule and a priority strategy in the multi-robot system are provided to coordinate the motion between the robots and between the robots and obstacles, and safe and efficient navigation is ensured.
Owner:DEZHOU POWER SUPPLY COMPANY OF STATE GRID SHANDONG ELECTRIC POWER +1

Mobile robot path planning method based on artificial mouse travel algorithm

The invention discloses a robot path planning method based on an artificial mouse travel algorithm. The method comprises the following steps: constructing a map; the method comprises the steps of parameter setting, initialization, initial path fitness evaluation, global search, local search, new path evaluation and local enhancement search, a dynamic adaptive search radius strategy is used for dynamically adjusting a search range C, and when an exploration-development switching threshold value E is larger than 1, namely Egt; the method comprises the following steps: 1, starting global search by adopting a dual-mode hybrid strategy, Elt; the method comprises the following steps: 1, starting local search, adopting an adaptive probability Levy flight or small-range disturbance strategy, introducing a local search enhancement module, carrying out refined search on a current global optimal path Xbest through a simplex method Nelder-Mead, and evaluating the fitness of the optimal path of iteration each time through the algorithm; and outputting an optimal path sequence according to the fitness value of the recorded optimal path. The method has the characteristics of improving the search capability, obtaining the optimal path and the like.
Owner:GUIZHOU INST OF TECH +1

Industrial mobile robot path planning method based on artificial potential field method and dynamic prediction

The invention relates to the technical field of industrial robot path planning, in particular to an industrial mobile robot path planning method based on an artificial potential field method and dynamic prediction. The method comprises the following steps: firstly, acquiring environment point cloud data, and distinguishing static and dynamic obstacles based on time sequence difference and Euclidean distance; kalman filtering is used to predict the future position of a dynamic obstacle, and a density clustering algorithm is used to simplify a static obstacle; combining a target point, a static obstacle set and a dynamic obstacle prediction result to construct an improved artificial potential field function to calculate gravitational force and repulsive force; the potential collision risk is judged based on the motion state of the robot, the dynamic obstacle repulsive force with the risk is brought into potential synthesis in advance, and the final resultant force for guiding motion is generated; and when it is detected that the system is caught in a local optimal or oscillation state, executing a virtual gravity point escape strategy until the system reaches a target point. According to the method, the fusion of static clustering, dynamic prediction and potential field improvement is realized, and the obstacle avoidance and path planning efficiency in a complex dynamic environment is improved.
Owner:NANCHANG INST OF TECH

Dynamic path planning method, system and equipment based on multiple mobile robots and medium

The invention belongs to the technical field of path planning, and provides a dynamic path planning method, system and equipment based on multiple mobile robots and a medium based on the multiple mobile robots in order to solve the problems that the calculated amount is increased sharply and unexpected situations cannot be handled in the current path planning of the multiple mobile robots, and the independent path planning of each robot is completed by adopting mixed A *-epsillon. A dual-domain priority queue is introduced, child nodes are generated through node expansion, then a path is re-planned for the robot with constraints, and therefore a conflict-free path of the robot is generated; and performing control sequence sampling on each robot, taking a conflict-free space-time path as a reference path, obtaining an optimal control sequence according to the cost value of each predicted trajectory, and adjusting the path in real time through rolling optimization so as to cope with a dynamic obstacle. The method can actively avoid a dynamic obstacle or an obstacle which is not considered during planning.
Owner:SHANDONG UNIV

Mobile robot path planning method and system based on circular trajectory control obstacle function

The invention discloses a mobile robot path planning method and system based on a circular trajectory control obstacle function, and aims to realize trajectory smooth control in an obstacle avoidance process. Firstly, an envelope circle is used for modeling an obstacle, an actual boundary is approached in a continuous and simple geometric form, and the calculation complexity of collision detection is reduced. Secondly, designing a control obstacle function based on a circular trajectory, constructing a derivable constraint in combination with a geometrical relationship between a tangent line and an obstacle boundary, and achieving trajectory smoothing, reducing speed fluctuation and prolonging the service life of an execution mechanism while guaranteeing a safe distance. For disturbance caused by factors such as ground unevenness, historical data are learned by using a Gaussian process, the disturbance trend is predicted in real time, and the motion stability is improved. And finally, through nonlinear optimization solution, generating control input with safety, continuity and disturbance adaptive capability. According to the method, geometric modeling, safety constraint, disturbance prediction and a dynamic adjustment mechanism are fused, and the safety and adaptability of robot path planning are remarkably enhanced.
Owner:HUNAN UNIV

Mobile robot path planning method and system

The invention relates to a mobile robot path planning method and system, and the method comprises the steps: determining a multi-neighborhood mixed search mechanism for the mixed use of eight neighborhoods and new sixteen neighborhoods according to whether there is an obstacle in the eight neighborhoods of a current node; deleting invalid nodes according to the positions of the current node and the target node; a bidirectional search strategy is adopted, a dynamic weight coefficient is added to adjust the heuristic function, and a planned path is obtained; and a redundant inflection point deletion strategy is adopted for the planned path, useless inflection points are removed, and an optimal path is obtained. By improving a neighborhood search mechanism, the search efficiency of a path planning algorithm is improved; through a node optimization strategy, invalid nodes in the algorithm searching process are removed, and the path planning algorithm searching time is shortened; by introducing a two-way search mechanism, the algorithm search efficiency is improved, meanwhile, the dynamic weight factor is added to adjust the algorithm search speed, search of invalid regions is reduced, and therefore the search efficiency is improved.
Owner:GUANGZHOU INST OF ADVANCED TECH CHINESE ACAD OF SCI

Mobile robot path planning method based on SAC algorithm

PendingCN119289981AImprove strategy qualityEfficiently avoidNavigational calculation instrumentsAlgorithmSimulation
A mobile robot path planning method based on an SAC algorithm belongs to the technical field of deep reinforcement learning and mobile robot navigation, integrates the thought of hierarchical reinforcement learning skill combination into the SAC algorithm, and uses a time sequence abstraction method to integrate low-level fine-grained actions, so as to improve the precision of the SAC algorithm. A higher-level coarse-grained action with definite semantics can be learned; in reinforcement learning training, a distributed soft strategy iteration method is used, maximum entropy reinforcement learning is expanded into a distributed learning version, and variance and overestimation of a Q value are reasonably controlled through a learning state-action return distribution function, so that the overall strategy quality of robot path planning is improved. According to the method, training and testing are carried out in a simulation environment Image-Env, and the performance of the algorithm is verified on Turtlebot2. The method can efficiently avoid obstacles, is short in path, and has a good obstacle avoidance effect in a complex dynamic environment.
Owner:ZHEJIANG RUNCHEN TECH CO LTD

Mobile robot path planning method and device based on improved RRT algorithm and medium

The invention provides a mobile robot path planning method and device based on an improved RRT algorithm and a medium, and belongs to the technical field of mobile robot path planning. The method comprises the steps that a starting point, a target point and obstacle distribution information in a space map are set, and an algorithm is initialized; determining a random sampling point source by using a probability target bias strategy; determining a node closest to the sampling point in the random tree and marking the node as a nearest node; introducing a self-adaptive target gravitation method and a component in a random sampling point direction to determine an expansion direction of a new node; judging whether a connecting line between the new node and the nearest node collides with an obstacle or not, and determining a gravity coefficient; determining an original path from a starting point to a target point, and removing redundant nodes; and performing optimization processing on the path from which the redundant nodes are removed, and outputting an optimized path. According to the method, the path planning time can be greatly shortened, the path is smooth, and the obstacle avoidance path planning efficiency of the mobile robot is further improved.
Owner:山东电子职业技术学院

Dynamic sensing path planning method for mobile robot in unknown environment

The invention relates to the technical field of intelligent mobile robot path planning, in particular to a dynamic sensing path planning method for a mobile robot in an unknown environment. According to the method, an environment complexity model is established based on the obstacle density and the dynamic activity, and map partition and obstacle avoidance judgment are adaptively adjusted according to the environment complexity model; carrying out incremental updating on the near, middle and far sub-regions based on the point cloud similarity; extracting contours of the obstacle point clouds and carrying out topological optimization; dynamic candidate points are identified through double marking of rays and scanning points, and collision time is predicted and estimated in combination with spatial clustering and trajectory; and according to the collision time, hierarchical obstacle avoidance and local or global re-planning are implemented, and a repaired path is smoothed. According to the method, the path planning efficiency and the real-time obstacle avoidance capability of the mobile robot in a dynamic complex environment are remarkably improved, the consumption of computing resources is reduced, and the method is suitable for application scenes needing high dynamic response, such as warehouse logistics and unmanned driving.
Owner:NANCHANG INST OF TECH

Mobile robot path planning method and system

The invention discloses a mobile robot path planning method and system, and belongs to the technical field of robots, the method comprises global path planning and local path planning; wherein the global path planning comprises the steps of enabling a path to be constantly away from an obstacle by improving an A * algorithm and introducing a bilateral obstacle detection algorithm and an offset obstacle avoidance method so as to avoid collision with the obstacle during turning, and performing optimization and smoothing processing on the path by combining a thinning algorithm and a middle point outward expansion method so as to generate a global optimal path; the local path planning comprises the steps of improving a TEB algorithm, introducing a sensing window and an evaluation function, proposing an acceleration and jerk double-constraint dynamic obstacle avoidance strategy, and ensuring stable movement of the robot in the obstacle avoidance process. According to the scheme, by combining the advantages of global path planning and local path planning, the path planning capability and the transportation efficiency of the robot in a complex and changeable environment are improved.
Owner:UNIV OF SCI & TECH BEIJING

Unknown dynamic environment mobile robot path planning method based on reinforcement learning

The invention relates to an unknown dynamic environment mobile robot path planning method based on reinforcement learning, and belongs to the technical field of path planning. According to the method, a two-layer reinforcement learning structure is adopted, a bottom layer module learns global path planning, and an ellipse specific and precise strategy and a GliEF-Dyna-Q algorithm are provided in the early stage; the high-level module learns an obstacle avoidance rule to complete local dynamic obstacle avoidance; according to the GliEF-Dyna-Q algorithm, elliptic geometric knowledge is introduced to design an elliptic knowledge special and precise strategy to narrow the sampling range, a reward mechanism and path search are constrained and optimized through global and local perspectives, and an improved SA-epsilon greedy strategy is fused into Dyna-Q to achieve efficient global path planning. The high-level module provides a brand-new obstacle avoidance behavior reward mechanism and a more adaptive value function updating method so as to carry out comprehensive local obstacle avoidance activities. According to the invention, the robot can more efficiently realize obstacle avoidance and complete optimal path driving in a dynamic environment.
Owner:CHONGQING UNIV OF POSTS & TELECOMM

Collision-free global path planning method for mobile robot

The invention provides a collision-free global path planning method for a mobile robot, belongs to the field of mobile robot path planning, and is used for solving the problems of intention misjudgment, low role allocation efficiency and high collision risk in a dynamic scene caused by dependence on statistical association in related technologies. According to the method, agent intention reasoning is achieved by constructing a mental atlas containing a causal relationship, efficient role allocation is performed based on a quantum role superposition state, path search is optimized in combination with a conflict risk field, role collapse is triggered when a conflict risk exceeds a threshold value, and cooperation of adjacent agents is guaranteed through a quantum entanglement cooperation state. According to the scheme, intention prediction accuracy and role allocation efficiency are improved, and collision-free and efficient global path planning in a dynamic environment is realized.
Owner:TIANJIN GUIYI TECHNOLOGY CO LTD

Path planning method of improved bidirectional A* algorithm

The invention belongs to the field of mobile robot path planning, and relates to a path planning method of an improved bidirectional A * algorithm, which can obtain an optimal or suboptimal improved A * algorithm in a grid map environment. According to the algorithm, a target offset search strategy is introduced, a current node is tried to be connected with a target point when the algorithm searches a path, the search efficiency of the algorithm is improved, meanwhile, an initial path is planned by adopting a bidirectional search strategy of an improved heuristic function, and the search efficiency of the algorithm is further improved; and finally, a redundant point elimination strategy considering grid angular points is introduced, and a path with a shorter distance is further planned while the search efficiency of the algorithm is improved. According to the method, the path searching efficiency is improved, the inflection points of the generated path are reduced, and the length of the generated path is shortened.
Owner:DALIAN MARITIME UNIVERSITY

Multi-mobile-robot path planning method based on swarm intelligence

The invention relates to a multi-mobile-robot path planning method based on swarm intelligence, and belongs to the technical field of robot path planning. The method comprises the following steps: setting the size of a map, starting and target positions and colors of a robot, creating a preset grid map, and initializing an ant colony algorithm, a genetic algorithm and a pheromone system; iteratively searching paths for the mobile robots with different starting points at the same time through an ant colony algorithm; a genetic algorithm is used for optimizing the path, conflict detection and processing are carried out after the path is optimized, and it is ensured that the final path is free of conflicts; and when the maximum number of iterations is reached, outputting the shortest path that each robot arrives at the target node and no collision exists between the robots. According to the path planning method, unnecessary turning can be reduced, the convergence speed of path searching is obviously improved, robot conflicts can be avoided, and the actual requirements of multi-robot path planning are met.
Owner:CHONGQING UNIV OF POSTS & TELECOMM

Mobile robot path planning method based on improved eagle optimization algorithm

The invention relates to a mobile robot path planning method based on an improved eagle optimization algorithm, and belongs to the technical field of robot path planning, and the method comprises the following steps: S1, constructing a two-dimensional grid map according to map information, and marking a starting point, a target point and an obstacle; s2, constructing a multi-objective function, and evaluating the advantages and disadvantages of the path according to the path length and the path smoothness; s3, using uniformly distributed Logistic chaotic mapping and combining with an LOS sight line detection algorithm to initialize a population; s4, improving an egret optimization algorithm by adopting a self-adaptive nonlinear inertia factor and a doliolaria group algorithm, selecting a corresponding global search mode and a local search mode according to different iterations, and updating the position and the target function value of an egret individual; and S5, outputting the optimal path.
Owner:CHONGQING UNIV OF POSTS & TELECOMM

Mobile robot path planning method based on improved long short-term memory network

The invention discloses a mobile robot path planning method based on an improved long short-term memory network. The method comprises the following steps: step 1, carrying out partial observable Markov decision process modeling on a mobile robot in a time state; 2, adding a long-short-term memory network optimization reinforcement learning path planning algorithm and a preliminary optimization algorithm to complete basic navigation path planning, and 3, providing probability compensation for the long-short-term memory network; 4, applying a self-adaptive compensation function aiming at the strategy function so that the model can more effectively utilize the existing information and improve the decision and navigation capability of the robot in a complex environment in a changeable environment, and 5, training the modified SAC algorithm model, and deploying the finally trained model to the mobile robot, so as to improve the navigation capability of the robot in a complex environment. And path planning can be better completed. According to the method, the long-short-term memory network is introduced into the reinforcement learning algorithm, so that the performance of path planning is effectively improved.
Owner:ZHEJIANG RUNCHEN TECH CO LTD

Mobile robot path planning method based on multi-strategy fusion whale optimization algorithm

The invention provides a multi-strategy fusion white whale optimization algorithm, and aims to solve the problems that the global exploration capability of the algorithm is weak, the algorithm is easy to fall into local optimum in the later stage and the like, and the algorithm comprises the following steps: firstly, dynamically adjusting a balance factor by adopting a nonlinear balance factor based on a Softplus activation function, effectively balancing the global search and local development capability, and solving the problem that the global exploration capability is poor; the convergence speed is improved; secondly, a search strategy based on dimension learning is fused, the local search capability of the whale optimization algorithm in the later period is enhanced, and the convergence precision is improved; and finally, according to a sine and cosine optimization algorithm, optimizing a position updating formula, improving the global search capability of the algorithm and accelerating the search speed so as to enhance the robustness of the algorithm. According to the method, 29 basic test functions of a CEC2017 test set are used for testing the improved algorithm, and compared with path planning experiments of GWO, GA, WOA, HHO, ACO and original BWO algorithms under a complex map, the optimal values of the shortest paths of the improved algorithm are reduced by 16.01%, 4.34%, 9.56%, 10.01%, 6.24% and 13.7% respectively; it is verified that the search efficiency of the algorithm is improved, the capability of avoiding falling into local optimum is high, and the convergence speed, the convergence precision and the optimization time are all superior.
Owner:XINJIANG UNIVERSITY

Mobile robot path planning method based on improved A star algorithm

The invention discloses a mobile robot path planning method based on an improved A star algorithm, which comprises the following steps of: firstly, acquiring environment information of a current map through a sensor, establishing a grid map, and simultaneously determining a starting point coordinate, an end point coordinate and an environment obstacle coordinate of a robot; an OPENLIST list and a CLOSEDLIST list are created, and a starting point is put into the OPENLIST list; selecting a new distance calculation function, and setting the Euclidean distance as a median value of the Euclidean distance and the Manhattan distance; improving a heuristic function, and introducing an adaptive estimation function; the total distance cost of the nodes is calculated from the starting point according to the node expansion mode, the optimal path nodes are placed in the CLOSEDLIST till the end point is traversed, and the optimal path is generated; and deleting redundant nodes in the path based on a collinear principle to obtain a final optimized path. The search time of the algorithm is shortened, the algorithm can better adapt to different environments and scenes, the applicability of the algorithm is enhanced, and the planning efficiency of the algorithm is effectively improved.
Owner:WUXI UNIV

Mobile robot path planning method based on improved ant colony-guided optimization algorithm

The invention provides a mobile robot path planning method based on an improved ant colony-guided optimization algorithm. According to the method, after a grid map environment is constructed, a dynamic selection factor is introduced to optimize a state transition rule of an ant colony algorithm, so that the efficiency at the initial stage of search is improved; a multi-step search strategy is adopted to enhance the flexibility of path planning, and an end point distance index is utilized to replace the traditional pheromone concentration, so that the risk of falling into local optimum is reduced; and carrying out smoothing processing on the path in combination with a guide optimization algorithm to realize iterative correction and global path optimization of a feasible region. The method has good path quality and convergence performance, and is suitable for a mobile robot path planning task. Simulation results show that compared with a traditional ant colony algorithm and an improved method thereof, the algorithm has obvious advantages in the aspects of path length, the number of corners, convergence efficiency and the like.
Owner:ZHEJIANG UNIV OF TECH

Indoor mobile robot path planning method and system for substation equipment inspection

The invention relates to the field of electric power automation, in particular to an indoor mobile robot path planning method and system for transformer substation equipment inspection, and the method comprises the steps: building a grid map according to a working scene which actually needs to be inspected, determining the positions of a starting node and a target node, sorting nodes in an open list, and storing the sorted nodes in the open list; setting the node with the minimum node cost as the current node, adding the current node into a closing list, and then expanding the current node by using a child node expansion strategy; when the node existing in the open list is searched, calculating the node cost again; outputting a path according to the closing list and carrying out repeated broken line optimization; the trained improved DQN algorithm is used for carrying out obstacle avoidance processing on unknown obstacles in the global path until a collision-free path from the starting point to the terminal point is planned, and the problems that a traditional inspection robot path planning algorithm is low in efficiency, unsmooth in path and poor in obstacle avoidance effect during path planning are solved.
Owner:WUXI POWER SUPPLY BRANCH OF STATE GRID JIANGSU ELECTRIC POWER CO LTD

Mobile robot path planning method combining kinematics constraint and variable density sampling

The invention discloses a mobile robot path planning method combining kinematics constraint and variable density sampling, which comprises the following steps: setting a starting point and a target point, adding the starting point into a vertex set, adding the target point into a sampling set, initializing a node priority queue and an edge priority queue, and establishing kinematics constraint and environment parameters at the same time; searching a main circulation path; if the vertex cost is better, performing vertex expansion and generating candidate edges, and if the edge cost is better, performing feasibility verification and accessing the path tree; when the search is stagnated or trapped in local optimum, an escape mechanism is triggered, and the exploration capability is enhanced through radius expansion and supplementary sampling; an improved heuristic function and a local cost function are established, search convergence is guided, and track smoothness and performability are improved; and when a termination condition is reached, outputting a path planning result. According to the method, the sampling efficiency and the searching speed are improved while the path feasibility is ensured, so that the navigation requirement of the mobile robot in a complex dynamic environment is met.
Owner:JIANGSU UNIV OF SCI & TECH

Mobile robot path planning method and system based on rat optimization algorithm

The invention relates to the technical field of robot path planning, and discloses a mobile robot path planning method and system based on a rat optimization algorithm, and the method comprises the following steps: environment modeling: carrying out the modeling of a moving environment of a mobile robot, dividing the environment into a plurality of grid units, distinguishing an obstacle area and a passable area; defining a fitness function: converting a path planning problem into an optimization problem, and constructing the fitness function taking a path length and an obstacle avoidance constraint as targets; a rat optimization algorithm is initialized, wherein the position and algorithm parameters of a rat population are initialized; according to the method, the rat optimization algorithm is adopted, local optimization is effectively avoided through diversified behavior modes, the global optimization capability is enhanced, and the convergence speed and the optimization precision are improved while global search is ensured by the algorithm by introducing the adaptive weight and improving the local search strategy.
Owner:WEST ANHUI UNIV

Mobile robot path planning method based on egret group optimization

The invention provides a mobile robot path planning method based on egret group optimization, and the method comprises the steps: carrying out the population initialization through Tent chaotic mapping in an exploration stage, and reducing the path search cost; a sine and cosine algorithm and a greedy strategy are adopted to improve the position updating of the egret individuals so as to balance the local development and global search capability of the method; a Levy flight method is adopted to escape from a local optimal trap; and a safe and reliable planning path is obtained by using an area limit value method and a feasible point coordinate fine adjustment strategy. And in the optimization stage, a shortest path method, redundancy removal operation and a segmented Bezier curve method are adopted to optimize the trajectory, so that the final motion trajectory of the mobile robot is obtained. The mobile robot path planning method based on egret group optimization has the advantages of being high in path planning efficiency, short in total consumed time, better in path, and capable of reducing the number of path turning times, reducing the number of path nodes and enhancing the local optimal escape ability.
Owner:GUANGXI UNIV

Mobile robot path planning method based on deep reinforcement learning

The invention discloses a mobile robot path planning method based on deep reinforcement learning, and relates to the technical field of robot path planning. According to the method, a mobile robot path is divided into global planning and local obstacle avoidance, and local obstacle avoidance is realized through a BiLSTM-D3QN model; analyzing the first sensing data through a decision branch of the BiLSTM model to obtain a decision parameter, and comparing the decision parameter with a set parameter threshold to judge whether local obstacle avoidance is performed or not; when it is determined that local obstacle avoidance needs to be carried out, the BiLSTM model outputs obstacle avoidance parameters, then a D3QN model is used for generating a local obstacle avoidance path, and autonomous obstacle avoidance of the mobile robot is achieved; according to the invention, the BiLSTM model bidirectionally captures the context dependency relationship of the time sequence data, can simultaneously fuse forward and backward time sequence features, judges whether local obstacle avoidance is needed or not by using multi-dimensional data, defines the access opportunity of local obstacle avoidance, and improves the accuracy and reliability of local obstacle avoidance.
Owner:ANHUI POLYTECHNIC UNIV

Mobile robot path planning method based on improved adaptive dynamic window method

The invention provides a mobile robot path planning method based on an improved adaptive dynamic window method, and relates to the technical field of mobile robot path planning. Firstly, a high-precision grid map of a robot working environment is established, an improved A-star algorithm is utilized to generate a global optimal path, redundancy elimination optimization and arc interpolation smoothing processing are carried out, and then an optimal path is selected according to an evaluation function of an improved adaptive dynamic window method and a deflection degree screening mechanism. The improved A-star algorithm and the improved dynamic window method are fused to obtain a fusion algorithm having the advantages of the two algorithms, the improved A-star algorithm improves the algorithm search efficiency, and redundancy elimination optimization and arc interpolation smoothing improve the smoothness of the path. And by using the self-adaptive dynamic window method based on deflection degree screening, the speed of the algorithm is improved, obstacles can be avoided more effectively, the running speed of the robot in a narrow channel is improved, and the running time of path planning is effectively shortened.
Owner:SHENYANG LIGONG UNIV

Mobile robot path planning method, device, equipment and medium

The invention relates to a mobile robot path planning method, device and equipment and a medium, and belongs to the technical field of robot path planning, and the mobile robot path planning method comprises the steps: obtaining a starting point, a target point, a sampling point and the position of an obstacle in a robot grid map; based on the starting point, the target point, the sampling point and the position of the obstacle, adopting a multi-factor guiding strategy to initialize position information of the dung beetle population, generating an initial path of the dung beetle, calculating a fitness value of the dung beetle, and based on the fitness value, determining a global optimal position and a worst position of the dung beetle; according to the method, a dung beetle optimization algorithm based on a fine adjustment strategy is constructed, path planning is carried out on the robot based on the global optimum and worst position of dung beetles and the dung beetle optimization algorithm, the shortest path is obtained, and the efficiency and stability of path solving are improved while the shortest path is obtained.
Owner:WUHAN UNIV OF TECH

Ground mobile robot path planning method and system

The invention discloses a ground mobile robot path planning method and system, and relates to the technical field of intelligent robot autonomous control. The method comprises the following steps: constructing a grid map model of a robot moving environment; based on the grid map model, establishing a kinematic model of the robot and setting a movement rule, and initializing to generate a plurality of paths from a starting point to an ending point to form an initial path set; iteratively merging and optimizing the paths in the initial path set by adopting a group merging strategy, and screening out a current global optimal path; based on the current global optimal path guidance, a derivative path is updated based on an improved pigeon inspired optimization map and a compass operator, and a first-stage optimization set is obtained; and through iterative optimization of a landmark operator, dynamically calculating a landmark center according to a cost value and updating a path position to obtain a second-stage optimization set. And selecting an optimal path and carrying out connection smoothing processing to generate an optimal complete path. According to the method, the global optimal path can be efficiently and stably planned in a complex environment.
Owner:BEIJING UNIV OF CIVIL ENG & ARCHITECTURE

Mobile robot path planning method based on improved ant colony algorithm

The invention provides a mobile robot path planning method based on an improved ant colony algorithm, and relates to the technical field of robot path planning, and the method is technically characterized in that the method comprises the following steps: carrying out environment modeling by adopting a grid method, and constructing a multi-target performance evaluation function; an improved ant colony algorithm is adopted to carry out optimal path search, path planning is carried out on a grid map from a starting node to a target node, and the improvement of the ant colony algorithm comprises the steps of distributing pheromone concentration by adopting a non-uniform initialization method; improving a state transition rule; differentiating a pheromone updating strategy; and smoothing the path. An initial pheromone distribution optimization strategy is introduced, heuristic information based on a triangular inequality, a steering angle suppression function and a state transition rule of artificial potential field force are combined, a differential pheromone updating strategy based on a multi-target performance evaluation index is adopted, and finally a planned path is smoothed. Therefore, the convergence speed, the path quality and the environment adaptability of the algorithm are remarkably improved.
Owner:NANTONG UNIV

Mobile robot path planning method and system suitable for complex environment and application

The invention discloses a mobile robot path planning method suitable for a complex environment, and the method comprises the following steps: 1, obtaining an environment map, determining a path planning starting point A (xs, ys) and an end point B (xg, yg) in the environment map, and converting the path planning starting point A (xs, ys) and the end point B (xg, yg) into a binary map; 2, when no obstacle exists between the straight line segments # imgabs0 # of the path planning starting point and the path planning ending point in the environment map, directly taking the path # imgabs1 # connecting the path planning starting point and the path planning ending point as a planning path; or, when one or more obstacles exist between a path planning starting point and a path planning ending point straight line segment # imgabs2 # in the environment map, one or more segmented paths are determined according to the positions of the obstacles, and each group of segmented paths connected end to end between the path planning starting point and the path planning ending point are spliced to serve as alternative planning paths; and step 3, outputting the robot path obtained by planning. The invention further discloses a path planning system for realizing the path planning method and application, and the path planning system and the application have wide application scenes.
Owner:张好来