![]() ![]() |
![]() |
|
Multi-Robot Coverage

|
Task Description: |
|
Given an area with known boundary but unknown internal layout, a group of n mobile robots are to co-operate and visit all places possible within boundary, in the shortest possible time and with minimum overlapping of coverage. |
| Progress: |
| Flash Example |
| Personnel: |
| Vincent Lee-Shue New, Ai Peng Samuel Sonne Ioannis Rekleitis Howie Choset |
| Publications: |
| Towards
Sensor-Based Coverage With Robot Teams |
| Related Topics: |
|
Demining |
Jump to: People | Robots | Research | Events | Projects | Education | Papers | Software | Links
© Copyright 2000 Sensor Based Planning Lab, Carnegie Mellon University. All Rights Reserved.