44 citations · 91 across the 11 of their papers we have counts for
3 papers · 1 filter
Rectangle Search: An Anytime Beam Search (Extended Version)
Sofia Lemons, Wheeler Ruml, Robert C. Holte +1
Anytime heuristic search algorithms try to find a (potentially suboptimal) solution as quickly as possible and then work to find better and better solutions until an optimal soluti…
Defense Against Shortest Path Attacks
Benjamin A. Miller, Zohair Shafi, Wheeler Ruml +3
Identifying shortest paths between nodes in a network is an important task in many applications. Recent work has shown that a malicious actor can manipulate a graph to make traffic…
A Formal Metareasoning Model of Concurrent Planning and Execution
Amihay Elboher, Ava Bensoussan, Erez Karpas +3
Agents that plan and act in the real world must deal with the fact that time passes as they are planning. When timing is tight, there may be insufficient time to complete the searc…