Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/103067| Title: | Multi-robot energy-aware coverage control in the presence of time-varying importance regions |
| Authors: | Duca, Rachael N. Bugeja, Marvin K. |
| Keywords: | Robots -- Control systems Multiagent systems Algorithms Voronoi polygons Mobile robots |
| Issue Date: | 2020 |
| Publisher: | Elsevier Ltd |
| Citation: | Duca, R. N., & Bugeja, M. K. (2020). Multi-robot energy-aware coverage control in the presence of time-varying importance regions. IFAC-PapersOnLine, 53(2), 9676-9681. |
| Abstract: | Multi-robot systems are becoming widely popular in applications where a rapid response is required or where various different robotic capabilities are required. Applications such as surveillance, or search and rescue, would require an efficient team that can be deployed and optimally dispersed over the environment. This is known as the coverage control problem. The solution to this research optimization problem is affected by several external aspects, such as characteristics of the environment as well as factors that pertain to the robotic team. This work proposes a novel solution to the complete coverage problem where the team of robots is restricted with energy limitations, and must cover an environment that has time-varying regions of importance. Our results show that in a realistic scenario, where the robots have limited energy for the task in question, the proposed solution performs significantly better than a typical coverage algorithm which disregards the energy considerations of the robotic team. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/103067 |
| ISSN: | 24058963 |
| Appears in Collections: | Scholarly Works - FacEngSCE |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Multi-robot_energy-aware_coverage_control_in_the_presence_of_time-varying_importance_regions(2020).pdf | 424.08 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.
