Jump to Content
  1. Oxford
  2. MPLS
  3. Eng. Sci.
  4. ORI

Estimation, Search, and Planning (ESP) Research Group

Admissible heuristics for obstacle clearance optimization objectives (arXiv 2021)

Marlin has been working on planning problems that seek to optimize the distance between paths and obstacles. This is a difficult problem for informed search algorithms, like A*, because there aren't very many effective and cost-efficient admissible heuristics for obstacle clearance. He's written up a short technical note on an admissible heuristic for clearance in search space that you can find on arXiv.

Authors
  1. M. P. Strub
  2. J. D. Gammell
Title
Admissible heuristics for obstacle clearance optimization objectives
Publication
Type
Technical Report
Report Number
TR-2021-MPS001
Organization
Estimation, Search, and Planning (ESP) Research Group, University of Oxford
Date
PDFs
PDF

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.