Name
Abstract | ||
|---|---|---|
There are a lot of researches and applications for the coverage problem of unknown fields by a robot, for example, planet exploration, mine-clearing operation. Using multi-robots for this problem we can expect effective operation. In order to control multi-robots effectively, obtaining cooperative action among robots is essential. We have proposed an algorithm for the co-operative multi-agent coverage simulation. There are three possible coverage paths: the zigzag, spiral and random paths. We have compared the effectiveness of those three coverage paths for a field where complex obstacles are allocated. The experimental results show that there are no remarkable differences of effectiveness among those three coverage paths. It is still not clear that how the shape or the allocation of obstacles affect the effectiveness of the coverage paths. In this paper we evaluate the influence of the field structure on the effectiveness of the coverage paths. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.20965/jaciii.2013.p0883 | JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS |
Keywords | Field | DocType |
multi-agent, coverage, unknown field, shortest path | Shortest path problem,Computer science,Algorithm,Artificial intelligence,Machine learning | Journal |
Volume | Issue | ISSN |
17 | 6 | 1343-0130 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hidemi Yamachi | 1 | 13 | 5.21 |
| Yasuhiro Tsujimura | 2 | 80 | 14.26 |
| Yasushi Kambayashi | 3 | 124 | 29.76 |