Abstract | ||
---|---|---|
The problem of multi-robot for searching mission with fully communicative known environment is considered in this paper. Robots are required to maneuver every part of the given environment repeatedly until they find a target object. In order to increase the effectiveness of deploying the mult-robot, they need to be spread out sufficiently, not overlapping the searching area with other robots. To achieve this, we proposed an algorithm about deploying the multi-robot with maximizing the on-line coverage of the searching area. A shared dynamic map and its updating algorithm is proposed. Robots find next exploration area autonomously while updating the shared dynamic map. The algorithm is tested by simulation and the result is presented. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1007/978-3-642-33932-5_70 | INTELLIGENT AUTONOMOUS SYSTEMS 12 , VOL 2 |
Keywords | Field | DocType |
multi-robot,coverage,searching,cooperative searching | Search algorithm,Computer science,Artificial intelligence,Robot | Conference |
Volume | ISSN | Citations |
194 | 2194-5357 | 1 |
PageRank | References | Authors |
0.37 | 6 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Seohyun Jeon | 1 | 3 | 1.79 |
Minsu Jang | 2 | 102 | 11.99 |
Daeha Lee | 3 | 8 | 3.69 |
Young-Jo Cho | 4 | 149 | 20.92 |