相关论文: A local strategy for cleaning expanding cellular d…

In this paper, we present stochastic synchronous cellular automaton defined on a square lattice. The automaton rules are based on the SEIR (susceptible $\to$ exposed $\to$ infected $\to$ recovered) model with probabilistic parameters…

Approximating the set of reachable states of a dynamical system is an algorithmic yet mathematically rigorous way to reason about its safety. Although progress has been made in the development of efficient algorithms for affine dynamical…

Multi robot teams composed by ground and aerial vehicles have gained attention during the last years. We present a scenario where both types of robots must monitor the same area from different view points. In this paper we propose two…

In this paper, we consider stochastic coverage of bounded domains by a diffusing swarm of robots that take local measurements of an underlying scalar field. We introduce three control methodologies with diffusion, advection, and reaction as…

(abridged) We develop an algorithm for estimating parameters of a distribution sampled with contamination, employing a statistical technique known as ``expectation maximization'' (EM). Given models for both member and contaminant…

In this work we present an algorithm for covering continuous connected domains by ant-like robots with very limited capabilities. The robots can mark visited places with pheromone marks and sense the level of the pheromone in their local…

We study a simple deterministic map that leads a fully connected network to Heider balance. The map is realized by an algorithm that updates all links synchronously in a way depending on the state of the entire network. We observe that the…

This article describes a method to accelerate parallel, explicit time integration of two-dimensional unsteady PDEs. The method is motivated by our observation that latency, not bandwidth, often limits how fast PDEs can be solved in…

We study the problem of distributed traffic control in the partitioned plane, where the movement of all entities (robots, vehicles, etc.) within each partition (cell) is coupled. Establishing liveness in such systems is challenging, but…

This paper addresses the complete area coverage problem of a known environment by multiple-robots. Complete area coverage is the problem of moving an end-effector over all available space while avoiding existing obstacles. In such tasks,…

Faults and viruses often spread in networked environments by propagating from site to neighboring site. We model this process of {\em network contamination} by graphs. Consider a graph $G=(V,E)$, whose vertex set is contaminated and our…

A robotic swarm may encounter traffic congestion when many robots simultaneously attempt to reach the same area. For solving that efficiently, robots must execute decentralised traffic control algorithms. In this work, we propose a measure…

Epidemiological models help policymakers mitigate disease spread by predicting transmission metrics based on disease dynamics and contact networks. Calibrating these models requires representative network sampling. We investigate the Random…

A mechanism to derive non-repetitive coverage path solutions with a proven minimal number of discontinuities is proposed in this work, with the aim to avoid unnecessary, costly end effector lift-offs for manipulators. The problem is…

We present numerical results obtained from the modelling of a stochastic, highly connected and mobile community. The spread of attributes like health, disease among the community members is simulated using cellular automata on a planar 2…

In this article, we have proposed an epidemic model by using probability cellular automata theory. The essential mathematical features are analyzed with the help of stability theory. We have given an alternative modelling approach for the…

Fine-grained robotic touch sensing is essential for tasks such as robot-human interaction and the handling of hazardous materials. Yet, the sense of touch of robots is limited by the cost and complexity of routing cables to embedded…

Many robotic applications, such as sanding, polishing, wiping and sensor scanning, require a manipulator to dexterously cover a surface using its end-effector. In this paper, we provide an efficient and effective coverage path planning…

This paper considers the problem of distributed state estimation using multi-robot systems. The robots have limited communication capabilities and, therefore, communicate their measurements intermittently only when they are physically close…

A good segmentation result depends on a set of "correct" choice for the seeds. When the input images are noisy, the seeds may fall on atypical pixels that are not representative of the region statistics. This can lead to erroneous…