Path programming method based on A* algorithm capable of searching continuous neighborhoods
A path planning and algorithm technology, which is applied in navigation computing tools, measuring devices, instruments, etc., can solve problems such as local minimum calculation amount, and achieve the effects of shortening UUV paths, saving time, and improving accuracy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
specific example
[0063] The UUV sails from the starting point (10, 10) to the ending point (80, 80), the starting heading is 45°, and multiple obstacles O 1 ,O 2 .... Use the formula (1) to get the area of the obstacle, use the formula (2) to get the size of the grid, use the formula (3) to get the evaluation function. Then, use the evaluation function of the searchable continuous neighborhood A* algorithm to find the node with the smallest evaluation function in the searchable continuous neighborhood, and use it as the next waypoint to realize UUV route planning step by step. Simulation trajectory such as Figure 5 shown.
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