{"url":"/task/heuristic-search","name":"Heuristic Search","slug":"heuristic-search","description_markdown":"Heuristic Search is a problem-solving method that uses practical rules or \"guides\" (heuristics) to find solutions more quickly than exhaustive search, by focusing on the most promising paths first.","categories":[{"name":"Computer Code","url":"/area/computer-code"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":261,"papers_with_code":76,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/objectgoal-navigation","name":"ObjectGoal Navigation"}],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":76,"tagged_in_all":261,"items":[{"url":"/paper/counterfactual-explanation-algorithms-for","title":"Counterfactual Explanation Algorithms for Behavioral and Textual Data","date":"2019-12-04","arxiv_id":"1912.01819","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/domain-independent-dynamic-programming-1","title":"Domain-Independent Dynamic Programming","date":"2024-01-25","arxiv_id":"2401.13883","repositories_listed":2,"syntology":null},{"url":"/paper/deep-generative-symbolic-regression","title":"Deep Generative Symbolic Regression","date":"2023-12-30","arxiv_id":"2401.00282","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_unverified":2,"n_pointer_only":5}},{"url":"/paper/generalized-planning-as-heuristic-search-a","title":"Generalized Planning as Heuristic Search: A new planning search-space that leverages pointers over objects","date":"2023-01-26","arxiv_id":"2301.11087","repositories_listed":2,"syntology":null},{"url":"/paper/ultrafast-learning-of-4-node-hybridization","title":"Ultrafast learning of 4-node hybridization cycles in phylogenetic networks using algebraic invariants","date":"2022-11-30","arxiv_id":"2211.16647","repositories_listed":2,"syntology":null},{"url":"/paper/fanoos-multi-resolution-multi-strength","title":"Fanoos: Multi-Resolution, Multi-Strength, Interactive Explanations for Learned Systems","date":"2020-06-22","arxiv_id":"2006.12453","repositories_listed":2,"syntology":null},{"url":"/paper/gan-path-finder-preliminary-results","title":"GAN Path Finder: Preliminary results","date":"2019-08-05","arxiv_id":"1908.01499","repositories_listed":2,"syntology":null},{"url":"/paper/hybrid-planning-for-dynamic-multimodal","title":"Hybrid Planning for Dynamic Multimodal Stochastic Shortest Paths","date":"2019-06-21","arxiv_id":"1906.09094","repositories_listed":2,"syntology":null},{"url":"/paper/a-survey-on-mathematical-reasoning-and","title":"A Survey on Mathematical Reasoning and Optimization with Large Language Models","date":"2025-03-22","arxiv_id":"2503.17726","repositories_listed":1,"syntology":null},{"url":"/paper/sql-o1-a-self-reward-heuristic-dynamic-search","title":"SQL-o1: A Self-Reward Heuristic Dynamic Search Method for Text-to-SQL","date":"2025-02-17","arxiv_id":"2502.11741","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":4}},{"url":"/paper/kbqa-o1-agentic-knowledge-base-question","title":"KBQA-o1: Agentic Knowledge Base Question Answering with Monte Carlo Tree Search","date":"2025-01-31","arxiv_id":"2501.18922","repositories_listed":1,"syntology":{"n":8,"n_ran":2,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/on-parallel-external-memory-bidirectional","title":"On Parallel External-Memory Bidirectional Search","date":"2024-12-30","arxiv_id":"2412.21104","repositories_listed":1,"syntology":null},{"url":"/paper/llm-virus-evolutionary-jailbreak-attack-on","title":"LLM-Virus: Evolutionary Jailbreak Attack on Large Language Models","date":"2024-12-28","arxiv_id":"2501.00055","repositories_listed":1,"syntology":null},{"url":"/paper/hsevo-elevating-automatic-heuristic-design","title":"HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMs","date":"2024-12-19","arxiv_id":"2412.14995","repositories_listed":1,"syntology":{"n":9,"n_ran":2,"n_unverified":7,"n_pointer_only":0}},{"url":"/paper/sam2long-enhancing-sam-2-for-long-video","title":"SAM2Long: Enhancing SAM 2 for Long Video Segmentation with a Training-Free Memory Tree","date":"2024-10-21","arxiv_id":"2410.16268","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_unverified":5,"n_pointer_only":10}},{"url":"/paper/learning-discrete-world-models-for-heuristic","title":"Learning Discrete World Models for Heuristic Search","date":"2024-09-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pogema-a-benchmark-platform-for-cooperative","title":"POGEMA: A Benchmark Platform for Cooperative Multi-Agent Pathfinding","date":"2024-07-20","arxiv_id":"2407.14931","repositories_listed":1,"syntology":null},{"url":"/paper/pareto-local-search-for-a-multi-objective","title":"Pareto local search for a multi-objective demand response problem in residential areas with heat pumps and electric vehicles","date":"2024-07-16","arxiv_id":"2407.11719","repositories_listed":1,"syntology":null},{"url":"/paper/a-training-data-recipe-to-accelerate-a-search","title":"A Training Data Recipe to Accelerate A* Search with Language Models","date":"2024-07-13","arxiv_id":"2407.09985","repositories_listed":1,"syntology":null},{"url":"/paper/llm-a-large-language-model-enhanced","title":"LLM-A*: Large Language Model Enhanced Incremental Heuristic Search on Path Planning","date":"2024-06-20","arxiv_id":"2407.02511","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/blockpruner-fine-grained-pruning-for-large","title":"BlockPruner: Fine-grained Pruning for Large Language Models","date":"2024-06-15","arxiv_id":"2406.10594","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_unverified":3,"n_pointer_only":12}},{"url":"/paper/slope-search-with-learned-optimal-pruning","title":"SLOPE: Search with Learned Optimal Pruning-based Expansion","date":"2024-06-07","arxiv_id":"2406.04935","repositories_listed":1,"syntology":null},{"url":"/paper/sound-heuristic-search-value-iteration-for","title":"Sound Heuristic Search Value Iteration for Undiscounted POMDPs with Reachability Objectives","date":"2024-06-05","arxiv_id":"2406.02871","repositories_listed":1,"syntology":null},{"url":"/paper/using-constraints-to-discover-sparse-and","title":"Using Constraints to Discover Sparse and Alternative Subgroup Descriptions","date":"2024-06-03","arxiv_id":"2406.01411","repositories_listed":1,"syntology":null},{"url":"/paper/crafting-a-pogo-stick-in-minecraft-with","title":"Crafting a Pogo Stick in Minecraft with Heuristic Search (Extended Abstract)","date":"2024-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/dager-exact-gradient-inversion-for-large","title":"DAGER: Exact Gradient Inversion for Large Language Models","date":"2024-05-24","arxiv_id":"2405.15586","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/chemreasoner-heuristic-search-over-a-large","title":"ChemReasoner: Heuristic Search over a Large Language Model's Knowledge Space using Quantum-Chemical Feedback","date":"2024-02-15","arxiv_id":"2402.10980","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_unverified":2,"n_pointer_only":7}},{"url":"/paper/act-as-you-learn-adaptive-decision-making-in","title":"Act as You Learn: Adaptive Decision-Making in Non-Stationary Markov Decision Processes","date":"2024-01-03","arxiv_id":"2401.01841","repositories_listed":1,"syntology":null},{"url":"/paper/towards-efficient-verification-of-quantized","title":"Towards Efficient Verification of Quantized Neural Networks","date":"2023-12-20","arxiv_id":"2312.12679","repositories_listed":1,"syntology":null},{"url":"/paper/rectangle-search-an-anytime-beam-search","title":"Rectangle Search: An Anytime Beam Search (Extended Version)","date":"2023-12-19","arxiv_id":"2312.12554","repositories_listed":1,"syntology":null}],"syntology_records":10,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}