Scalable Task Cleanup Assignment for Multi-agents
This paper describes a group of robots for cleaning a simulated environment and proposes an ecient algorithm for navigation based on Path nding A *. No need for vision sensors. As a result it was observed that the robots can work cooperatively to clear the ground and that the navigation algorithm is...
Պահպանված է:
| Հիմնական հեղինակ: | |
|---|---|
| Այլ հեղինակներ: | , , , , |
| Ձևաչափ: | article |
| Լեզու: | իսպաներեն |
| Հրապարակվել է: |
2018
|
| Խորագրեր: | |
| Առցանց հասանելիություն: | http://revistas.utp.ac.pa/index.php/memoutp/article/view/2014 http://ridda2.utp.ac.pa/handle/123456789/5673 |
| Ցուցիչներ: |
Չկան պիտակներ, Եղեք առաջինը, ով նշում է այս գրառումը!
|
| Ամփոփում: | This paper describes a group of robots for cleaning a simulated environment and proposes an ecient algorithm for navigation based on Path nding A *. No need for vision sensors. As a result it was observed that the robots can work cooperatively to clear the ground and that the navigation algorithm is e ective in cleaning. In order to test its eciency it was compared the combination of the Path nding A* algorithm and the decision algorithm proposed in this paper with Path nding A* and Euclidean distance, resulted in an improvement in time and distance traveled. |
|---|