Automatic route generation method based on sequential storage binary tree

• Main Authors: ZHANG KAILI, ZHAO YAN, ZHANG JINGJING, ZHANG YONGBING, YUAN RUBIN, FANG YUANYUAN
• Format: Patent
• Language: Chinese; English
• Published: 28.09.2021
• Subjects: CALCULATING; COMPUTING; COUNTING; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES; GYROSCOPIC INSTRUMENTS; MEASURING; MEASURING DISTANCES, LEVELS OR BEARINGS; NAVIGATION; PHOTOGRAMMETRY OR VIDEOGRAMMETRY; PHYSICS; SURVEYING; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR; TESTING

The invention relates to an automatic route generation method based on a sequential storage binary tree. The automatic route generation method comprises the following steps: step 1, initializing a binary tree node array and a route index array; 2, initializing a root node of the binary tree into a starting point; 3, judging whether a navigation obstructing area exists on the current test line or not, and if not, connecting the starting point and the terminal point to serve as an automatically generated route; if yes, completing sub-binary tree construction of the current test line; step 4, adding the left node and the right node of the sub-binary tree to the node array in sequence; 5, constructing a left sub-tree and a right sub-tree; step 6, in the binary tree construction process, adding the end point structural body to the node array every time the search of one feasible route is completed; and step 7, comparing and selecting the shortest feasible route according to the stored route index array and the nod