Robot Path Planning Using Preselected Reference Points
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Autonomous mobile robots face inefficiencies in path planning due to real-time calculation requirements, which are time-consuming and resource-intensive, especially when navigating through complex environments with obstacles.
Innovation Solution
A path planning system that preselects reference positioning points on a regional map, allowing the robot to analyze and select preplanned paths instead of calculating new paths in real-time, using predetermined rules to navigate between these points while avoiding obstacles.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If real-time path calculation is performed when receiving movement instructions, then the robot can adapt to dynamic environments, but the calculation process is time-consuming and reduces path planning efficiency
Solution Approach 1:
The system pre-calculates and stores multiple paths between all pairs of reference positioning points in advance. When the robot needs to navigate, it selects from pre-computed paths rather than calculating new paths in real-time, thus improving path planning efficiency while maintaining adaptability through multiple path options
Solution Approach 2:
The regional map is divided into multiple reference positioning points, and the path planning is segmented into: (1) selecting nearest reference points to start and end positions, (2) selecting optimal path between reference points from pre-computed options, and (3) generating detailed navigation path. This segmentation reduces real-time calculation burden
2Reliability
If multiple factors are considered in real-time path calculation, then the path can be optimized for various conditions, but the calculation complexity and time consumption increase
Solution Approach 1:
Multiple paths between reference positioning points are pre-calculated considering various factors (obstacles, distance, etc.) and stored for later selection. This preliminary action transfers computational burden from real-time operation to offline preparation, reducing calculation time while maintaining path optimization quality
Solution Approach 2:
The system changes the parameter of path representation from continuous geometric calculation to discrete selection from pre-computed options. Each pre-computed path is evaluated and stored with its characteristics, allowing fast selection based on current conditions without re-calculating from scratch
Data Source
AI summary
The disclosure discloses a path planning system and method for a robot, the robot and a medium. The method includes: preselecting, by the path planning system for the robot, one or more position points from paths on which the robot can move in a predetermined regional map as reference positioning points; and if an instruction of moving the robot from a first position point to a second position point is received, analyzing a path from the first position point to the second position point according to the set reference positioning points and according to a predetermined path analysis rule, and controlling the robot to move to the second position point on the basis of the analyzed path.