"The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to ..."

Patrick Chisan Hew (2017)

> Home

Details and statistics

DOI: 10.1613/JAIR.5442

access: open

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jair/Hew17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jair/Hew17
Patrick Chisan Hew:
The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones. J. Artif. Intell. Res. 59: 543-563 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.