Mobile robot obstacle avoidance navigation method and system
A mobile robot and robot technology, applied in the field of automation, can solve the problems of high maintenance cost, expensive hardware cost, unsuitable for robot development, etc., and achieve the effect of saving equipment cost, ensuring accuracy and effectiveness
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0075] Embodiment 1: A method for obstacle avoidance and navigation of a mobile robot.
[0076] figure 1 It is a flowchart of a method for obstacle avoidance and navigation of a mobile robot in Embodiment 1 of the present invention. Such as figure 1 As shown, the process includes the following steps:
[0077] Step 101, establishing a global map of the home environment.
[0078] The global map is the scope of the robot's activities, and it is marked with information such as the origin of coordinates, obstacles, and the scope of activities;
[0079] The global map is a grid map, a mesh graphic composed of a series of square grids, marking the information of the indoor environment;
[0080] The grid map records the position of the grid with the abscissa (X coordinate) and the ordinate (Y coordinate), and records the probability that each grid is occupied by obstacles with the CV value.
[0081] Step 102, setting the start point and end point of the robot movement.
[0082] ...
Embodiment 2
[0133] Embodiment 2: A method for planning a moving path of a robot according to the A* algorithm.
[0134] Figure 4 It is a flow chart of the method for planning the moving path of the robot according to the A* algorithm in the second embodiment of the present invention. Such as Figure 4 As shown, the method flow includes the following steps:
[0135] Step 201, put the starting point s into the open table;
[0136] Step 202, traversing child nodes in 8 directions around node s;
[0137] Step 203, judging whether the 8 child nodes are in the open table or the close table;
[0138] If the child node is in the open table, execute step 204;
[0139] If the child node is in the close table, execute step 206;
[0140] If the child node is not in the open table or the close table, perform step 208;
[0141] Step 204, recalculate the value of node h(n)+g(n) in the open table, and judge whether to decrease;
[0142] If it decreases, then execute step 205;
[0143] If no red...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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