相关论文: Black Hole Search in Dynamic Cactus Graph

The spatial search problem aims to find a marked vertex of a finite graph using a dynamic with two constraints: (1) The walker has no compass and (2) the walker can check whether a vertex is marked only after reaching it. This problem is a…

We study the so-called dynamic coverage problem by agents located in some topological graph. The agents must visit all regions of interest but they also should stay connected to the base via multi-hop. We prove that the algorithmic…

The graph exploration problem requires a group of mobile robots, initially placed arbitrarily on the nodes of a graph, to work collaboratively to explore the graph such that each node is eventually visited by at least one robot. One…

On an assigned graph, the problem of Multi-Agent Pathfinding (MAPF) consists in finding paths for multiple agents, avoiding collisions. Finding the minimum-length solution is known to be NP-hard, and computation times grows exponentially…

In backgrounds with compact dimensions there may exist several phases of black objects including the black-hole and the black-string. The phase transition between them raises puzzles and touches fundamental issues such as topology change,…

Three dimensional black holes in a generalized dilaton gravity action theory are analysed. The theory is specified by two fields, the dilaton and the graviton, and two parameters, the cosmological constant and the Brans-Dicke parameter. It…

The virtual black hole phenomenon, which has been observed previously in specific models, is established for generic 2D dilaton gravity theories with scalar matter. The ensuing effective line element can become asymptotically flat only for…

Among sub-optimal Multi-Agent Path Finding (MAPF) solvers, rule-based algorithms are particularly appealing since they are complete. Even in crowded scenarios, they allow finding a feasible solution that brings each agent to its target,…

It has recently been suggested that black holes may be described as condensates of weakly interacting gravitons at a critical point, exhibiting strong quantum effects. In this paper, we study a model system of attractive bosons in one…

We establish a version of the Momentum/Complexity (PC) duality between the rate of operator complexity growth and a radial component of bulk momentum for a test system falling into a black hole. In systems of finite entropy, our map remains…

Consider an agent exploring an unknown graph in search of some goal state. As it walks around the graph, it learns the nodes and their neighbors. The agent only knows where the goal state is when it reaches it. How do we reach this goal…

Configurations of multiple concentric black rings play an important role in determining the pattern of branchings, connections and mergers between different phases of higher-dimensional black holes. We examine them using both approximate…

The black hole information paradox apparently indicates the need for a fundamentally new ingredient in physics. The leading contender is nonlocality. Possible mechanisms for the nonlocality needed to restore unitarity to black hole…

We consider the fundamental task of network exploration. A network is modeled as a simple connected undirected n-node graph with unlabeled nodes, and all ports at any node of degree d are arbitrarily numbered 0,.....,d-1. Each of two…

We consider a search and rescue game introduced recently by the first author. An immobile target or targets (for example, injured hikers) are hidden on a graph. The terrain is assumed to dangerous, so that when any given vertex of the graph…

We study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node $v$ of degree $deg(v)$ are labeled arbitrarily as $0,1,\ldots, deg(v)-1$. A mobile agent, starting from a…

We construct new classes of the dynamical black hole solutions in five or higher dimensional Einstein-Maxwell theory, coupled to a dilaton field, in the presence of arbitrary cosmological constant. The dilaton field interacts non-trivially…

A variety of observational approaches have provided evidence for extended halos of dark matter surrounding elliptical galaxies, and for massive dark objects in (some of) their nuclei. What are the properties of the dark halos? How do they…

We study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of…

We investigate a variation of the art gallery problem in which a team of mobile guards tries to track an unpredictable intruder in a simply-connected polygonal environment. In this work, we use the deployment strategy for diagonal guards…