Probabilistic Network Formation through Coverage and Freeze-Tag

Meisner, Eric; Yang, Wei; Isler, Volkan

doi:10.1007/978-3-642-00312-7_1

Cited by 2 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Related problems include establishing connectivity [8], [15], building a bridge between two points [20], network coverage [6], [16], repairing a network's connectivity [5], [1], and improving it [4], [10]. In sensor networks literature, robots are used as mobile sensors to extend sensing regions [7], [11] or to collect data from stationary sensors [21], [17].…”

Section: A Related Workmentioning

confidence: 99%

Maintaining connectivity in environments with obstacles

Tekdas

Plonski

Karnad

et al. 2010

2010 IEEE International Conference on Robotics and Automation

Self Cite

View full text Add to dashboard Cite

Robotic routers (mobile robots with wireless communication capabilities) can create an adaptive wireless network and provide communication services for mobile users ondemand. Robotic routers are especially appealing for applications in which there is a single mobile user whose connectivity to a base station must be maintained in an environment that is large compared to the wireless range.In this paper, we study the problem of computing motion strategies for robotic routers in such scenarios, as well as the minimum number of robotic routers necessary to enact our motion strategies. Assuming that the routers are as fast as the user, we present an optimal solution for cases where the environment is a simply-connected polygon, a constant factor approximation for cases where the environment has a single obstacle, and an O(h) approximation for cases where the environment has h circular obstacles. The O(h) approximation also holds for cases where the environment has h arbitrary polygonal obstacles, provided they satisfy certain geometric constraints -e.g. when the set of their minimum bounding circles is disjoint.

show abstract

Section: A Related Workmentioning

confidence: 99%

Maintaining connectivity in environments with obstacles

Tekdas

Plonski

Karnad

et al. 2010

2010 IEEE International Conference on Robotics and Automation

Self Cite

View full text Add to dashboard Cite

show abstract

“…The online FTP in the Euclidean domain was further explored in [11]. The authors considered the case where the robots are distributed uniformly at random over a rectangular shaped bounded area.…”

Section: Introductionmentioning

confidence: 99%

“…The results in [11] rely on a bounded environment assumption. Considering the typical operation environments of field robots, including open seas and skies, this constraint may need to be relaxed.…”

Section: Introductionmentioning

confidence: 99%

Asynchronous Network Formation in Unknown Unbounded Environments

Engin

Isler

2019

2019 International Conference on Robotics and Automation (ICRA)

Self Cite

View full text Add to dashboard Cite

In this paper, we study the Online Network Formation Problem (ONFP) for a mobile multi-robot system. Consider a group of robots with a bounded communication range operating in a large open area. One of the robots has a piece of information which has to be propagated to all other robots. What strategy should the robots pursue to disseminate the information to the rest of the robots as quickly as possible?The initial locations of the robots are unknown to each other, therefore the problem must be solved in an online fashion.For this problem, we present an algorithm whose competitive ratio is O(H · max{M, √ M H}) for arbitrary robot deployments, where M is the largest edge length in the Euclidean minimum spanning tree on the initial robot configuration and H is the height of the tree. We also study the case when the robot initial positions are chosen uniformly at random and improve the ratio to O(M ). Finally, we present simulation results to validate the performance in larger scales and demonstrate our algorithm using three robots in a field experiment.

show abstract

Probabilistic Network Formation through Coverage and Freeze-Tag

Cited by 2 publications

References 11 publications

Maintaining connectivity in environments with obstacles

Maintaining connectivity in environments with obstacles

Asynchronous Network Formation in Unknown Unbounded Environments

Contact Info

Product

Resources

About