论文信息 - Solving the filling problem with the visibility range of 1

Solving the filling problem with the visibility range of 1

This paper discusses new methodologies of discovering areas with inexpensive autonomous robots. Consider a set of robots which has to disperse through the area in order to cover it. The area is divided into smaller cells and each cell has to be occupied by exactly one robot. When the robots are injected into the area one at a time the problem is called Filling. The main challenges arise from the limited capabilities of the robots: in this paper they do not have any means of explicit communication and their sensing range is limited to 1.

Attila Hideg | Bertalan Forstner | László Blázovics

[1] Howie Choset,et al. Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[2] Sándor P. Fekete. Algorithmic Aspects of Wireless Sensor Networks, Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers , 2008, ALGOSENSORS.

[3] Esther M. Arkin,et al. Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments , 2002, WAFR.

[4] Pramod K. Varshney,et al. A distributed self spreading algorithm for mobile wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[5] Attila Hideg,et al. Area coverage using distributed randomized methods , 2016, 2016 Cybernetics & Informatics (K&I).

[6] Ute Dreher,et al. Algorithmic Aspects Of Wireless Sensor Networks , 2016 .

[7] Gaurav S. Sukhatme,et al. An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[8] Ivan Stojmenovic,et al. Focused-coverage by mobile sensor networks , 2009, 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems.