heuristic search

f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search AAAI 2021 GLSearch: Maximum Common Subgraph Detection via Learning to Search ICML 2021 Heuristic Search for Approximating One Matrix in Terms of Another Matrix IJCAI 2021 Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering AAAI 2021 Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions AAAI 2021 On the Optimal Efficiency of A* with Dominance Pruning AAAI 2021 Policy-Guided Heuristic Search with Guarantees AAAI 2021 Progression Heuristics for Planning with Probabilistic LTL Constraints AAAI 2021 Saturated Post-hoc Optimization for Classical Planning AAAI 2021 Searching for Machine Learning Pipelines Using a Context-Free Grammar AAAI 2021 Solving Partially Observable Stochastic Shortest-Path Games IJCAI 2021 Symbolic Search for Oversubscription Planning AAAI 2021 The Fewer the Merrier: Pruning Preferred Operators with Novelty IJCAI 2021 Type-WA*: Using Exploration in Bounded Suboptimal Planning IJCAI 2021 Width-based Lookaheads with Learnt Base Policies and Heuristics Over the Atari-2600 Benchmark NeurIPS 2021 A Unifying View on Individual Bounds and Heuristic Inaccuracies in Bidirectional Search AAAI 2020 Beliefs We Can Believe in: Replacing Assumptions with Data in Real-Time Search AAAI 2020 Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound IJCAI 2020 Can We Learn Heuristics for Graphical Model Inference Using Reinforcement Learning? CVPR 2020 Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning IJCAI 2020 Delete- and Ordering-Relaxation Heuristics for HTN Planning IJCAI 2020 Efficient Heuristic Search for M-Modes Inference PGM 2020 Envelope-Based Approaches to Real-Time Heuristic Search AAAI 2020 Front-to-Front Heuristic Search for Satisficing Classical Planning IJCAI 2020 Heuristic Domain Adaptation NeurIPS 2020