Related papers: Two robots moving geodesically on a tree
The node-averaged complexity of a problem captures the number of rounds nodes of a graph have to spend on average to solve the problem in the LOCAL model. A challenging line of research with regards to this new complexity measure is to…
The dynamical system on T^2 which is a group extension over an irrational rotation on T^1 is investigated. The criterion when the extension is minimal, a system of order 2 and when the maximal equicontinuous factor is the irrational…
We study the problem of bipedal robot navigation in complex environments with uncertain and rough terrain. In particular, we consider a scenario in which the robot is expected to reach a desired goal location by traversing an environment…
We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…
We propose a learning framework to find the representation of a robot's kinematic structure and motion embedding spaces using graph neural networks (GNN). Finding a compact and low-dimensional embedding space for complex phenomena is a key…
We consider the problem of finding an edge in a hidden undirected graph $G = (V, E)$ with $n$ vertices, in a model where we only allowed queries that ask whether or not a subset of vertices contains an edge. We study the non-adaptive model…
In this survey, we explore recent literature on finding the cores of higher graphs using geometric and topological means. We study graphs, hypergraphs, and simplicial complexes, all of which are models of higher graphs. We study the notion…
We classify radial timelike geodesic motion of the exterior non-extremal Kerr spacetime by performing a taxonomy of inequivalent root structures of the first order radial geodesic equation using a novel compact notation and by implementing…
Systems of networked mobile robots, such as unmanned aerial or ground vehicles, will play important roles in future military and commercial applications. The communications for such systems will typically be over wireless links and may…
A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound…
A graph is geometric 1-planar if it admits a straight-line drawing where each edge is crossed at most once. We provide the first systematic study of the parameterized complexity of recognizing geometric 1-planar graphs. By substantially…
The gathering over meeting nodes problem asks the robots to gather at one of the pre-defined meeting nodes. The robots are deployed on the nodes of an anonymous two-dimensional infinite grid which has a subset of nodes marked as meeting…
The topological complexity ${\sf TC}(X)$ is a homotopy invariant of a topological space $X$, motivated by robotics, and providing a measure of the navigational complexity of $X$. The topological complexity of a connected sum of real…
Grouping the nodes of a graph into clusters is a standard technique for studying networks. We study a problem where we are given a directed network and are asked to partition the graph into a sequence of coherent groups. We assume that…
We develop a new method for visualizing and refining the invariances of learned representations. Specifically, we test for a general form of invariance, linearization, in which the action of a transformation is confined to a low-dimensional…
We survey results on the topological complexity of classical configuration spaces of distinct ordered points in orientable surfaces and related spaces, including certain orbit configuration spaces and Eilenberg-Mac Lane spaces associated to…
The study of the dynamics of a two-body system in modified gravity constitutes a more complex problem than in Newtonian gravity. Numerical methods are typically needed to solve the equations of geodesics. Despite the complexity of the…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
In this paper we generalize the discrete r-homotopy to the discrete (s, r)-homotopy. Then by this notion, we introduce the discrete motion planning for robots which can move discreetly. Moreover, in this case the number of motion planning,…
It is required to find an optimal order of constructing the edges of a network so as to minimize the sum of the weighted connection times of relevant pairs of vertices. Construction can be performed anytime anywhere in the network, with a…