Path Counting for Grid-Based Navigation

DOI10.1613/JAIR.1.13544OpenAlexW4283587045MaRDI QIDQ5094043FDOQ5094043

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

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

Recommendations

• scientific article; zbMATH DE number 2088034
• Path-length analysis for grid-based path planning
• Counting paths in a grid
• Pathfinding through congruences
• Path planning using intervals and graphs
• Computing simple paths among obstacles
• Path Tracking in Motion Planning

zbMATH Keywords

planningsearchroboticsproblem solving

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites Work

• Optimal any-angle pathfinding in practice
• Theta\(^*\): any-angle path planning on grids
• A note on two problems in connexion with graphs
• A problem of arrangements
• Using interpolation to improve path planning: The Field D* algorithm
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Visibility Algorithms in the Plane
• A Generalization of the Ballot Problem and its Application in the Theory of Queues
• Properties of a level set algorithm for the visibility problems
• Interior-point methods for optimization
• Visibility and its dynamics in a PDE based implicit framework
• Title not available (Why is that?)
• A history and a survey of lattice path enumeration
• Elementary number theory
• The \(2^k\) neighborhoods for grid path planning

Uses Software

• Anya

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094043)