We study an optimization problem which involves wireless power transmission and data collection technologies. The addressed problem is a variant of the Covering Tour Problem (CTP), where the resource consumption is taken into account. It is called Resource Constrained CTP (RCCTP). We consider nodes (smart devices) deployed in a given area, that have to be covered. An agent starts its tour from an origin node, visits portions of the area, and reaches a destination node. The agent, associated with a covering radius, has to cover all the nodes when performing her/his tour. The task of the agent is to provide a service to the covered nodes, i.e., power transmission and/or data collection. Moving in the area and performing the task require a certain amount of resource. The resource consumption depends on the tour and the nodes covered. Hence, the agent can choose the positions, from which it starts to deliver the service to cover a certain number of nodes at a time. The RCCTP aims at covering all the nodes through the agent, such that the total quantity of resource, consumed to perform the task and travel along the tour, does not exceed a certain threshold. We provide a formal definition of the problem along with a mathematical formulation. A computational phase is carried out on instances generated starting from benchmarks for the CTP.

Optimization of monitoring, data collecting, and energy resupplying tasks with scarce resources

Di Puglia Pugliese, Luigi
Membro del Collaboration Group
;
Sammarra, Marcello
Membro del Collaboration Group
;
2025

Abstract

We study an optimization problem which involves wireless power transmission and data collection technologies. The addressed problem is a variant of the Covering Tour Problem (CTP), where the resource consumption is taken into account. It is called Resource Constrained CTP (RCCTP). We consider nodes (smart devices) deployed in a given area, that have to be covered. An agent starts its tour from an origin node, visits portions of the area, and reaches a destination node. The agent, associated with a covering radius, has to cover all the nodes when performing her/his tour. The task of the agent is to provide a service to the covered nodes, i.e., power transmission and/or data collection. Moving in the area and performing the task require a certain amount of resource. The resource consumption depends on the tour and the nodes covered. Hence, the agent can choose the positions, from which it starts to deliver the service to cover a certain number of nodes at a time. The RCCTP aims at covering all the nodes through the agent, such that the total quantity of resource, consumed to perform the task and travel along the tour, does not exceed a certain threshold. We provide a formal definition of the problem along with a mathematical formulation. A computational phase is carried out on instances generated starting from benchmarks for the CTP.
2025
Istituto di Calcolo e Reti ad Alte Prestazioni - ICAR
covering tour problem
mathematical formulation
path planning
resource constraint
File in questo prodotto:
File Dimensione Formato  
ProcediaComputerScience.pdf

accesso aperto

Tipologia: Versione Editoriale (PDF)
Licenza: Creative commons
Dimensione 794.66 kB
Formato Adobe PDF
794.66 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/559584
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact