No article text was recorded for this version.
progressive solution refinement
Version 1 of 1256 papers336 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Harnessing the strengths of anytime algorithms for constant data streams
- Blog: Constant-time Motion Planning with Anytime Refinement for Manipulation
- Blog: A-MHA*: Anytime Multi-Heuristic A
- Blog: Branch and Bound with Mini-Bucket Heuristics
- Blog: Anytime Tree-Restoring Weighted A* Graph Search
- Blog: A genetic algorithm to discover flexible motifs with support
- Blog: Distributed Infrastructure Inspection Path Planning subject to Time Constraints
- Blog: Particle swarm optimization for time series motif discovery
- Blog: Multiple Sequence Alignment Using Anytime A*
- Blog: Planning by Rewriting: Efficiently Generating High-Quality Plans
- Blog: Iterative-Refinement for Action Timing Discretization
- Blog: Flexible and Approximate Computation through State-Space Reduction
- Blog: Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding
- Blog: State-space Abstraction for Anytime Evaluation of Probabilistic Networks
- Blog: An Approximate 0-1 Edge-Labeling Algorithm for Constrained Bin-Packing Problem
- Blog: Anytime Hybrid Driving-Stepping Locomotion Planning
- Blog: Optimal Path Planning in Complex Cost Spaces With Sampling-Based Algorithms
- Blog: Anytime Coalition Structure Generation with Worst Case Guarantees
- Blog: D4orm: Multi-Robot Trajectories with Dynamics-aware Diffusion Denoised Deformations
- Blog: Multi-criteria search algorithm: An efficient approximate k-NN algorithm for image retrieval
- Blog: Bounded Approximations for Linear Multi-Objective Planning Under Uncertainty
- Blog: Incremental, Approximate Planning
- Blog: Anytime Local Search for Distributed Constraint Optimization
- Blog: TORM: Collision-Free Trajectory Optimization of Redundant Manipulator given an End-Effector Path
- Blog: Iterative Refinement for Real-Time Multi-Robot Path Planning
- Blog: Iterative state-space reduction for flexible computation
- Blog: Pareto Optimal Multirobot Motion Planning
- Blog: Using Anytime Planning for Centralized Coordination of Multiple Robots in Real-Time Dynamic Environments
- Blog: Path-Planning for Autonomous Training on Robot Manipulators in Space
- Blog: A-MHA*: Anytime Multi-Heuristic A
- Blog: Planning, Learning and Reasoning Framework for Robot Truck Unloading
- Blog: Determining possible avenues of approach using ANTS
- Blog: Multi-robot grasp planning for sequential assembly operations
- Blog: Finding Optimal Solutions for Voting Game Design Problems
- Blog: Evaluating Anytime Algorithms for Learning Optimal Bayesian Networks
- Blog: Object Placement Planning and Optimization for Robot Manipulators
- Blog: Scaling Lifelong Multi-Agent Path Finding to More Realistic Settings: Research Challenges and Opportunities
- Blog: Optimal Infinite Temporal Planning: Cyclic Plans for Priced Timed Automata
- Blog: Exploiting System Hierarchy to Compute Repair Plans in Probabilistic Model-Based Diagnosis
- Blog: Lookahead-based algorithms for anytime induction of decision trees
- Blog: Two-step Planning of Dynamic UAV Trajectories using Iterative $δ$-Spaces
- Blog: Minimizing Task-Space Fréchet Error via Efficient Incremental Graph Search
- Blog: db-CBS: Discontinuity-Bounded Conflict-Based Search for Multi-Robot Kinodynamic Motion Planning
- Blog: Blossom: an Anytime Algorithm for Computing Optimal Decision Trees
- Blog: Search-Based Planning with Provable Suboptimality Bounds for Continuous State Spaces
- Blog: Blossom: an Anytime Algorithm for Computing Optimal Decision Trees
- Blog: Anytime Focal Search with Applications
- Blog: Efficient Sampling-Based Approaches to Optimal Path Planning in Complex Cost Spaces
- Blog: Unsatisfiable Core Shrinking for Anytime Answer Set Optimization
- Blog: Scaling Lifelong Multi-Agent Path Finding to More Realistic Settings: Research Challenges and Opportunities
- Blog: TAIP: an anytime algorithm for allocating student teams to internship programs
- Blog: Monte-Carlo Tree Search for Scalable Coalition Formation
- Blog: Controlling State-Space Abstraction in Bayesian Networks
- Blog: SRMP: Search-Based Robot Motion Planning Library
- Blog: Bandit-based optimization on graphs with application to library performance tuning
- Blog: Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
- Blog: MLbase: A Distributed Machine-learning System
- Blog: Anytime Stochastic Routing with Hybrid Learning
- Blog: AMRA*: Anytime Multi-Resolution Multi-Heuristic A
- Blog: Densification Strategies for Anytime Motion Planning over Large Dense Roadmaps
Showing 60 of 256 papers.
History & citation
Current · Permanent link
- Anytime Planning for Real-Time Robotics merged into this direction (63% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_progressive_solution_refinement_c2bb07f6,
title = {progressive solution refinement},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/progressive-solution-refinement/rdr_c2bb07f60eca4090a7a8d5899eec9b14},
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_progressive_solution_refinement_c2bb07f6_v1,
title = {progressive solution refinement},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/progressive-solution-refinement/rdr_c2bb07f60eca4090a7a8d5899eec9b14/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}