scientific article; zbMATH DE number 2088034

MaRDI QIDQ4739113zbMATH OpenFDO

Authors Peter Yap

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2338/23380044.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Theta^*: any-angle path planning on grids
• Comparision of 3 implementations of the A^* algorithm
• The 2ᵏ neighborhoods for grid path planning
• Path-length analysis for grid-based path planning
• scientific article; zbMATH DE number 914133

Cited in

(9)

• Path-length analysis for grid-based path planning
• Safe interval path planning and flatness-based control for navigation of a mobile robot among static and dynamic obstacles
• Mathematical Labyrinths. Pathfinding
• Parallelizable Global Quasi-Conformal Parameterization of Multiply Connected Surfaces via Partial Welding
• Path Counting for Grid-Based Navigation
• The 2ᵏ neighborhoods for grid path planning
• Regarding goal bounding and jump point search
• A comparison of distance metrics for the multi-objective pathfinding problem
• Generative models for grid-based and image-based pathfinding

This page was built for publication:

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