Regarding goal bounding and jump point search

DOI10.1613/JAIR.1.12255MaRDI QIDQ5856476zbMATH OpenOpenAlexFDO

Authors Yue Hu, Daniel Damir Harabor, Long Qin, Quanjun Yin

Publication date 26 March 2021

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

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

zbMATH Keywords

heuristicsproblem solvingroboticssearch

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• Optimal any-angle pathfinding in practice
• Theta^*: any-angle path planning on grids
• Fast optimal and bounded suboptimal Euclidean pathfinding
• scientific article; zbMATH DE number 2088034
• Computing the shortest path: A^ search meets graph theory

Cites work

• A Back-to-Basics Empirical Study of Priority Queues
• Compressing optimal paths with run length encoding
• Computing the shortest path: A^ search meets graph theory
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Enhanced partial expansion A^*
• Fibonacci heaps and their uses in improved network optimization algorithms
• Geometric containers for efficient shortest-path computation
• scientific article; zbMATH DE number 5734722 (Why is no real title available?)
• scientific article; zbMATH DE number 2238822 (Why is no real title available?)
• Introduction to algorithms
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• The fast downward planning system
• The pairing heap: A new form of self-adjusting heap

Cited in

(1)

• Generative models for grid-based and image-based pathfinding

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: Regarding goal bounding and jump point search

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