44 citations · 91 across the 11 of their papers we have counts for
14 papers
Optimal Planning in a Dynamic World
Devin Wild Thomas, Solomon Eyal Shimony, Wheeler Ruml +3
Background: We address the problem of planning when the set of feasible states or actions changes over time. For example, in the problem of path planning among moving obstacles (so…
Planning and Acting While the Clock Ticks
Andrew Coles, Erez Karpas, Andrey Lavrinenko +3
Standard temporal planning assumes that planning takes place offline and then execution starts at time 0. Recently, situated temporal planning was introduced, where planning starts…
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…
Attacking Shortest Paths by Cutting Edges
Benjamin A. Miller, Zohair Shafi, Wheeler Ruml +3
Identifying shortest paths between nodes in a network is a common graph analysis problem that is important for many applications involving routing of resources. An adversary that c…
Beam Search: Faster and Monotonic
Sofia Lemons, Carlos Linares López, Robert C. Holte +1
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…
Optimal Edge Weight Perturbations to Attack Shortest Paths
Benjamin A. Miller, Zohair Shafi, Wheeler Ruml +3
Finding shortest paths in a given network (e.g., a computer network or a road network) is a well-studied task with many applications. We consider this task under the presence of an…
PATHATTACK: Attacking Shortest Paths in Complex Networks
Benjamin A. Miller, Zohair Shafi, Wheeler Ruml +3
Shortest paths in complex networks play key roles in many applications. Examples include routing packets in a computer network, routing traffic on a transportation network, and inf…
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding
Jiaoyang Li, Wheeler Ruml, Sven Koenig
Multi-Agent Path Finding (MAPF), i.e., finding collision-free paths for multiple robots, is important for many applications where small runtimes are necessary, including the kind o…
Improved Safe Real-time Heuristic Search
Bence Cserna, Kevin C. Gall, Wheeler Ruml
A fundamental concern in real-time planning is the presence of dead-ends in the state space, from which no goal is reachable. Recently, the SafeRTS algorithm was proposed for searc…
Value Directed Exploration in Multi-Armed Bandits with Structured Priors
Bence Cserna, Marek Petrik, Reazul Hasan Russel +1
Multi-armed bandits are a quintessential machine learning problem requiring the balancing of exploration and exploitation. While there has been progress in developing algorithms wi…
On-line Planning and Scheduling: An Application to Controlling Modular Printers
Wheeler Ruml, Minh Binh Do, Rong Zhou +1
We present a case study of artificial intelligence techniques applied to the control of production printing equipment. Like many other real-world applications, this complex domain…
Best-First Heuristic Search for Multicore Machines
Ethan Burns, Sofia Lemons, Wheeler Ruml +1
To harness modern multicore processors, it is imperative to develop parallel versions of fundamental algorithms. In this paper, we compare different approaches to parallel best-fir…