Wheeler Ruml

Speedy versus greedy search

2015 · International Conference on Artificial Intelligence

When an optimal solution is not required, satisficing search methods such as greedy best-first search are often used to find solutions quickly. In work on satisficing search, there has been substantial attention devoted to how …

Choosing the Initial State for Online Replanning

2021 · Proceedings of the AAAI Conference on Artificial Intelligence

The need to replan arises in many applications. However, in the context of planning as heuristic search, it raises an annoying problem: if the previous plan is still executing, what should the new plan search …