Pipeline-based applications have become an integral part of life. However, knowing that the pipeline systems can be largely deployed in inaccessible and hazardous environment, active monitoring frequent inspection are highly expensive using traditional maintenance systems. Robot agents been considered as attractive alternative. Although many different types exploration robots proposed, they were suffered from various limitations. In this paper, we present design implementation a...

We consider the problem of repositioning N autonomous robots on a plane so that each robot is visible to all others (the Complete Visibility problem), cannot see another if there third positioned between them straight line joining them. Robots communicate using collared lights. The computation synchronous and performs look-compute-move during round. Specifically, round permitted observe light position every it. It may also perform an internal based observed lights positions(including...

We consider the distributed setting of K = (k + 1) × autonomous mobile robots operating on a grid graph N (n nodes with n k · d, d ≥ 2, following Look-Compute-Move cycles and communicating other using colored lights under model. uniform scattering problem repositioning so that each robot reach to static configuration in which they cover uniformly grid. In this paper, we provide first O(n) time algorithm for fully synchronous setting, given have common orientation, knowledge parameters k,...

The dispersion problem on graphs asks k ≤ n robots placed initially arbitrarily the nodes of an n-node anonymous graph to reposition autonomously reach a configuration in which each robot is distinct node graph. This significant interest due its relationship other fundamental coordination problems, such as exploration, scattering, load balancing, and relocation self-driven electric cars (robots) recharge stations (nodes). In this paper, we consider global communication model where can...

We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles and communicate with other using colored lights (the model). study fundamental problem repositioning on a plane sothat each robot is visible to all others Complete Visibility problem) this model; cannot see another if third positioned between them straight line connecting them. There exists an O(1) time, color algorithm for semi-synchronous setting. In paper, we provide first...

We consider the distributed setting of N autonomous?mobile robots that operate in Look-Compute-Move (LCM) cycles and communicate with other using colored lights (the model). study fundamental Complete Visibility problem repositioning on a plane so each robot is visible to all others. assume obstructed visibility under which cannot see another if third positioned between them straight line connecting them. are interested fault-tolerant algorithms; existing algorithms for this not (except...

Given an undirected, anonymous, port-labeled graph of $n$ memory-less nodes, $m$ edges, and degree $\Delta$, we consider the problem dispersing $k\leqn$ robots positioned initially arbitrarily on nodes to exactly $k$ different one robot per node. The objective is simultaneously minimize time memory. If all are a single node, DFS traversal solves this in $O(\min\{m,k\Delta\})$ with $\Theta(\log(k+\Delta))$ bits robot. Otherwise, best previously known algorithm takes $O(\min\{m,k\Delta\}\cdot...

We consider the problem of implementing transactional memory in large-scale distributed networked systems. present and analyze Spiral, a novel directory-based protocol for memory. Spiral is designed data-flow implementation software which supports three basic operations: publish, allowing shared object to be inserted directory so that other nodes can find it; lookup, providing read-only copy requesting node; move, node write locally after gets it. The runs on hierarchical construction based...

The dispersion problem on graphs asks k ≤n robots placed initially arbitrarily the nodes of an n-node anonymous graph to reposition autonomously reach a configuration in which each robot is distinct node graph. This significant interest due its relationship other fundamental coordination problems, such as exploration, scattering, load balancing, and relocation self-driving electric cars (robots) recharge stations (nodes). objective simultaneously minimize (or provide trade-off between) two...

We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles and communicate with other using colored lights (the model. This model assumes obstructed visibility where a robot cannot see another if third is positioned between them on straight line connecting them. In this paper, we movements to be grid (integer plane) unbounded size. any given step at point can move only an adjacent its north, south, east or west. The naturally discretizes...

We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move cycles and communicate with other using colored lights (the model). study fundamental problem repositioning on a plane so each robot is visible to all others Complete Visibility problem) this model. obstructed visibility under which cannot see another if third positioned between then straight line connecting them. The literature solves model for point robots. In paper, we problem, very first...