22 results about "Shortest path planning" patented technology

The invention relates to a robot global path planning and local obstacle avoidance method and device and a mobile robot. The robot global path planning and local obstacle avoidance method comprises the following steps: S1, constructing an immunoaffinity function; s2, establishing a two-dimensional plane environment model; s3, global path optimization based on an individual body type top-level food grazing strategy; s4, carrying out local obstacle avoidance detection; s5, obstacle grid evaluation based on a pseudo-virus diffusion algorithm; s6, building an obstacle protection area and controlling fitting motion; and S7, continuously monitoring the state of the obstacle in the obstacle avoidance process, and controlling the robot to adjust the trajectory to return to the original global planning path when detecting that the obstacle is separated from the obstacle avoidance area. According to the invention, global shortest path planning is realized through local area path optimization, and the traffic efficiency is improved.

The invention discloses an indoor positioning method based on a Bluetooth RSSI (Received Signal Strength Indicator), which comprises the following steps: after a positioning tag receives RSSI data broadcasted by Bluetooth beacons, screening the beacon with the strongest signal and calculating the distance; current data is directly adopted in first positioning, and translation processing is performed in combination with historical positions in non-first positioning so as to smooth a result. And mapping the position points to path points through a road network matching algorithm, preliminarily positioning the path points based on shortest path planning, and outputting a final positioning result through a filtering rule. According to the invention, the problem of positioning fluttering caused by fluttering of the Bluetooth RSSI signal, the problem of back-and-forth jumping of actual positioning caused by instability of the Bluetooth RSSI signal and the problem of signal abnormity caused by signal interference caused by metal, a wall body or a human body are effectively solved.

The invention relates to the technical field of air traffic management, in particular to an analog simulation method and system for a low-altitude traffic digital twin platform, and the method comprises the steps: obtaining a road plane projection drawing of a target area from the digital twin platform, the road plane projection drawing comprises buildings, roads and backgrounds, and dividing each road into a plurality of road sections; determining a risk cardinal number of the road section; determining the risk weight of the aircraft reaching each road section based on the intersection point between the road sections, the length of each road section and the real-time wind speed of the target area; and determining the comprehensive weight of each road section by using the risk weight, the risk cardinal number and the distance weight of each road section, and determining the final shortest path of the aircraft from the starting point to the terminal point in the target area according to the comprehensive weight. Therefore, the reliability and the safety of the shortest path planning of the aircraft are improved.

The application relates to the technical field of light industry, in particular to a method, system, device and medium for controlling the movement of a round hole drilling machine, the method comprising: obtaining a PLT file by using an interactive device, performing analysis based on the PLT file, and obtaining a set of circles; obtaining the radius and the center coordinates of all the circles in the set of circles; classifying the set of circles according to the radius of all the circles to obtain a set of circles with multiple types of radius; performing shortest path planning on the set of circles with each type of radius based on the center coordinates to obtain a target path information set of the set of circles with multiple types of radius; storing the target path information set in the register of the interactive device; sending the target path information set to a PLC controller by using the interactive device; and sending displacement pulse instructions to the round hole drilling machine based on the target path information set by using the PLC controller, so that the round hole drilling machine performs a drilling operation corresponding to the displacement pulse instructions, and the automatic control of the round hole drilling machine is realized, the production efficiency is improved, and the operation difficulty is reduced.

The application relates to the field of carrier obstacle avoidance scheduling management, and particularly discloses a multi-mobile carrier obstacle avoidance scheduling method and system based on 5G and graph algorithm fusion, which comprises the following steps: acquiring the running state information of each mobile carrier, and performing data preprocessing on the running state information of each mobile carrier at a 5G receiving front end. After the data preprocessing is completed, the 5G receiving front end transmits the data to a 5G transmitting end, the data is transmitted to a warehouse base station belonging to a cloud end through a radio frequency signal based on a 5G transmitting antenna, is converted into a binary digital signal that can be stored by the cloud end, a signal is transmitted to a graph algorithm module by the cloud end to calculate a shortest path planning, a specific obstacle avoidance instruction is generated by sending the path to an obstacle avoidance instruction generation module, each mobile carrier is issued by the cloud end, and obstacle avoidance scheduling control is completed.

The invention discloses a fertilizer applicator in-field path planning method for soil mechanical compaction and reduction, and relates to the field of agricultural machinery dispatching. The invention aims to solve the problem that a fertilizing machine can roll soil in a field operation link. The method comprises the following steps: constructing a path code set containing turning node coordinates, turning direction angles and fertilizer applicator operation speeds in a fertilizer applicator operation path; and carrying out genetic operation on the path coding set by utilizing a genetic algorithm to obtain an optimal path. On the premise of ensuring the working efficiency, the soil compaction area is reduced, the shortest path planning of the in-field operation of the fertilizer applicator is deployed, and the high-efficiency and low-damage precise operation is realized.

The application discloses a kind of twin factory AGV path planning method, system, medium and equipment, it is related to path planning field, including obtaining and constructing twin factory 3D model;With the shortest path planning time and the minimum planning path length as the objective function of path planning, the PSO-A* algorithm is used to optimize the path, to determine the global optimal path planning result of automatic guided vehicle AGV in twin factory 3D model;Wherein, the PSO-A* algorithm is improved by introducing PSO algorithm to iteratively update the weight of heuristic function in evaluation function in A algorithm, to carry out path planning, including: determining the initial fitness value of each particle based on objective function, using particle swarm optimization PSO algorithm to iteratively update the position and speed of each particle in particle swarm, determine the fitness value of each particle after iteration update, the weight value corresponding to the particle position of optimal fitness value is used as the new weight of heuristic function in evaluation function in improved A* algorithm.

The application discloses a kind of underwear cutting machine with visual positioning double-head asynchronous shortest path planning method, the application relates to underwear cutting technical field, solve the problem that there is still defect in the positioning accuracy, segmented scientificity, double-head collaboration efficiency of path planning technology, the present application is aimed at the smooth cutting section and fine cutting section after division, respectively using "the shortest invalid path" strategy optimal path planning: when planning, by "near endpoint connection", reduce the cutting head moving empty course, reduce invalid driving time;At the same time, two groups of cutting heads undertake the cutting task of smooth cutting section and fine cutting section, combined with asynchronous collaboration mode, without waiting for each other, and through time difference optimal division strategy reduces the task time difference of two groups of cutting heads, realizes load balancing, greatly improves the synergy and overall processing efficiency of double-head collaboration.

The invention discloses a visual positioning double-end asynchronous shortest path planning method for an underwear cutting machine, relates to the technical field of underwear cutting, solves the problem that a path planning technology still has defects in positioning precision, segmentation scientificity and double-end cooperation efficiency, and aims at a smooth cutting section and a fine cutting section after division. An optimal path is planned by adopting a'shortest invalid path 'strategy: when a plurality of cutting sections of the same type are planned, the moving idle stroke of a cutting head is reduced through'connection of nearby endpoints', and the invalid driving time is shortened; meanwhile, the two groups of cutting heads respectively undertake the cutting tasks of the smooth cutting section and the fine cutting section, an asynchronous cooperation mode is combined, mutual waiting is not needed, the task time consumption difference of the two groups of cutting heads is reduced through a time difference optimal division strategy, load balancing is realized, and the collaboration of double-head cooperation and the overall machining efficiency are greatly improved.

The embodiment of the invention discloses an installation and maintenance work order planning method and electronic equipment. The method comprises the steps that target installation and maintenance work order information is acquired, and the target installation and maintenance work order information comprises identification information of one or more broadband access devices to be installed and maintained; according to the identification information of the one or more broadband access devices and a data storage library, determining positioning information of installation and maintenance places corresponding to the one or more broadband access devices in a map; according to the target installation and maintenance work order information, the positioning information of the one or more broadband access devices and a first shortest path planning algorithm, determining path planning information of installation and maintenance personnel for completing installation and maintenance of the one or more broadband access devices; and presenting the path planning information. Through the scheme, intelligent path planning and real-time position visualization of the installation and maintenance work order are realized, and the installation and maintenance efficiency and customer satisfaction of installation and maintenance personnel are effectively improved.

The invention discloses an unmanned ship global shortest path planning method based on a sparse graph, and the method comprises the following steps: 1) carrying out the initialization, and inputting a starting point, an end point, the vertex coordinates of all obstacles, and a safety distance; 2) eliminating a large number of irrelevant obstacles through an elliptical limited area and an obstacle screening mechanism so as to reduce the calculation scale; 3) constructing a path point candidate set through a method of adaptively generating feature points based on an obstacle vertex included angle and a safe distance; 4) determining a specific sorting strategy to rearrange the feature point list so as to guide the search direction of global path planning; 5) sequentially converting the feature points in the feature point list into nodes with specific structures, and adding the nodes into a node list to construct a path sparse graph; and 6) generating a global shortest path through a specific greedy optimization algorithm backtracking from the end point to the starting point. The method is an efficient calculation method for realizing global, safe and shortest path planning by constructing and searching a special sparse graph structure.

This invention discloses a global shortest path planning system and method for fixed-point inspection of intelligent inspection robots, relating to the field of intelligent operation and maintenance robot technology. This invention establishes a grid map of the computer room, configures multiple types of inspection points, constructs an inspection point database and a weighted topology graph, and uses Chebyshev distance-based modeling and ant colony algorithm to complete the global shortest path sequence planning. The robot performs inspections along the path sequence and executes obstacle judgment and corresponding obstacle avoidance post-processing strategies when encountering obstacles. It can automatically generate a global shortest path traversing all inspection points, effectively solving the technical problems of insufficient path planning optimization, inability to quickly replan the path after obstacle avoidance, and low inspection efficiency in existing technologies, thereby improving the intelligence level and operational efficiency of computer room inspection robots.

The application relates to the technical field of ship path planning, and particularly discloses a ship path planning method and system for exploring potential water surface dangerous areas, which comprises the following steps: acquiring known dangerous areas and potential dangerous areas; generating observation points on the edges of each potential dangerous area to obtain a set of potential observation points; establishing a visibility graph, wherein the nodes of the visibility graph are the observation points, the edges are paths between two observation points which do not pass through the known dangerous areas and the potential dangerous areas, and the edge weight is the length of the path; solving a TSP problem with group constraints by using an improved ant colony algorithm on the visibility graph to obtain a shortest path covering all the potential dangerous areas, which is used as a ship planning path. The application realizes shortest path planning of a ship in a target sea area to bypass the known dangerous areas and traverse the edges of all the potential dangerous areas, and realizes safe and efficient shortest path planning.

The present application provides a shortest route planning method and system, based on the AIS data of the target ship, and pre-processing the AIS data, then using a specific judgment method to screen the AIS data, then based on the pre-processed and screened data, using the grid method to construct a low-precision environment model, then using the ant colony algorithm to calculate the shortest path of the route in the low-precision environment model, and determining the shortest path grid range, reducing the unit grid width in the low-precision environment model to construct a high-precision environment model, and determining the shortest path grid range in the high-precision environment model according to the shortest path grid range in the low-precision environment model, finally using the A-star search algorithm to calculate the shortest path of the route in the shortest path grid range of the high-precision environment model, and using the Bezier curve method to optimize the shortest path of the route, obtaining the optimized shortest path of the route and displaying, which can greatly improve the precision of the environment model, and the time cost is low.

The invention relates to an LLM-combined official account travel strategy article background publishing method and system, and the method comprises the steps: obtaining a UGC article related to a target destination, carrying out the content analysis of the UGC article, recognizing the name of a scenic spot mentioned in the UGC article, and forming a target scenic spot set; obtaining corresponding scenic spot resource information according to the name field of each scenic spot in the target scenic spot set; based on the longitude and latitude data of each scenic region in the target scenic region set, generating a structured travel path by adopting a shortest path planning algorithm; generating corresponding travel strategy article content based on the structured travel path and the description information of the destination; preprocessing the target scenic spot picture, and generating illustration content based on a preset typesetting template; and storing the travel strategy article content and the illustration content in a background database, and pushing the travel strategy article content and the illustration content to a content publishing interface of the target official account platform through a background management interface. The method and the device have the effect of improving the intelligent generation capability of the travel strategy content.

The invention relates to the technical field of path planning, and provides a shortest path planning method for surface processing of a manipulator, which comprises the following steps: constructing a sequence tree for recording a shortest path propagation process starting from a source point, the edge node stores edge, mirror point and shadow segment information related to path propagation, the vertex node stores edge, mirror point and vertex information related to path propagation, or the vertex node stores vertex information and distance information related to path propagation; traversing the sequence tree, and extracting vertexes recorded in all vertex nodes to form an ordered vertex sequence; cutting the surface of the triangular mesh model along the shortest path from the source point to each vertex, and unfolding the triangular mesh model to the same plane to form an inward layout; and taking the mirror image points of the source points and the mirror image points of the pseudo source points corresponding to the vertex nodes in the sequence tree as seed points, generating local Voronoi graphs by using a divide-and-conquer algorithm, and combining the local Voronoi graphs to obtain a global Voronoi graph and a shortest path.

The invention provides an urban agglomeration multi-mode traffic network shortest path planning method and device, and relates to the technical field of intelligent traffic, and the method comprises the steps: obtaining traffic information in a target urban agglomeration area; modeling according to the traffic information to obtain a multi-mode traffic network model; performing trip mode feasibility constraint according to the multi-mode traffic network model to obtain a mode sequence feasibility rule; performing time sequence legality verification according to a mode sequence feasibility rule, and adjusting the departure time based on the arrival time to simulate the time table influence to obtain a path feasibility mechanism; and performing path search on the multi-mode traffic network model according to a path feasibility mechanism, maintaining a path label set under the condition of multiple transfer, and outputting a shortest path meeting feasibility constraints. The method can effectively solve the problems that feasibility verification of a traditional shortest path algorithm in a multi-mode traffic scene is difficult, a timetable cannot be modeled, and transfer cost evaluation is missing.

The invention relates to a grid quantization-based self-adaptive unrouted path planning system and a grid quantization-based self-adaptive unrouted path planning method. The grid quantization-based self-adaptive unrouted path planning system comprises a data layer, a logic operation layer and a control layer, the logical operation layer comprises the following steps: grid division: performing uniform square grid division on a to-be-planned region; grid quantitative scoring: constructing a navigation body trafficability scoring rule base, performing quantitative scoring in each grid, and finally superposing scores of various data; grid tile generation: generating tiles from the data after grid quantization to form multiple pieces of multi-level multi-resolution tile data; grid path planning: performing path calculation by utilizing a shortest path planning algorithm based on the tile grid data, and dynamically loading required tile data during path finding; and the application layer is used for carrying out operation control on the logic operation layer and carrying out result output control on an upper-layer application. The problems of single grid granularity, insufficient environment feature expression, weak dynamic planning capability and the like of a path planning technology are solved.

The application discloses a kind of even super-elliptic limit ring path planning methods under structured environment, first obtain structured two-dimensional prior map, rectangular fitting is carried out to the obstacle in map and each rectangular parameter is extracted;Second, determine the current most influential obstacle to the target point, according to the set porosity, determine the rectangular circumscribed super-elliptic frequency, build rectangular obstacle envelope even super-ellipse;Then establish the local coordinate system associated with the terminal point and obstacle, determine the solving direction of limit ring and solve the even super-elliptic limit ring trajectory, solve the coordinates of the current limit ring escape point;Finally, judge whether there is an obstacle between escape point and terminal point, if there is, continue to solve even super-elliptic limit ring for the next obstacle, otherwise, solve the trajectory to reach the terminal point;The method is assisted by the advantage of even super-ellipse, while maintaining flexibility and smoothness, has higher map space utilization, shorter path planning length.