No article text was recorded for this version.
incremental search tree reuse
Version 1 of 143 papers55 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Frontier Search and Plan Reconstruction in Oversubscription Planning
- Blog: TBA*: Time-Bounded A*
- Blog: Iterative-Deepening Conflict-Based Search
- Blog: Keyword search on external memory data graphs.
- Blog: Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs
- Blog: Efficient Budgeted Graph Search
- Blog: Analysis of the Anytime MAPF Solvers Based on the Combination of Conflict-Based Search (CBS) and Focal Search (FS)
- Blog: POMDP Planning for Object Search in Partially Unknown Environment
- Blog: X*: Anytime Multi-Agent Path Finding for Sparse Domains using Window-Based Iterative Repairs
- Blog: ArchPilot: A Proxy-Guided Multi-Agent Approach for Machine Learning Engineering
- Blog: Efficient Incremental Search for Moving Target Search
- Blog: Using Available Memory to Transform Graphplan's Search
- Blog: A Theoretical Framework for Zeroth-Order Budget Convex Optimization
- Blog: Real-time stereo semi-global matching for video processing using previous incremental information
- Blog: ARA*: Anytime A* with Provable Bounds on Sub-Optimality
- Blog: Explaining Soft-Goal Conflicts through Constraint Relaxations
- Blog: On Efficient Spatial Matching
- Blog: Best Arm Identification with Retroactively Increased Sampling Budget for More Resource-Efficient HPO
- Blog: Path-Adaptive A* for Incremental Heuristic Search in Unknown Terrain
- Blog: Boundary-to-boundary flows in planar graphs
- Blog: Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search
- Blog: Making Good Decisions Quickly
- Blog: Hypertagging: Supertagging for Surface Realization with CCG
- Blog: Effective Redundant Constraints for Online Scheduling
- Blog: Evaluating Heuristic Search Algorithms in Pathfinding: A Comprehensive Study on Performance Metrics and Domain Parameters
- Blog: The Fringe-Saving A* Search Algorithm - A Feasibility Study
- Blog: Incremental ARA*: An Incremental Anytime Search Algorithm for Moving-Target Search
- Blog: A-ePA*SE: Anytime Edge-Based Parallel A* for Slow Evaluations
- Blog: Best-First Minimax Search: Othello Results
- Blog: Mobile Robot Path Planning Based on Time Taboo Ant Colony Optimization in Dynamic Environment
- Blog: Path Planning in Dynamic Environments with Adaptive Dimensionality
- Blog: Algorithms for Acyclic Weighted Finite-State Automata with Failure Arcs
- Blog: Combining Symmetry Breaking and Global Constraints
- Blog: Reusing Previously Found A* Paths for Fast Goal-Directed Navigation in Dynamic Terrain
- Blog: A-A*pex: Efficient Anytime Approximate Multi-Objective Search
- Blog: X*: Anytime Multiagent Planning With Bounded Search
- Blog: Speeding up the Parti-Game Algorithm
- Blog: Bandit-Based Planning and Learning in Continuous-Action Markov Decision Processes
- Blog: Anytime Approximate Bi-Objective Search
- Blog: Optimal Graph Search with Iterated Graph Cuts
- Blog: An Incremental Theorem Prover
- Blog: D*Lite
- Blog: AEMS: An Anytime Online Search Algorithm for Approximate Policy Refinement in Large POMDPs
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_incremental_search_tree_reuse_6fabaeaf,
title = {incremental search tree reuse},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/incremental-search-tree-reuse/rdr_6fabaeafb61641628d01b959841238cf},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_incremental_search_tree_reuse_6fabaeaf_v1,
title = {incremental search tree reuse},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/incremental-search-tree-reuse/rdr_6fabaeafb61641628d01b959841238cf/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}