Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

35results about How to "Efficient path planning" patented technology

Unmanned vehicle dynamic path programming method based on environment uncertainty

The invention discloses an unmanned vehicle dynamic path programming method based on environment uncertainty, comprising steps of establishing a vehicle kinetics model, establishing a dynamic environment model and necessary conditions for anew programming a path, obtaining a motion state original value of the unmanned vehicle, a vehicle motion state original target value and a vehicle motion state candidate target value, generating a candidate path, obtaining an optimal path through selection based on a safety index and a rapidity index, and reprogramming the optimal path of the unmanned vehicle when the unmanned vehicle motion environment satisfies the condition where the new path can be programmed. Compared with the prior art, the invention can not only satisfy the safety requirement for safety driving, but guarantees the driving efficiency under the constraint of the vehicle model. The invention realizes the coordination optimization of the performance index through distribution of various weights, realizes the real-time planning under the condition where a plurality of dynamic obstacles exist, and effectively improves the safety of the unmanned vehicle driving.
Owner:TONGJI UNIV

Unmanned vessel ant colony energy consumption optimal global path planning method based on electronic nautical chart

The invention provides an unmanned vessel ant colony consumption optimal global path planning method based on an electronic nautical chart. The method comprises the steps of 1, processing the electronic nautical chart, wherein after the electronic nautical chart is converted into the form of a file capable of being processed, a feasible area and an obstacle area of a map are determined, a visibility graph method is utilized to find out a set of feasible paths among an initial point, a target point and the vertex of an obstacle, it is guaranteed that the paths do not pass through an unfeasiblearea, and the sailing safety of the unmanned surface vessel is guaranteed; 2, building a motion math model, wherein the motion model of an unmanned vessel is built, and thus the thrust and motion characteristics of the unmanned vessel are grasped; 3, obtaining unmanned vessel data, wherein when the unmanned vessel sails on the water surface, information data like the heading, the vehicle body position and vertical acceleration of the vehicle is obtained; 4, utilizing an ant colony algorithm to search for a track meeting requirements; 5, building an unmanned surface vessel energy consumption model under ocean current disturbance, wherein with the optimal energy consumption being the premise, the ant colony algorithm is improved to obtain the path satisfying safe sailing conditions and having the smallest energy consumption. By comparing the paths under two preconditions, the effectiveness of the designed algorithm is proved.
Owner:HARBIN ENG UNIV

Driverless vehicle local path planning method based on model prediction

The invention discloses a driverless car local path planning method based on model prediction. The method comprises the steps: 1, establishing a driverless car kinematics model; 2, in the vehicle pathplanning process, achieving the approximation of a driving environment formed by a vehicle and an obstacle through multiple circles; 3, fitting a lane line and a road edge curve; 4, constructing a target function J, wherein a first item and a second item of the target function represent the deviation between the predicted value and the reference position of the center line of the main lane, the third item represents the deviation between the predicted output course angle and the main lane midline course angle so as to ensure that the vehicle course angle is the same as the road course angle and the front wheel turning angle does not change suddenly; 4, ensuring that the vehicle runs according to the reference speed; 5, in order to avoid obstacles existing on the current lane, avoiding thecollision. Compared with the prior art, the method guarantees the quick and efficient path planning, and facilitates the calculation of the shortest distance between the main vehicle and the surrounding vehicles and obstacles.
Owner:TIANJIN UNIV

Reverse engineering robot system

The reverse engineering robot system belonged to advanced manufacturing technique field comprises a detection head, a robot, a computer, a control cabinet, and a deflection machine. When user inputs basic detection parameters, the system programs automatically the scan path, controls robot, deflection machine and detection head to complete the detection. Wherein, it uses the robot control flexibility to realize the integrative path programming, uses the environmental adaptation ability and anti-noise ability of robot to satisfy industrial field require, and uses active automatic detection mode to realize automation and exploitability for post processing.
Owner:DALIAN MARITIME UNIVERSITY

Robot behavior control method based on virtual reality

The invention discloses a robot behavior control method based on virtual reality. The control method includes the steps of S1, after environmental data of a controlled robot is collected in real timeto obtain a robot environment map, constructing an environmental cost map of the robot according to the obtained robot environment map; S2, according to the constructed environmental cost map, planning an optimal path to an assigned target point, controlling the robot to move according to the planned path. The method has the advantages of being easy to control, small in demanded communication bandwidth, high in timeliness, control precision and efficiency, flexible to use and the like.
Owner:NAT UNIV OF DEFENSE TECH

Vehicle access path planning method and device in intelligent parking garage and storage medium

An embodiment of the invention discloses a vehicle access path planning method in an intelligent parking garage. A modeling method of an intelligent parking garage environment is presented, the AGV path planning problem is realized by combining the morphology dilation operation on the basis of modeling, and problems of dead locking, collision conflict and others during the path planning process are solved on the basis of a dynamic time window method. The method solves the environment modeling problem of the intelligent parking garage, and a map with similar environment as the parking garage can be manually generated instead of being generated by a sensor and the map can be used for the AGV work. The embodiment of the invention further provides a vehicle access path planning device in the intelligent parking garage, and a storage medium. By adopting the vehicle access path planning device in the intelligent parking garage and the storage medium, the vehicle access and parking tasks canbe smoothly completed within a short time on the basis of effectively avoiding the path resource competition and conflict. The method and the device have the advantages of high automation degree of vehicle access, high performance cost and high safety reliability, and the like.
Owner:SHANTOU UNIV

Mobile electronic device and method therein

A mobile electronic device comprises at least one depth camera, a wireless signal transceiver, an image processor, a map module, a positioning module and a movement module. The wireless signal transceiver is configured to obtain plane graphic information and distance information of an object in the graph collected by the at least one depth camera while the mobile electronic device moves, and sendmultiple three-dimensional information comprising the plane graphic information and the distance information to the image processor; the image processor is configured to process the received multiplethree-dimensional information; the map module is configured to obtain a task area map by drawing a three-dimensional task area image according to the multiple three-dimensional information obtained after processing of the image processor; the positioning module is configured to record the distance between the current position of the mobile electronic device and a coordinate origin in the task areamap; and the movement module is configured to plan a path according to the task area map and move according to the path.
Owner:VESTORCH TECH LTD

Fire escape path planning method and system based on extended A* algorithm

The invention belongs to the field of emergency path planning, and particularly relates to a fire escape path planning method and system based on an extended A* algorithm. The method comprises the steps of: collecting building floor data, modelling the environment of each floor, and obtaining an N*N-dimensional map of each floor of a building, the map comprising a free grid for identifying a passing area, an obstacle grid for representing an obstacle area and a fire behavior grid for representing a fire area; and obtaining an escape path of an escape person on the free grid by utilizing an A*algorithm, and when a plurality of minimum cost values appear at a certain point of the map, taking each point with the minimum cost value as a next point for expansion so as to obtain a branch with the minimum comprehensive cost value, and taking the branch as an optimal escape path. According to the method, the shortest escape path can be obtained conveniently to achieve the purpose of correct and timely personnel evacuation, the casualty degree in a fire can be greatly reduced in combination with intelligent escape guidance of a path planning algorithm, and high practicability is achieved.
Owner:PLA STRATEGIC SUPPORT FORCE INFORMATION ENG UNIV PLA SSF IEU

Big data-driven public place gathered crowd evacuation method and device

The invention discloses a big data-driven public place gathered crowd evacuation method and device. The method comprises the following steps of acquiring scene-related information data of a public place and crowd feature data of the public place, constructing a two-dimensional discrete map of the public place according to the scene related information data of the public place, according to the public place two-dimensional discrete map, setting navigation points, and constructing a path map, according to the position distribution of the navigation points, positioning the person by adopting a region positioning method based on multi-modal data to obtain the position information of the person, according to the crowd feature data of the public place, adopting a public place person classification method to classify people in the public place, and acquiring a classification result of crowds to be evacuated, setting navigation destinations according to classification results and person types, according to the navigation destination and the position information of the person, updating a path map, and generating navigation paths of all kinds of people, and obtaining the shortest effective distance from the navigation point on the three-dimensional map to the exit, and taking the shortest effective distance as an evacuation path.
Owner:枫树谷(成都)科技有限责任公司

Path planning method integrating dense convolution network and competitive architecture

The invention discloses a path planning method integrating a dense convolution network and a competitive architecture. The method includes the following steps that: a mobile robot samples mini-batch pieces of conversion information from an experience playback memory, and selects one of two fusion path planning networks as an online network and the other as a target network according to preset rules; the maximum value of a predicted target action value function is obtained through a predicted online action value function Q(s, a; w) and a corresponding greedy action; a loss function at a currenttime step is calculated according to the maximum value of the predicted target action value function and the predicted online action value function; and an online network weight w is updated with a stochastic gradient descent method according to the loss function. According to the path planning method of the invention, the dense convolution network and the competitive architecture form a more lightweight fusion path planning network, and therefore, model parameters are simplified, training costs are reduced, planning time is shortened, and the requirements of high-speed path planning can be satisfied to a certain extent.
Owner:UNIV OF SHANGHAI FOR SCI & TECH

Intelligent garbage monitoring and clearing method and device based on edge calculation

The invention discloses an intelligent garbage monitoring and clearing method and device based on edge calculation. A cloud server and a plurality of edge servers are arranged; setting an intelligentterminal at each garbage can, and periodically sending the acquired sensor information to an edge server through a communication module; a data monitoring module is arranged on the edge server, analyzes the data sent by the intelligent terminal, obtains various data of the garbage can, and respectively stores the data to a local database of the edge server and a database of the cloud server; man-machine interaction ends are arranged on an edge server and a cloud server respectively, services needing to be processed in real time are arranged on the edge server according to time delay requirements of the services, and other services are arranged on the cloud server; and the edge server carries out path planning by using the received data and sends the data to the garbage collection and transportation vehicle, and the garbage collection and transportation vehicle realizes garbage collection and transportation according to the planned path. Various states of the garbage can can be monitored, clearing and transporting path planning is facilitated, and whether fire hazards exist in the garbage can or not can be judged; a system architecture is reasonably set, and low delay is realized.
Owner:SUZHOU UNIV

Mobile robot path planning method based on network tearing method

The invention discloses a mobile robot path planning method based on a network tearing method. A connecting line from a starting point to a target point is used as a basic driving route. An obstacle network model is established by using a network tearing method and sub networks are torn; mathematical fitting is performed and minimum weights of a path and time of a mobile robot are calculated respectively; an optimal path plan of arriving at a next obstacle and going around the next obstacle by the mobile robot is obtained; and the basic route is adjusted. According to the invention, the mobilerobot path planning method is simple and clear and has high implementability. The mobile path can be corrected effectively based on the obstacle and the path can be adjusted timely and flexibly basedon newly added obstacle, so that the optimal path plan is realized. When the mobile robot moves, the collision with the obstacle is avoided effectively, so that the service life of the mobile robot is prolonged.
Owner:SHAANXI SCI TECH UNIV

Road condition query and taxi appointment system and method based on set top box

The invention discloses a road condition query and taxi appointment system based on a set top box. Real-time query of road conditions and planning of an optimal path can be achieved through network communication between the set top box and a large data center; besides, taxi appointment can be carried out through the set top box. The invention further discloses a road condition query method and a taxi appointment method based on the set top box. By the adoption of the system and method, the functions of the set top box are enriched, and travel of a user is also greatly facilitated.
Owner:UNIONMANTECH

Path planning method and device

PendingCN112000088AReduce triggersOvercome the problem that the collision avoidance ability cannot be guaranteedForecastingPosition/course control in two dimensionsPathPingAlgorithm
The disclosure provides a path planning method and device. The path planning method comprises the following steps: after determining a global path according to a starting point and an ending point, determining a plurality of local areas and a local starting point, a local ending point and a local scene of each local area; establishing an unconstrained optimization proposition corresponding to thelocal area according to the local starting point, the local terminal point and the local scene; generating a plurality of local paths as initial solutions of the optimization proposition comprising atrajectory curvature and a plurality of penalty functions; under each initial solution, setting the weights of a plurality of penalty functions to be the same and calculating a solution of the optimization proposition; when the solution does not meet a preset termination condition, adjusting the weights of a plurality of penalty functions and then continuously performing calculating by taking thesolution as an initial solution until an optimal solution meets the termination condition; and generating a plurality of local paths according to the optimal solution corresponding to each initial solution, and determining the optimal path of the local area in the plurality of local paths. The path planning method provided by the invention can reduce the collision risk of the robot.
Owner:BEIJING JINGDONG QIANSHITECHNOLOGY CO LTD

Mobile robot path planning method

The invention discloses a mobile robot path planning method. An EKF-SLAM algorithm optimized based on a Levenberg-Marquardt method, mobile robot global path planning based on a potential field ant colony algorithm, and an optimal path searching method integrating mobile robot global path planning and local path planning are provided; and after a robot simulation experiment, autonomous navigation of the indoor mobile robot is completed. Compared with a traditional method, the mobile robot path planning method has the following advantages: the stability and the positioning precision of the extended Kalman algorithm can be improved. And the effectiveness after improvement is verified in combination with a simulation experiment, so that a position prediction result is more accurate, and a better path plan is obtained.
Owner:ANHUI TECHN COLLEGE OF MECHANICAL & ELECTRICAL ENG

Method and system for managing real-time state of indoor map passing road section

ActiveCN114842661AQuickly determine locationQuickly determine lengthIndication of parksing free spacesParking spaceTraffic flow
The invention discloses a method and system for managing the real-time state of a passing road section of an indoor map, and the method comprises the steps: dividing all channels in a parking lot into a plurality of continuous road sections according to 5-7 meters, marking the road sections and intersections respectively, planning a preset route for entering or leaving vehicles according to the channels and parking spaces in the parking lot, acquiring a road section sequence and an intersection sequence of a preset route; determining an impassable section and an unavailable parking space, specifically, presetting a monitoring duration T and a fault threshold value; acquiring a real-time route of the vehicle, generating a to-be-confirmed section, judging whether the to-be-confirmed section is an initial fault section or not, accurately searching an impassable section from the initial fault section, and avoiding the impassable section and an unavailable parking space when a preset route is planned. The system can timely and effectively monitor the impassable sections in the parking lot, timely and effective path planning is carried out on the vehicles in the parking lot, the response speed is high, the time is short, and the system is especially suitable for indoor parking lots with large traffic flow and complex roads.
Owner:成都宜泊信息科技有限公司

Grid semantic map generation method and device and storage equipment

The invention provides a grid semantic map generation method, which comprises the steps: generating a global grid map of a current environment, and determining a final position of a node in the current environment on the global grid map, in the process of generating the global grid map, obtaining the relative position of the visual semantic information of the current environment and the current node; and according to the relative position, embedding the visual semantic information into the global grid map to generate a global grid semantic map. The map generated by the grid semantic map generation method provided by the invention not only can reflect the position information of the object in the current environment, but also can reflect the image information of the object in the current environment, so that the situation of the environment corresponding to the map can be reflected more accurately.
Owner:ECOVACS COMML ROBOTICS CO LTD

Target point allocating method for robot team formation

The invention discloses a target point allocating method for robot team formation. The method comprises the steps of 1) calculating a path length set of each robot to all target points according to position coordinates of each robot and the target points; 2) selecting elements from the path length sets of the robots according to a permutation and combination random drawing method to form a plurality of formation matrixes; 3) calculating the norm of each formation matrix and sorting, wherein the formation matrix corresponding to the minimum norm serves as the matrix with the shortest path of the team formation; and 4) judging whether the matrix with the shortest path of the team formation is the final target point allocating matrix or not and selecting the final target point allocating matrix to complete the target point allocating of the robot team formation. The method disclosed by the invention has the beneficial effects that while the obstacle avoidance can be realized, the high-efficiency team formation with the least time and path consumption, i.e., the team formation initialization, can be realized at the same time in an environment with obstacles, thereby achieving the optimal path planning.
Owner:SHAANXI SCI TECH UNIV

Time-space domain obstacle detection method and system for complex road scene

The invention discloses a time-space domain obstacle detection method and system for a complex road scene, and the method comprises the steps: collecting point cloud data and a detection result of a historical frame, and carrying out the preprocessing of the point cloud data; detecting the preprocessed point cloud data by adopting a deep learning method to obtain known type target information, and detecting by adopting a grid occupying method to obtain unknown type target information; performing spatial domain association fusion on the known type target and the unknown type target to obtain a detection result of the current frame; performing motion estimation on the detection result of the historical frame to obtain a motion estimation result of the historical frame; and performing time domain fusion based on the detection result of the current frame and the motion estimation result of the historical frame to update the detection result of the current frame target. According to the method, various obstacles of known types and unknown types appearing on the road can be better detected, and the method has better performance on detection of shielded targets, small-size targets and the like.
Owner:SUZHOU ZHIJIA SCI & TECH CO LTD

Method for optimizing and solving intelligent unmanned vehicle path planning problem based on multi-constraint correction C-W algorithm

The invention discloses a method for optimizing and solving an intelligent unmanned vehicle path planning problem based on a multi-constraint correction CW algorithm. According to the method, a simpleCW algorithm is modified, different constraint conditions such as weight limit, time windows and vehicle types are added to existing path optimization, and an intelligent unmanned vehicle delivery route is planned. According to the method, firstly, modeling is carried out on actual problems, then a corrected CW algorithm is used for solving the constraint problems of weight limitation and a timewindow in delivery route planning, and then different processing is carried out on planned routes according to different transport task optimization types, so that an optimal unmanned vehicle deliveryscheme is found.
Owner:XIANGTAN UNIV

A method and device for monitoring and removing smart garbage based on edge computing

The invention discloses a method and device for monitoring and clearing smart garbage based on edge computing. A cloud server and a plurality of edge servers are respectively set up; smart terminals are set at each garbage can, and the acquired sensor information is sent to the edge through a communication module on a regular basis. Server; set up a data monitoring module on the edge server, analyze the data sent by the smart terminal, obtain various data in the trash can, and store them in the local database of the edge server and the cloud server database respectively; On the human-computer interaction side, according to the delay requirements of the business, the business that needs to be processed in real time is set on the edge server, and other businesses are set on the cloud server; the edge server uses the received data to plan the path and send it to the garbage truck, the garbage The cleaning vehicle realizes the garbage removal according to the planned path. The invention can monitor various states of the trash can, which is not only beneficial to the planning of the cleaning and transportation path, but also can judge whether there is a fire hazard in the trash can; the system architecture is reasonably set to realize low delay.
Owner:SUZHOU UNIV

Optimal global path planning method for unmanned boat ant colony energy consumption based on electronic chart

The invention provides an electronic chart-based global path planning method for optimal energy consumption of unmanned ship ant colonies. 1. After processing the electronic chart and converting it into a processable file form, determine the feasible area and obstacle area of ​​the map, and use the visualization method to find out the set of feasible paths between the starting point, target point and obstacle vertices to ensure These routes do not pass through unfeasible areas to ensure the safety of navigation of unmanned surface vehicles. 2. Establish a mathematical model of motion, and establish a motion model of the unmanned ship, so as to realize the grasp of the propulsion and motion characteristics of the unmanned ship. 3. Unmanned boat data acquisition, when the unmanned boat sails on the water surface, it obtains information such as the course, hull position, and vertical acceleration of the ship; 4. Uses the ant colony algorithm to search for a track that meets the requirements. 5. Establish the energy consumption model of the unmanned surface vehicle under the interference of ocean currents, and improve the ant colony algorithm on the premise of optimal energy consumption to obtain the path that meets the safe navigation conditions and consumes the least energy.
Owner:HARBIN ENG UNIV

Path planning method and device for transmission pipeline and computing equipment

The invention discloses a path planning method and device for a transmission pipeline and computing equipment. The method comprises the steps: obtaining transmission resource data, and associating a resource point to a corresponding position point on an electronic map according to the transmission resource data; in response to an operation of selecting a pipeline planning starting point and an end point on the electronic map, determining at least two pipeline planning paths according to the starting point, the end point and the resource point; calculating cost values and difficulty values of path segments included in the at least two pipeline planning paths, and generating a weighted graph according to the cost values and the difficulty values of the path segments; according to the weighted graph, selecting a pipeline planning path formed by combining the path sections with the minimum total value of the sum of the cost values and the sum of the difficulty values as a target pipeline planning path; and presenting the planned path of the target pipeline on an electronic map. According to the scheme of the invention, the target pipeline planning path which enables the sum of the cost and the difficulty to be the lowest can be selected according to the double weights of the cost and the difficulty, so that the selected target planning path is more reasonable.
Owner:LIAONING MOBILE COMM +1

Robot obstacle avoidance method and system based on multi-sensor fusion estimation and iterative pre-search

The invention discloses a robot obstacle avoidance method and system based on multi-sensor fusion estimation and iterative pre-search, and the method comprises the steps: obtaining a pose measurement value of a robot according to the odometer data, position data and obstacle sensing data of the movement of the robot; according to the three-axis angular velocity and the three-axis acceleration of the motion of the robot, a pose prediction value of the robot is obtained; the pose of the robot is obtained according to the pose measurement value and the pose prediction value of the robot; judging whether the obstacle is located on a linear path of the current pose and the target point of the robot, if so, searching a motion path of the robot along the edge of the obstacle, respectively calculating cost values for the motion path, and taking the motion path with the lowest cost value as a middle target point, and carrying out calculation on the robot to the middle target point; and performing path planning from the middle target point to the target point. And real-time obstacle avoidance of the robot is realized.
Owner:SHANDONG YOUBAOTE INTELLIGENT ROBOTICS CO LTD

A method and system for internal road path planning

The invention provides a method and system for planning an internal road path, belonging to the field of traffic planning. The path planning method first constructs a road network according to internal road conditions, and adds the starting point and ending point of the current vehicle to the road network, constructs a path information set S, and adds the starting point of the vehicle to S; then takes all relevant road sections between the starting point and the ending point of the current vehicle , construct U and add all the edges corresponding to the relevant road sections and all nodes associated with the relevant road sections to U; take the newly added point in S as the key point, and mark all the candidate edges that can reach any point in U from the key point, And obtain the road condition information and road attribute information corresponding to the candidate edge; calculate the weight of the road section according to the road condition information and road attribute information, select the edge corresponding to the minimum weight value and the corresponding node to add to S; when S contains both the starting point and the ending point of the vehicle, output the plan path. The present invention simultaneously considers real-time traffic conditions and traffic rule constraints, avoids traffic jams as much as possible, and improves traffic transportation efficiency.
Owner:HUAQING KESHENG BEIJING INFORMATION 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
PatSnap group products