作者: Harsoveet Singh , Sadegh Tajeddin , Zichen Huang
DOI:
关键词: Control theory 、 Computer science 、 Path generation 、 Path (graph theory) 、 Obstacle 、 Space (mathematics) 、 Queue 、 Control theory
摘要: A method of dynamic path generation in a navigational controller includes: generating (i) plurality paths extending from starting location to goal location, and (ii) cost for each the paths; selecting, based on costs, an optimal execution storing subset costs history queue; responsive detecting obstacle during path, retrieving one determining initial re-planning search space retrieved initiating re-planned within space.