Admissible heuristics for obstacle clearance optimization objectives
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:3SCVW7K7record.jsonopen to challenge →
classification
cs.RO
keywords
admissibleclearanceheuristicsobjectiveobstacleoptimizationpathplanning
read the original abstract
Obstacle clearance in state space is an important optimization objective in path planning because it can result in safe paths. This technical report presents admissible solution- and path-cost heuristics for this objective, which can be used to improve the performance of informed path planning algorithms.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.