Zobrazeno 1 - 10
of 114
pro vyhledávání: '"Ruml, Wheeler"'
Autor:
Coles, Andrew, Karpas, Erez, Lavrinenko, Andrey, Ruml, Wheeler, Shimony, Solomon Eyal, Shperberg, Shahaf
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 at time 0 and execution occurs after planning terminates. Situated te
Externí odkaz:
http://arxiv.org/abs/2403.14796
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 solution is obtained or time is exhausted. The most widely-known anytime sea
Externí odkaz:
http://arxiv.org/abs/2312.12554
Autor:
Miller, Benjamin A., Shafi, Zohair, Ruml, Wheeler, Vorobeychik, Yevgeniy, Eliassi-Rad, Tina, Alfeld, Scott
Identifying shortest paths between nodes in a network is an important task in applications involving routing of resources. Recent work has shown that a malicious actor can manipulate a graph to make traffic between two nodes of interest follow their
Externí odkaz:
http://arxiv.org/abs/2305.19083
Autor:
Elboher, Amihay, Bensoussan, Ava, Karpas, Erez, Ruml, Wheeler, Shperberg, Shahaf S., Shimony, Solomon E.
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 search for a plan before it is time to act. By commencing execution before
Externí odkaz:
http://arxiv.org/abs/2303.02664
Autor:
Miller, Benjamin A., Shafi, Zohair, Ruml, Wheeler, Vorobeychik, Yevgeniy, Eliassi-Rad, Tina, Alfeld, Scott
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 can manipulate the graph structure could alter traffic patterns to gain
Externí odkaz:
http://arxiv.org/abs/2211.11141
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. We make two contributions to the study of beam search. Firs
Externí odkaz:
http://arxiv.org/abs/2204.02929
Autor:
Miller, Benjamin A., Shafi, Zohair, Ruml, Wheeler, Vorobeychik, Yevgeniy, Eliassi-Rad, Tina, Alfeld, Scott
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 adversary, who can manipulate the network by perturbing its edge weig
Externí odkaz:
http://arxiv.org/abs/2107.03347
Autor:
Miller, Benjamin A., Shafi, Zohair, Ruml, Wheeler, Vorobeychik, Yevgeniy, Eliassi-Rad, Tina, Alfeld, Scott
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 inferring semantic distances between concepts on the World Wide Web. An a
Externí odkaz:
http://arxiv.org/abs/2104.03761
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 of automated warehouses operated by Amazon. CBS is a leading two-level
Externí odkaz:
http://arxiv.org/abs/2010.01367
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 searching in such spaces. SafeRTS exploits a user-provided predicate to ide
Externí odkaz:
http://arxiv.org/abs/1905.06402