Product
Patsnap Eureka
For R&D, Patsnap Eureka makes reading and utilizing patents & technical documents easy.
Patsnap Eureka AIR
Designed for self-driven R&D workflows. Generate viable solutions, solve complex R&D challenges, empower your innovation with AI.
Patsnap Eureka Materials
Designed for material experts only. Revolutionize your material R&D, from search, analyze, to developing new materials.
Feature
TechResearch
Generate reliable direction feasibility study reports for your R&D in just a few steps.
TechSeek
Discover and master advanced knowledge NOW. Basics, ideas, possibilities, all at once.
TechMind
As an expert in R&D Theories, TechMind can generates customized viable solutions instantly.
TechRisk
Analyze your overall solution with one click, know your potential R&D risks in advance.
TechMonitor
Get weekly tech updates, stay abreast of the latest tech innovations and key insights.
Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
60results about How to "Fast planning" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
Uniform angle division orthodontic arch wire bending sequence planning method
The invention discloses a uniform angle division orthodontic arch wire bending sequence planning method and relates to the technical field of orthodontic arch wire bending techniques. The uniform angle division orthodontic arch wire bending sequence planning method is provided according to individual orthodontic arch wire curves of patients, on the basis of an orthodontic arch wire curve formationcontrol point information set and a robot movement information set of formation control points and with the combination of characteristic that an orthodontic arch wire is bent by using a robot. The method is technically characterized by comprising the following steps: according to the individual orthodontic arch wire curves of patients, inputting the orthodontic arch wire curve formation controlpoint information set M and the robot movement information set N of the formation control points into an orthodontic arch wire bending system; dividing the individual orthodontic arch wire curves; andsequencing divided uniform division domains.
Owner:HARBIN UNIV OF SCI & TECH
Time-optimal route planning method based on improved level set algorithm
ActiveCN106503837ATake advantage ofEffectively foundForecastingGeographical information databasesAnalysis dataRoute planning
Owner:HARBIN ENG UNIV
Method for planning obstacle avoidance motion of UAV under cruise mission
ActiveCN110320933ALarge cruising areaNarrow down the search spacePosition/course control in three dimensionsDecision modelObstacle avoidance
The invention discloses a method for planning obstacle avoidance motion of a UAV under a cruise mission. The method comprises steps of performing rasterizing modeling on a global environment, establishing a risk evaluation function, producing global track points by using an improved A star algorithm, introducing UAV speed constraint and maximum yawing rate constraint in the A star algorithm, smoothing discrete points by using a Doberman curve, and for emergent obstacles, avoiding the obstacles in real time by using a geometric position relationship and the Doberman curve. In the method, control policies of the UAV are modelled by using a Markov decision model, so as to determine an optimal manoeuvre for avoiding the obstacle. Through adoption of the method, the UAV can rapidly figure out asafe track according to the position of the known obstacle, can respond to sudden barriers and perform the optimal manoeuvre, so as to avoid colliding with an obstacle.
Owner:NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
Two-dimensional route planning method for UUV to geometrically bypass circular barriers
ActiveCN105843234AImprove planning efficiencyFast planningAltitude or depth controlRoute planningPlanning approach
The invention provides a two-dimensional route planning method for a UUV to geometrically bypass circular barriers. The method comprises the following steps: 1, reading a route origin Ob, a route terminal point Oe and parameters of each circular barrier from a mission text; 2, performing expansion processing on each circular barrier, and calculating the parameters of each circular barrier after expansion; 3, establishing a bypassing point set S, making a planning current point Oc to be a starting point Ob, and placing the starting point in the bypassing point set S; 4, if the planning current point Oc is the route terminal point Oe, or the planning current point Oc and the route terminal point O2 are visual, skipping to the sixth step, and otherwise, executing the fifth step; 5, performing geometric bypassing on a circular barrier closest to the planning current point Oc, obtaining a bypassing point, placing the bypassing point in the bypassing point set S, updating the planning current point Oc, and skipping to the fourth step; and 6, placing the route terminal point Oe in the bypassing point set S, and at the moment, planning ends. According to the invention, bypassing of the circular barriers is realized through a simple geometric principle, and the UVV can rapidly and efficiently obtain a safe bump-free two-dimensional route in a complex environment with multiple circular barriers.
Owner:HARBIN ENG UNIV
Method and device for planning neighbouring areas
The embodiment of the invention discloses a method and a device for planning neighbouring areas, which is used for improving planning efficiency and lowering cost. The method of the embodiment of the invention comprises the following steps: acquiring the network topology parameters of each sector; acquiring a sector the distance between which and a first sector is smaller than or equal to the preset maximum distance to serve as a candidate sector in reference to the network topology parameters; calculating the orientation weight value between the first sector and each candidate sector and the number of the layers between the first sector and each candidate sector according to the network topology parameters; calculating the topology fraction of each candidate sector relative to the first sector according to the orientation weight value and the number of the layers; and taking the corresponding candidate sector as the neighbouring area of the first sector according to the topology fraction. The embodiment of the invention also provides the device for planning the neighbouring areas. The embodiment of the invention has the advantages of being capable of effectively improving the planning efficiency and lowering the cost.
Owner:HUAWEI TECH CO LTD
Path planning method and device
ActiveCN110231044AFast planningReduce the amount of planning calculationsInstruments for road network navigationProgram planningGreedy algorithm
The application discloses a path planning method and device. The method includes the following steps of: clustering each task point based on the distance between the task points corresponding to at least one to-be-delivered order; setting constraint conditions according to a plurality of task point sets obtained by clustering; and according to the greedy algorithm and the set constraint conditions, aiming at maximizing the order delivery efficiency, inserting each task point into a path corresponding to a user to obtain a trial planning path corresponding to the user, wherein the constraint conditions can exclude part of optional insertion schemes for inserting the task points, so that the process of completely trying all the optional insertion schemes is not required; and then, adjustingthe trial planning path to obtain a planning result path corresponding to the user according to the planned arrival time corresponding to each task point and the estimated arrival time corresponding to each task point determined based on the trial planning path. Thereby, the scheme provided by the specification is conducive to reducing the calculation amount of path planning and improving the speed of path planning.
Owner:BEIJING SANKUAI ONLINE TECH CO LTD
An Orthodontic Archwire Bending Sequence Planning Method Based on Equiangular Partitioning
Owner:HARBIN UNIV OF SCI & TECH
Multi-moving time-sensitive target reconnaissance path planning method for unmanned aerial vehicle group
ActiveCN111024080AFast planningReduce solution space complexityNavigational calculation instrumentsPath planReal-time computing
The invention discloses a multi-moving time-sensitive target reconnaissance path planning method for an unmanned aerial vehicle group. The method comprises the following steps: 1, constructing a reconnaissance area map environment; 2, constructing an initial search area unit; 3, expanding a search area online; 4, terminating conditions; 5, outputting an unmanned aerial vehicle path; 6, updating targets, if all the targets in the target linked list are planned, completing the task, and ending the task; otherwise, taking out the next target G from the target linked list, and continuing the step7; 7, judging the intersection of the new target and the searched area; and 8, updating information of the searched area. The method has the advantages that the path planning method for reconnaissancetasks of a plurality of moving time-sensitive targets in the task area can meet the real-time requirement of unmanned aerial vehicle path planning in a large range and with high precision, dynamic tracking and fastest arrival of the moving time-sensitive targets are achieved, and therefore the cooperative task efficiency of a swarm intelligence unmanned system is improved.
Owner:中国人民解放军军事科学院评估论证研究中心
UUV 2D sea route planning method based on geographical circumvention theory
ActiveCN105929824ALess planning informationImprove planning efficiencyPosition/course control in two dimensionsCurrent pointRoute planning
The invention provides a UUV 2D sea route planning method based on the geography circumvention theory. The method comprises the following steps: 1. reading parameters of a sea route origin point Ob, a sea route terminal point Oe and each barrier from a mission text; 2. conducting expansion processing on barriers, calculating parameters of each expanded barrier; 3. establishing a set of circumvention points S; 4. if the current point Oc is planned to be the sea route terminal point Oe, or the current point Oc and the sea route terminal point Oe are planned to be visible, turning to step 6, and if not, executing the step 5; 5. searching for the barrier which is nearest to the current point Oc, based on the shape of the barrier, circumventing the barrier, obtaining circumvention points and putting the circumvention points to the set of the circumvention points S, updating the planning of the current point Oc, turning to the step 4; 6. putting the sea route terminal point Oe to the set of the circumvention pints S; 7. conducting subduction on the set of circumvention points S, which completes the planning. According to the invention, the method implements circumvention of the barriers through a simple geography theory, and enables the UUV to obtain a safe and untouched 2D sea route in a rapid and efficient manner in an environment with complex barriers.
Owner:HARBIN ENG UNIV
Multi-agent task allocation method based on income maximization
ActiveCN111311049AFast planningReduce the populationInternal combustion piston enginesResourcesSimulationGenetics algorithms
The invention discloses a multi-agent cooperative task assignment method based on income maximization under the condition of considering the difference of agents. The method takes a set as a model; for a defense penetration task and a detection task, an index value of defense penetration efficiency evaluation is provided, how to effectively realize detection of the area is provided, a task allocation function model is established based on constraint conditions, task selection scheme solving based on a genetic algorithm is performed on a target function under the constraint conditions, and an optimal solution set can be obtained. In a complex battlefield environment, the tasks are quickly allocated according to the defense penetration capability and detection capability of the unmanned aerial vehicle and the task target condition, so that the income is maximized.
Owner:NANJING UNIV OF SCI & TECH
Path planning method and path planning device
ActiveCN112673234AImprove path qualityFast planningInstruments for road network navigationExternal condition input parametersArtificial intelligenceControl theory
The invention discloses a path planning method, which is used for realizing obstacle avoidance path planning and can improve the quality of a planned path. The method comprises: acquiring road information, and an initial position and a destination position of a target object (401); determining a Cartesian coordinate system, a Frenet coordinate system and a mapping relationship between the Cartesian coordinate system and the Frenet coordinate system according to the road information; obtaining a path quality index function based on a Frenet coordinate system based on the mapping relationship, wherein the path quality index function is a quadratic function; according to the path quality index function based on the Frenet coordinate system and the initial position and the target position of the target object, determining a target path based on the Frenet coordinate system by utilizing quadratic optimal planning; and according to the mapping relationship, converting the target path into a Cartesian coordinate system (406), the target path being used for path planning control of the target object.
Owner:HUAWEI TECH CO LTD
UUV cluster formation pattern forming method based on circumferential hierarchical planning
ActiveCN110580057AAvoid collisionAvoid Maneuvering ChaosPosition/course control in three dimensionsEnvironmental geology
Owner:HARBIN ENG UNIV
Sensor measurement viewpoint planning method in automatic three-dimensional measurement of surface structured light
ActiveCN109163674AAvoid calculation errorsSmall amount of calculationUsing optical meansThree dimensional measurementMass parameter
The invention belongs to the technical field of three-dimensional measurement, and discloses a sensor measurement viewpoint planning method in automatic three-dimensional measurement of surface structured light. The method comprises the steps of: (a), packaging a three-dimensional structural model of an object to be measured by adopting multiple cube volume blocks; (b), constructing six semi-spheres and candidate measurement viewpoints in each volume block; (c), intersecting the single volume block with the three-dimensional structural model to obtain multiple spline surfaces, and solving thecentral point, the average normal vector and the area of each spline surface; (d), calculating the zenith angle and the azimuth angle of the average normal vector of each spline surface in the singlevolume block in a three-dimensional coordinate system, and determining an area, which each spline surface belongs to; (e), calculating measurement quality parameters of the candidate measurement viewpoints; and (f), comparing the quality parameter of each candidate measurement viewpoint with the pre-set threshold value, so that the required measurement viewpoint is obtained. By means of the sensormeasurement viewpoint planning method in automatic three-dimensional measurement of surface structured light in the invention, the calculation process is simple; the automation degree is high; and the sensor measurement viewpoint planning method is suitable for planning measurement viewpoints of complex parts.
Owner:HUAZHONG UNIV OF SCI & TECH
Robot path planning method based on improved fireworks explosion algorithm
ActiveCN110162060AFast planningFast convergencePosition/course control in two dimensionsSimulationArtificial intelligence
The invention discloses a robot path planning method based on an improved fireworks explosion algorithm. The method comprises the steps of initializing a fireworks population, and generating multiplepaths of a robot from an origin to a destination; performing mutation operation on the fireworks population; moving each fireworks path to the position of a first optimal fireworks path according to acrossover probability; mapping the fireworks paths covering infeasible regions; selecting a second optical fireworks path; judging whether a current iteration number reaches the maximum, and if yes,outputting the second optical fireworks path; and otherwise, further selecting the N-1 fireworks paths from the mapped fireworks population for explosion, generating the new path of the robot from theorigin to the destination, and thus acquiring the next generation fireworks population. Through defining the crossover probability, each fireworks path has a certain probability of being crossed withthe optimal fireworks path, and moves to the position of the optimal fireworks path, the convergence speed is improved, the robot path planning speed is improved, and the path planning efficiency isimproved.
Owner:BEIJING INSTITUTE OF TECHNOLOGYGY
Method and equipment for determining adjacent cells
The embodiment of the invention relates to the technical field of wireless communication, in particular to a method and equipment for determining adjacent cells. The method and equipment for determining the adjacent cells solve the problems in the prior art that planning of the adjacent cells is high in cost, and the planning speed is slow. The method for determining the adjacent cells comprises the steps that for a planning cell, candidate adjacent cells of the panning cell are determined from all the target cells according to the antenna angle of each target cell; a coverage subregion, belonging to each candidate adjacent cell, of the planning cell is determined; according to the number of base stations between the candidate adjacent cells and the planning cell in the coverage subregions, updating processing is carried out on the candidate adjacent cells of the planning cell; the adjacent cells of the planning cell are determined from the updated candidate adjacent cells of the planning cell. By means of the technical scheme of the method and equipment for determining the adjacent cells, the cost of planning of the adjacent cells can be lowered, and planning speed is improved.
Owner:DATANG MOBILE COMM EQUIP CO LTD
Navigation route generation method and device for automatic drive, and automatic driving system
ActiveCN110427027AFast planningReduce data volumePosition/course control in two dimensionsVehiclesPath generationCritical position
The invention provides a navigation route generation method and device for automatic drive, and an automatic driving system, and belongs to the field of the automatic drive. The generation method comprises the following steps: acquiring related information of a planning path on a navigation map; mapping the related information of the planning path to a previously acquired high-precision map, and acquiring high-precision path information corresponding to the related information of the planning path on the high-precision map; screening out key location points at least including the intersectionlocation from the high-precision path information; inserting the preset amount of supplementary location points between the key location points, wherein the supplementary location point is extracted from the high-precision path information; computing according to the information of the key location point and the supplementary location point and generating a global navigation path for the automaticdrive. The navigation route generation method and system and the automatic driving system provided by the invention can improve the efficiency of generating a follow-up path for automatic driving, the flexibility and the instantaneity.
Owner:ZHEJIANG GEELY AUTOMOBILE RES INST CO LTD +1
Method for path planning of equipped vehicle based on transfer learning
ActiveCN110631596AFast planningInstruments for road network navigationRoute planningDeep neural networks
The invention belongs to the technical field of vehicle path planning, and in particular relates to a method for path planning of an equipped vehicle based on transfer learning. The method comprises the following steps of S1, obtaining basic data of the equipped vehicle; S2, obtaining planning time and a planning goal; S3, obtaining static planning environment data; S4, obtaining equipped vehicledriving data; S5, constructing a path planning model by using a DDPG (Deep Deterministic Policy Gradient) algorithm; S7, obtaining parameter variation data of a dynamic planning environment; S8, constructing a dynamic planning environment domain; S9, slightly adjusting parameters of a deep neural network; S10, with the trained network parameters as input of a path planning algorithm, obtaining theterrain and intelligence data in a battle in real time, and constantly adjusting planning strategies to generate a route planning result for the equipped vehicle; and S11, obtaining the path planningresults of different battlefield environments through the dynamic planning environments in different battles, and taking the path planning results and the corresponding network training parameters thereof as historical samples.
Owner:TAIYUAN UNIV OF TECH
Original ecological food transport scheduling system and method
The invention discloses an original ecological food transport scheduling system and method. The transport scheduling method comprises information acquisition, path planning, order generation and transport feedback. The information acquisition comprises obtaining all order information in a server database, and for each order, drawing a user ID, a user credit accumulated score, a product ID included in the order, the weight of each product, a departure place, a transport destination, a distance between transport destinations and a road condition weight between a destination and the transport destination; a path planning module is used for calculating the weight of each transport destination, marking each transport destination on a map, according to the weights, searching for closed transport paths, and establishing a transport path set; and expected delivery time of each transport path is calculated according to a preset value; and the transport path set is sent to each store distribution end, and each store distribution end selects its own road. The original ecological food transport scheduling system and method have the advantages of high intelligentization, accurate path planning, high distribution efficiency and the like.
Owner:周欢
Image recognition method based on deep learning
PendingCN111797748AEasy accessReduce labor costsNeural learning methodsCharacter recognitionPattern recognitionAlgorithm
The invention relates to an image recognition method based on deep learning, and the method comprises the steps: S1, obtaining the corner information and character information of a to-be-recognized house type image, inputting the corner information into a quadratic programming model, and obtaining the connection information of wall lines and doors and windows, wherein the quadratic programming model is pre-established and comprises a plurality of corresponding corner point connection rules and a model of constraint conditions of a position relationship between a wall line and a door and window; S2, inputting the connection information of the wall lines and the doors and windows into a graph theory optimization model, and obtaining region composition information of each room region in the house type graph, wherein the graph theory optimization model is a Graham algorithm model which is established in advance and is improved based on graph theory knowledge; and S3, matching the characterinformation with the region composition information to obtain an recognition result. The problems that in the prior art, the house type image recognition result precision is not high, the recognitionprocess calculation is complex, and the expansibility is poor are solved.
Owner:北京比邻弘科科技有限公司
Spatial motion planning method of multi-degree-of-freedom robot
ActiveCN112428274AAvoid oversizingReduce running timeProgramme-controlled manipulatorTotal factory controlSimulationRobot end effector
The invention discloses a spatial motion planning method of a multi-degree-of-freedom robot. The method comprises the following steps: S1, acquiring initial state information of the robot, and acquiring spatial information of the robot, surrounding environment obstacles and task targets; S2, determining a feasible region, and calculating optimal posture information and feasible posture information, wherein the feasible region is a spatial region which is formed by combining the position of the task target with the optimal posture or the feasible posture of the robot, the surrounding environment obstacles and other task targets, and in the feasible region, the robot can complete the designated task target; and S3, judging whether a proximity vector of a robot end effector can fall into thefeasible region or not, if the proximity vector of the robot end effector can fall into the feasible region, executing a planning task in the optimal posture or the feasible posture by the robot, andif the proximity vector of the robot end effector cannot fall into the feasible region, reselecting the task target. According to the spatial motion planning method, excessive planning of the robot isavoided or reduced through posture analysis, the operation efficiency of the robot is improved, and the real-time requirement in industrial control is better met.
Owner:张耀伦
2D route planning method for UUV to round rectangular obstacles geometrically
ActiveCN106020213ALess planning informationImprove planning efficiencyAltitude or depth controlRoundingSimulation
The invention provides a 2D route planning method for a UUV to round rectangular obstacles geometrically. The method comprises the following steps: S1, reading a route start point Ob, a route end point Oe and the parameters of rectangular obstacles from a mission text; S2, expanding the rectangular obstacles, and calculating the parameters of the rectangular obstacles after expansion; S3, building a rounding point set S, letting a planned current point Oc be the start point Ob, and putting the planned current point Oc in the rounding point set S; S4, if the planned current point Oc is the route end point Oe or the planned current point Oc and the route end point Oe are visible, going to S6, or, executing S5; S5, geometrically rounding the rectangular obstacle nearest to the planned current point Oc to get rounding points, putting the rounding points in the rounding point set S, updating the planned current point Oc, and going to S4; and S6, putting the route end point Oe in the rounding point set S, and ending planning. According to the invention, rectangular obstacles are rounded based on a simple geometric principle, and a UUV can get a safe and collision-free 2D route quickly and efficiently in a complex environment with multiple rectangular obstacles.
Owner:HARBIN ENG UNIV
Obstacle data processing method and device, electronic equipment and computer readable medium
The embodiment of the invention discloses an obstacle data processing method and device, electronic equipment and a computer readable medium. A specific embodiment of the method comprises the steps of obtaining a point cloud data set obtained by scanning of a target vehicle-mounted laser radar; performing clustering processing on the point cloud data in the point cloud data set to generate a first obstacle information set; generating a second obstacle information set according to the target deep learning model and the point cloud data set; generating an obstacle feature distance matrix; obtaining a third obstacle information set; obtaining a fourth obstacle information set; obtaining a fifth obstacle information set; obtaining a combined obstacle information set; and sending the combined obstacle information set to the target terminal for display. According to the embodiment, the accuracy of obstacle detection is improved.
Owner:禾多阡陌科技(北京)有限公司
Dynamic MBSFN decision method and device based on mobile network
ActiveCN101841774BSave resourcesReduce distractionsEnergy efficient ICTPower managementFrequency spectrumSignal-to-noise ratio (imaging)
Owner:CHINA UNITED NETWORK COMM GRP CO LTD
Intelligent mechanical arm obstacle avoidance method and system for human-computer safety interaction and robot
ActiveCN111168681AFast planningTimely and effective obstacle avoidance strategyProgramme controlProgramme-controlled manipulatorSimulationMan machine
The invention provides an intelligent mechanical arm obstacle avoidance method and system for human-computer safety interaction and a robot. The robot monitors an identification code on an obstacle inreal time through an identification code visual positioning method to obtain the position of the obstacle; and the motion state of the obstacle is calculated through the position detection result andthe position change of the obstacle, and a corresponding obstacle avoidance strategy is adopted according to the motion state of the obstacle. According to the method, the mechanical arm can make different obstacle avoidance strategies for obstacles in different motion states or human limbs, compared with an existing obstacle avoidance method, the method gets rid of the limitation of environmentmodeling, the planning speed is high enough, and a timely and effective obstacle avoidance strategy can be made for sudden obstacles and dynamic obstacles in a working space.
Owner:SHANDONG UNIV
DSM model-considered multi-unmanned aerial vehicle cooperative three-dimensional flight path planning method
PendingCN114812553AFast planningLow costNavigational calculation instrumentsPosition/course control in three dimensionsSimulationGenetics algorithms
The invention provides a multi-unmanned aerial vehicle cooperative three-dimensional flight path planning method, which comprises the following steps of: firstly, calculating by using a minimum outsourcing convex polygon algorithm to obtain an abstract minimum convex hull of a target operation area, generating a polygonal area with a specific number of edges by using a convex polygon simplified algorithm, then segmenting the area, performing Z-shaped coverage on each area, and finally performing multi-unmanned aerial vehicle cooperative three-dimensional flight path planning. The method comprises the following steps: determining a flight mission area of each unmanned aerial vehicle, discretizing the flight mission area into abstract graph nodes, establishing a flight path evaluation function, and solving an optimal flight path by utilizing the evaluation function in combination with a genetic algorithm. And finally, obtaining three-dimensional data according to the DSM model and exporting the three-dimensional data as KML data. The method makes full use of the DSM model, the fast convex hull algorithm, the region segmentation and coverage algorithm and the genetic algorithm, has the characteristics of high planning speed, low cost, high precision and good coverage effect, and also has an obvious optimization effect on multi-unmanned aerial vehicle coordinated planning and full-track coverage. And an effective flight path planning method is provided for the field of flight path planning of multiple unmanned aerial vehicles.
Owner:WUHAN UNIV
A reconnaissance path planning method for multi-moving time-sensitive targets by UAV swarms
ActiveCN111024080BFast planningReduce solution space complexityNavigational calculation instrumentsSimulationUncrewed vehicle
Owner:中国人民解放军军事科学院评估论证研究中心
Truck navigation on-way traffic restriction data preprocessing method
ActiveCN113393055AReduce consumptionSmall footprintInternal combustion piston enginesForecastingData matchingSimulation
The invention relates to the technical field of truck navigation, and discloses a truck navigation on-way traffic restriction data preprocessing method. The method comprises the following steps: S1, establishing a binary tree, and initializing a root node of the binary tree; S2, inputting truck traffic restriction data; S3, matching the truck traffic restriction data to the road section of the bottommost road network; S4, storing the matching result of the bottommost road network into a binary tree; S5, according to a matching result of the bottommost layer road network, matching the truck traffic restriction data to a corresponding upper layer road section; S6, storing a matching result in the step S5 into a binary tree by taking the road network level and the road section number as indexes; S7, performing inorder traversal on the binary tree, and storing truck traffic restriction data corresponding to all road sections in all hierarchical road networks as a data file A; S8, establishing indexes for all road sections in all the hierarchical road networks, wherein the indexes comprise the corresponding truck traffic restriction data quantity and the storage address of the truck traffic restriction data, and the indexes are stored as an index file B.
Owner:苏州清研捷运信息科技有限公司
Intelligent path planning method and apparatus, and computer-readable storage medium
PendingCN110274608AFast planningPrecise path planning functionInstruments for road network navigationPulse frequencyPath plan
The invention, which relates to the artificial intelligence technology, discloses an intelligent path planning method. The method comprises: receiving a map image with an obstacle marked and an initialized speed; carrying out grid division on the map image with the obstacle marked, setting an initialized position and a destination position, and generating pulse frequency ft, a pulse emissivity Rt and a loudness At randomly; calculating an optimal direction solution X* in an initial grid and a next time position and generating a uniform distribution random number rand; determining a value relationship between the uniform distribution random number rand and the initialized pulse emissivity Rt and loudness At till location of the predicted position and the destination position in the same grid; and then completing an optimal path by combining predicted positions of all time and outputting the optimal path. In addition, the invention also puts forward an intelligent path planning apparatus and a computer-readable storage medium. Therefore, the precise intelligent path planning function can be realized.
Owner:ONE CONNECT SMART TECH CO LTD SHENZHEN
Passage path planning method, device, equipment and readable storage medium
ActiveCN109739219BFast planningSmall amount of calculationAutonomous decision making processRoad vehicles traffic controlSimulationReal-time computing
Owner:APOLLO INTELLIGENT DRIVING (BEIJING) TECHNOLOGY CO LTD
A path planning method and device
ActiveCN110231044BFast planningReduce the amount of planning calculationsInstruments for road network navigationPathPingGreedy algorithm
Owner:BEIJING SANKUAI ONLINE TECH CO LTD
Who we serve
- R&D Engineer
- R&D Manager
- IP Professional
Why Patsnap Eureka
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com