a* search

Fast and Stronger Lower Bounds for Planar Euclidean Shortest Paths IJCAI 2025 Planning from Point Clouds over Continuous Actions for Multi-object Rearrangement CoRL 2025 A* shortest string decoding for non-idempotent semirings EACL 2024 A Training Data Recipe to Accelerate A* Search with Language Models EMNLP 2024 K∗ Search over Orbit Space for Top-k Planning IJCAI 2023 Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal NeurIPS 2023 A* Search and Bound-Sensitive Heuristics for Oversubscription Planning AAAI 2022 PEA*+IDA*: An Improved Hybrid Memory-Restricted Algorithm AAAI 2022 Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search NeurIPS 2022 Subset Approximation of Pareto Regions with Bi-objective A* AAAI 2022 Combinatorial Learning of Graph Edit Distance via Dynamic Embedding CVPR 2021 On the Optimal Efficiency of A* with Dominance Pruning AAAI 2021 Path Planning using Neural A* Search ICML 2021 Fast semantic parsing with well-typedness guarantees EMNLP 2020 Retro*: Learning Retrosynthetic Planning with Neural Guided A* Search ICML 2020 DeepNav: Learning to Navigate Large Cities CVPR 2017 On Creating Complementary Pattern Databases IJCAI 2017 A* Sampling NeurIPS 2014 Maximum Variance Correction with Application to A* Search ICML 2013