Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Dor Atzmon"'
Publikováno v:
Journal of Artificial Intelligence Research. 75:747-793
This paper solves the Watchman Route Problem (WRP) on a general discrete graph with Heuristic Search. Given a graph, a line-of-sight (LOS) function, and a start vertex, the task is to (offline) find a (shortest) path through the graph such that all v
Autor:
Shawn Skyler, Dor Atzmon, Ariel Felner, Oren Salzman, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:239-243
There are many settings that extend the basic shortest path search problem. In Bounded-Cost Search, we are given a constant bound and the task is to find a solution within the bound. In Bi-Objective Search, each edge is associated with two costs (obj
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:229-233
Online MAPF extends the classical Multi-Agent Path Finding problem (MAPF) by considering a more realistic problem in which new agents may appear over time. As online solvers are not aware of which agents will join in the future, the notion of snapsho
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:11-19
In Multi-Agent Pathfinding (MAPF), the task is to find non-colliding paths for a set of agents. This paper focuses on search-based MAPF algorithms from the Conflict-Based Framework, which is introduced here. A common technique in such algorithms is t
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:244-248
To transmit information or transfer an object, two agents may need to reach the same location and meet. Often, such two agents operate in two separate environments and they can only meet at border locations. For example, a ship, sailing in the sea, n
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:302-304
In the Watchman Route Problem (WRP), the task is to find a path for a watchman agent such that all locations in the given map will be visually seen by the watchman at least once during the path traversal. Recently, the problem has been optimally solv
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 9:10-18
Finding the minimax value of a game is an important problem in a variety of fields, including game theory, decision theory, statistics, philosophy, economics, robotics, and security. Classical algorithms such as the Minimax algorithm can be used to f
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 11:101-105
Multi-Agent Path Finding (MAPF) is the problem of finding non-colliding paths for multiple agents. The classical problem assumes that all agents are homogeneous, with a fixed size and behavior. However, in reality agents are heterogeneous, with diffe
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 10:125-129
Multi-agent path finding (MAPF) is the problem of moving a set of agents from their individual start locations to their individual goal locations, without collisions. This problem has practical applications in video games, traffic control, robotics,
Publikováno v:
Artificial Intelligence. :103950