Distributed algorithm for painting by a swarm of randomly deployed robots under limited visibility model

This article studies the problem of painting an obstacle free rectangular region by a swarm of mobile robots. Initially the robots are deployed randomly within the target area subject to the condition that the distribution is d*-dense, where d * = 3 d 2 , and a robot can view up to a distance d. By...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International journal of advanced robotic systems Ročník 15; číslo 5; s. 172988141880450
Hlavní autori:	Das, Deepanwita, Mukhopadhyaya, Srabani
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London, England SAGE Publications 01.09.2018 Sage Publications Ltd SAGE Publishing
Predmet:	Algorithms Robots Upper bounds Visibility limited visibility robot swarm painting Distributed algorithm
ISSN:	1729-8814, 1729-8806, 1729-8814
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!