Search Results for author:
Found 9 papers, 3 papers with code
Planning and Acting While the Clock Ticks
Recently, situated temporal planning was introduced, where planning starts at time 0 and execution occurs after planning terminates.
Rectangle Search: An Anytime Beam Search (Extended Version)
In this paper, we propose a new algorithm, rectangle search, that is instead based on beam search, a variant of breadth-first search.
A Formal Metareasoning Model of Concurrent Planning and Execution
When timing is tight, there may be insufficient time to complete the search for a plan before it is time to act.
Beam Search: Faster and Monotonic
Beam search is a popular satisficing approach to heuristic search problems that allows one to trade increased computation time for lower solution cost by increasing the beam width parameter.
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding
ECBS is a bounded-suboptimal variant of CBS that uses focal search to speed up CBS by sacrificing optimality and instead guaranteeing that the costs of its solutions are within a given factor of optimal.
Improved Safe Real-time Heuristic Search
A fundamental concern in real-time planning is the presence of dead-ends in the state space, from which no goal is reachable.
Value Directed Exploration in Multi-Armed Bandits with Structured Priors
Multi-armed bandits are a quintessential machine learning problem requiring the balancing of exploration and exploitation.
On-line Planning and Scheduling: An Application to Controlling Modular Printers
To our knowledge, this work represents the first successful industrial application of embedded domain-independent temporal planning.
Best-First Heuristic Search for Multicore Machines
To harness modern multicore processors, it is imperative to develop parallel versions of fundamental algorithms.
