The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones

DOI10.1613/jair.5442zbMath1418.68228DBLPjournals/jair/Hew17OpenAlexW2749159846WikidataQ63353495 ScholiaQ63353495MaRDI QIDQ5370995

Patrick Chisan Hew

Publication date: 24 October 2017

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.5442

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

On approximating shortest paths in weighted triangular tessellations ⋮ Path-length analysis for grid-based path planning

This page was built for publication: The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones