Antonio Leslie Bajuelos
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Antonio Leslie Bajuelos has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Carlos Gregorio Hernández Díaz-Ambrona
AgSystems, Ceigram, itdUPM, Universidad Politécnica de Madrid (UPM)
4 shared publications - Inês Matos
Universidade de Aveiro
4 shared publications Manuel Abellanas
Universidad Politécnica de Madrid
4 shared publications- Manuel Abellanas
Facultad de Informática, Universidad Politécnica de Madrid, Campus de Montegancedo, 28660 Boadilla del Monte, Madrid, Spain
3 shared publications - Ana Paula Tomás
Universidade do Porto
2 shared publications Inês Matos
Universidade de Aveiro
2 shared publications
Latest Publications
- 1 January 2012
- Published by Springer Nature
- p. 210-219
Connecting Red Cells in a Bicolour Voronoi Diagram
- 1 January 2012
- Published by Springer Nature
- p. 210-219
Connecting Red Cells in a Bicolour Voronoi Diagram
- 16 August 2011
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 55 (1) , 69-81
Minimizing the Range for k-Covered Paths on Sensor Networks
Coverage problems are a flourishing topic in optimization, thanks to the recent advances in the field of wireless sensor networks. The main coverage issue centres around critical conditions that require reliable monitoring and prohibit failures. This issue can be addressed by maximal-exposure paths, regarding which this article presents new results. Namely, it shows how to minimize the sensing range of a set of sensors in order to ensure the existence of a k-covered path between two points on a given region. Such a path's coverage depends on k≥2, which is fixed. The three types of regions studied are: a planar graph, the whole plane and a polygonal region.
- 16 August 2011
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 55 (1) , 69-81
Minimizing the Range for k-Covered Paths on Sensor Networks
Coverage problems are a flourishing topic in optimization, thanks to the recent advances in the field of wireless sensor networks. The main coverage issue centres around critical conditions that require reliable monitoring and prohibit failures. This issue can be addressed by maximal-exposure paths, regarding which this article presents new results. Namely, it shows how to minimize the sensing range of a set of sensors in order to ensure the existence of a k-covered path between two points on a given region. Such a path's coverage depends on k≥2, which is fixed. The three types of regions studied are: a planar graph, the whole plane and a polygonal region.
- 1 July 2011
- Published by Elsevier in Operations Research Letters
- Vol. 39 (4) , 241-245
Coverage restricted to an angle
- 1 July 2011
- Published by Elsevier in Operations Research Letters
- Vol. 39 (4) , 241-245
Coverage restricted to an angle
- 1 October 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 77-82
Metaheuristic Approaches for the Minimum Vertex Guard Problem
We address the problem of stationing guards in vertices of a simple polygon in such a way that the whole polygon is guarded and the number of guards is minimum. This problem is NP-hard with relevant practical applications. In this paper we propose three metaheuristic approaches to this problem. Combined with the genetic algorithms strategy, which was proposed, these four approximation algorithms have been implemented and compared. The experimental evaluation from the hybrid strategy shows significant improvement in the number of guards compared to theoretical bounds.
- 1 October 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 77-82
Metaheuristic Approaches for the Minimum Vertex Guard Problem
We address the problem of stationing guards in vertices of a simple polygon in such a way that the whole polygon is guarded and the number of guards is minimum. This problem is NP-hard with relevant practical applications. In this paper we propose three metaheuristic approaches to this problem. Combined with the genetic algorithms strategy, which was proposed, these four approximation algorithms have been implemented and compared. The experimental evaluation from the hybrid strategy shows significant improvement in the number of guards compared to theoretical bounds.
- Open Access
- 14 September 2009
- Published by MDPI AG in Algorithms
- Vol. 2 (3) , 1137-1154
Optimal 2-Coverage of a Polygonal Region in a Sensor Network
Wireless sensor networks are a relatively new area where technology is developing fast and are used to solve a great diversity of problems that range from museums’ security to wildlife protection. The geometric optimisation problem solved in this paper is aimed at minimising the sensors’ range so that every point on a polygonal region R is within the range of at least two sensors. Moreover, it is also shown how to minimise the sensors’ range to assure the existence of a path within R that stays as close to two sensors as possible.
- 14 September 2009
- Published by MDPI AG in Algorithms
- Vol. 2 (3) , 1137-1154
Open AccessOptimal 2-Coverage of a Polygonal Region in a Sensor Network
Wireless sensor networks are a relatively new area where technology is developing fast and are used to solve a great diversity of problems that range from museums’ security to wildlife protection. The geometric optimisation problem solved in this paper is aimed at minimising the sensors’ range so that every point on a polygonal region R is within the range of at least two sensors. Moreover, it is also shown how to minimise the sensors’ range to assure the existence of a path within R that stays as close to two sensors as possible.
- 4 September 2009
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 161 (6) , 909-918
The embracing Voronoi diagram and closest embracing number
- 4 September 2009
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 161 (6) , 909-918
The embracing Voronoi diagram and closest embracing number
- 1 June 2009
- Published by Elsevier in Information Processing Letters
- Vol. 109 (14) , 768-773
2-Covered paths by a set of antennas with minimum power transmission range
- 1 June 2009
- Published by Elsevier in Information Processing Letters
- Vol. 109 (14) , 768-773
2-Covered paths by a set of antennas with minimum power transmission range
- Open Access
- 1 June 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 421-432
Estimating the Maximum Hidden Vertex Set in Polygons
It is known that the maximum hidden vertex set problem on a given simple polygon is NP-hard (Shermer, 1989), therefore we focused on the development of approximation algorithms to tackle it. We propose four strategies to solve this problem, the first two (based on greedy constructive search) are designed specifically to solve it, and the other two are based on the general metaheuristics simulated annealing and genetic algorithms. We conclude, through experimentation, that our best approximate algorithm is the one based on the Simulated Annealing metaheuristic. The solutions obtained with it are very satisfactory in the sense that they are always close to optimal (with an approximation ratio of 1.7, for arbitrary polygons; and with an approximation ratio of 1.5, for orthogonal polygons). We, also, conclude,that on average the maximum number of hidden vertices in a simple polygon (arbitrary or orthogonal) with n vertices is n/4.
- 1 June 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 421-432
Open AccessEstimating the Maximum Hidden Vertex Set in Polygons
It is known that the maximum hidden vertex set problem on a given simple polygon is NP-hard (Shermer, 1989), therefore we focused on the development of approximation algorithms to tackle it. We propose four strategies to solve this problem, the first two (based on greedy constructive search) are designed specifically to solve it, and the other two are based on the general metaheuristics simulated annealing and genetic algorithms. We conclude, through experimentation, that our best approximate algorithm is the one based on the Simulated Annealing metaheuristic. The solutions obtained with it are very satisfactory in the sense that they are always close to optimal (with an approximation ratio of 1.7, for arbitrary polygons; and with an approximation ratio of 1.5, for orthogonal polygons). We, also, conclude,that on average the maximum number of hidden vertices in a simple polygon (arbitrary or orthogonal) with n vertices is n/4.