A Distributed Algorithm for Cooperative 3D Exploration under Communication Constraints
An algorithm for distributed exploration in 3D is presented which always keeps the robots within communication range of each other. The method is based on a greedy optimization strategy that uses a heuristic utility function. This makes it computationally very efficient but it can also lead to local...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2013-12-01
|
| Series: | Paladyn |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/pjbr-2013-0020 |