Path Counting for Grid-Based Navigation

DOI10.1613/jair.1.13544OpenAlexW4283587045MaRDI QIDQ5094043

Jacobo Bibliowicz, Rhys Goldstein, Kean Walmsley, Simon Breslav, Azam Khan, Alexandre Tessier

Publication date: 2 August 2022

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

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

zbMATH Keywords

planningroboticsproblem solvingsearch

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Uses Software

• Anya

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Properties of a level set algorithm for the visibility problems
• A history and a survey of lattice path enumeration
• Visibility and its dynamics in a PDE based implicit framework
• A problem of arrangements
• Optimal Any-Angle Pathfinding In Practice
• Theta*: Any-Angle Path Planning on Grids
• Interior-point methods for optimization
• Using interpolation to improve path planning: The Field D* algorithm
• A Generalization of the Ballot Problem and its Application in the Theory of Queues
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• The 2^k Neighborhoods for Grid Path Planning
• Visibility Algorithms in the Plane

This page was built for publication: Path Counting for Grid-Based Navigation