Minimal exposure paths in time-varying fields: a semi-lagrangian approach
| dc.creator | Armando Alves Neto | |
| dc.creator | Víctor Costa da Silva Campos | |
| dc.creator | Douglas G. Macharet | |
| dc.date.accessioned | 2025-05-27T14:28:34Z | |
| dc.date.accessioned | 2025-09-09T00:57:54Z | |
| dc.date.available | 2025-05-27T14:28:34Z | |
| dc.date.issued | 2023 | |
| dc.identifier.doi | 10.1109/lra.2022.3230595 | |
| dc.identifier.issn | 23773766 | |
| dc.identifier.uri | https://hdl.handle.net/1843/82521 | |
| dc.language | eng | |
| dc.publisher | Universidade Federal de Minas Gerais | |
| dc.relation.ispartof | IEEE Robotics and Automation Letters | |
| dc.rights | Acesso Restrito | |
| dc.subject | Robôs - Sistemas de controle | |
| dc.subject.other | Sensors , Wireless sensor networks , Robot sensing systems , Trajectory , Sensor phenomena and characterization , Cost function , Computational modeling | |
| dc.subject.other | Sensor networks , motion and path planning , optimization and optimal control | |
| dc.subject.other | Minimal Exposure , Minimum Path , Time-varying Field , Exposure Paths , semi-Lagrangian Approach , Optimal Path , Wireless Sensor Networks , Sensor Model , Field Sensor , Lowest Exposure , Static Ones , Navigation , Optimization Problem , Value Function , Running Time , Optimal Control , Control Input , Control Problem , Intensity Function , Path Planning , Papers In The Literature , Heterogeneous Network , Line System , Square Grid , Delaunay Triangulation , Voronoi Diagram , Mapping Algorithm , Distinct Intervals , Optimal Control Problem , Total Exposure | |
| dc.title | Minimal exposure paths in time-varying fields: a semi-lagrangian approach | |
| dc.type | Artigo de periódico | |
| local.citation.epage | 671 | |
| local.citation.issue | 2 | |
| local.citation.spage | 664 | |
| local.citation.volume | 8 | |
| local.description.resumo | In the context of Wireless Sensor Networks (WSNs), the Minimal Exposure Path (MEP) represents an important metric to evaluate the quality of network services. Most of the current literature is concentrated on stationary sensors, while few works have addressed the existence of moving nodes. Mobile Wireless Sensor Networks (MWSNs) present a great potential for detecting invaders compared to static ones, but dealing with dynamic sensors significantly increases the coverage complexity since the overall exposure of the sensor field depends on time. Therefore, in this letter, we propose an approach to compute Minimal Exposure Paths in time-varying fields based on a control optimization method called semi-Lagrangian (SL) scheme, in such a way that an intruder will be able to penetrate the dynamic field with the lowest exposure. The SL has already been proven to reach the optimal Minimal Exposure Path (MEP) on static WSNs, but concerning dynamic nodes, the proof is much more complicated. Then, we propose a heuristics that provides convergence of the SL algorithm to a result we conjecture to be the optimal one. Results with different time-varying sensor models in obstacle-free and cluttered environments have been presented and discussed. | |
| local.publisher.country | Brasil | |
| local.publisher.department | ENG - DEPARTAMENTO DE ENGENHARIA ELETRÔNICA | |
| local.publisher.department | ICX - DEPARTAMENTO DE CIÊNCIA DA COMPUTAÇÃO | |
| local.publisher.initials | UFMG | |
| local.url.externa | https://ieeexplore.ieee.org/document/9992088 |
Arquivos
Licença do pacote
1 - 1 de 1