An example operation includes one or more of, determining an initial position and at least one vehicle constraint, predetermining a distance to a new position, determining a minimum turn radius based on the at least one vehicle constraint, selecting a vehicle turn radius that is at least as large as the minimum turn radius, determining a candidate position based on the at least one vehicle constraint and the vehicle turn radius, verifying whether the candidate position is valid with respect to the new position and converting the new position to the candidate position.
Breadth first search-depth first search three dimensional rapid exploring random tree search with physical constraints
2022-08-30
Patent
Electronic Resource
English
European Patent Office | 2021
|A Randomized Queueless Algorithm for Breadth-First Search
British Library Online Contents | 2008
|Parallel Evaluation of a Deductive Query with a Breadth-first Search Strategy
British Library Online Contents | 2000
|Breadth-First Search-Based Remaining Range Estimation and Representation for Electric Vehicle
SAE Technical Papers | 2014
|Optimization of Breadth-First Search Algorithm for Path Solutions in Mazyin Games
BASE | 2021
|