T-Relative Fuzzy Linear Programming for T-Relative Fuzzy Target Coverage Problems
Abstract
Optimal set covering problems are commonplace in communication, remote sensing, logistics, image processing, and network fields [3]. Thus, studies on determining optimal covering sets (sensors) of points (targets) in a region have emerged recently. One characteristic of these studies is the consideration of cases where a target is considered fully covered when it falls within a coverage area ("Boolean" coverage). Consequently, optimality solutions/methods/algorithms founded on this coverage scheme are usually too restrictive and (or) precise and so are not suitable for many complex and real life situations, which are most times plagued with ambiguity, vagueness, imprecision and approximate membership of points and (or) covering sets.
Fuzzy structures have proven to be suitable for the representation and analysis of such complex systems with many successful applications. Although fuzzy sets generalizes a set, a more recent generalization for both and its related concepts is the Relative fuzzy set [1] which gives a dynamic fuzzy representation to sets. T-Relative Fuzzy fixed points results of T-Relative fuzzy maps were studied in [5] and recently, the concept of T-Relative fuzzy linear programming [6] was introduced as a generalization of fuzzy linear programming. The results were applied to generalize the Boolean set based covering problems in literature to a T-Relative fuzzy Boolean coverage one. Although, Shan et al. in [15] and others [16] - [21] have given a probabilistic coverage consideration but this lacks subjectivity in representing vagueness and imprecision inherent in most systems.
In this present article the Linear Programming (LP) formulation of “A Computational Physics-based Algorithm for Target Coverage Problems" by Jordan Barry and Christopher Thron is generalized by considering a fuzzy and relative fuzzy target coverage instead of the crisp set Boolean coverage. Also we introduce the Fuzzy Linear Programming (FLP) and the T-Relative Fuzzy Linear Programming (RFLP) for the set coverage problem which allows for ascertaining dynamic optimality with aspiration levels.
References
Osawaru, K. E., Olaleru, J. O., & Olaloluwa, H. O. (2018). T-relative fuzzy sets. Journal of Fuzzy Set Valued Analysis, 2, 86-110. https://doi.org/10.5899/2018/jfsva-00411
Zadeh, L. A. (1965). Fuzzy set. Information and Control, 8, 338. https://doi.org/10.1016/S0019-9958(65)90241-X
Barry, J., & Thron, C. (2019). A computational physics-based algorithm for target coverage problems. In S. Shandilya, S. Shandilya & A. Nagar (Eds.), Advances in nature-inspired computing and applications. EAI/Springer Innovations in Communication and Computing. Springer, Cham. https://doi.org/10.1007/978-3-319-96451-5_12
Barry, J., & Thron, C. (2017). Nebular algorithm code. Retrieved from https://github.com/jthomasbarry/nebular
Osawaru, K. E., Olaleru, J. O., & Akewe, H. (2020). T-relative fuzzy maps and some fixed point results. Jordan Journal of Mathematics and Statistics, 13, 61-88.
Osawaru, K. E., & Olowu, O. O. (2023). T-relative fuzzy linear programming. International Journal of Mathematics Trends and Technology, 69(9), 13-22. https://doi.org/10.14445/22315373/IJMTT-V69I9P503
Chavez, E., Navarro, G., Baeza-Yates, R., & Marroquín, J. L. (2001). Searching in metric spaces. ACM Computing Surveys (CSUR), 33(3), 273-321. https://doi.org/10.1145/502807.502808
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. A. M. T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182-197. https://doi.org/10.1109/4235.996017
Đurišić, M. P., Tafa, Z., Dimić, G., & Milutinović, V. (2012). A survey of military applications of wireless sensor networks. 2012 Mediterranean Conference on Embedded Computing (MECO), Bar, Montenegro, 196-199.
Hochbaum, D. S., & Maass, W. (1985). Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM (JACM), 32(1), 130-136. https://doi.org/10.1145/2455.214106
Zou, Y., & Chakrabarty, K. (2003). Sensor deployment and target localization based on virtual forces. In IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications, San Francisco, CA, USA, 2, 1293-1303. https://doi.org/10.1109/INFCOM.2003.1208965
Zimmermann, K. (1991). Fuzzy set covering problem. International Journal of General Systems, 20, 127-131. https://doi.org/10.1080/03081079108945020
Hwang, M. J., Chiang, C. I., & Liu, Y. H. (2004). Solving a fuzzy set-covering problem. Mathematical and Computer Modelling, 40, 861-865. https://doi.org/10.1016/j.mcm.2004.10.015
Njoya, A. N., Thron, C., Barry, J., Abdou, W., Tonye, E., Siri Lawrencia Konje, N., & Dipanda, A. (2019). Efficient scalable sensor node placement algorithm for fixed target coverage applications of wireless sensor networks. IET Wireless Sensor Systems, 7, 44-54. https://doi.org/10.1049/iet-wss.2016.0076
Shan, A., Xu, X., & Cheng, Z. (2016). Target coverage in wireless sensor networks with probabilistic sensors. Sensor, 16(9), 1372. https://doi.org/10.3390/s16091372
Ahmed, N., Kanhere, S., & Jha, S. (2005). Probabilistic coverage in wireless sensor networks. Proceedings of the Conference on Local Computer Networks (LCN), Sydney, 672-681. https://doi.org/10.1109/LCN.2005.109
Carter, B., & Ragade, R. (2009). A probabilistic model for the deployment of sensors. Proceedings of the Sensors Applications Symposium, New Orleans, 7-12. https://doi.org/10.1109/SAS.2009.4801767
Zorbas, D., & Razafindralambo, T. P. (2013). Prolonging network lifetime under probabilistic target coverage in wireless mobile sensor networks. Comput. Commun., 36, 1039-1053. https://doi.org/10.1016/j.comcom.2012.07.021
Kim, C. M., Kim, Y., Kang, I. S., Lee, K., & Han, Y. H. (2012). A scheduling algorithm for connected target coverage under probabilistic coverage model. Proceedings of the International Conference on Information Networking, Indonesia, 86-91.
Wu, Y., Yin, J., Li, M., & Zhu, E. (2008). Efficient algorithms for probabilistic k-coverage in directional sensor networks. Proceedings of the International Conference on Intelligent Sensors, Sensor Networks and Information Processing, Australia, 587-592.
Ren, S., Li, Q., Wang, H., Chen, X., & Zhang, X. (2005). A study on object tracking quality under probabilistic coverage in sensor networks. ACM Sigmob. Mob. Comput. Commun. Rev., 9, 73-76. https://doi.org/10.1145/1055959.1055971
This work is licensed under a Creative Commons Attribution 4.0 International License.
.jpg){kind=logo}
