Geodesic
Identification of the sensors configuration and flows control
Journal of the Belarusian State University. Mathematics and Informatics, Tome 2 (2018), pp. 67-76.

Voir la notice de l'article provenant de la source Math-Net.Ru

The article is devoted to the development of strategies for identifying the location of special programmable devices (sensors) in network nodes for collecting, processing, analyzing information about the flow function in order to evaluate arc flows in that part of the network that is not directly observed. One of the ways to solve this problem is to search through possible placements, based on heuristic considerations. In work as a model of a flow network with sensors, a sparse underdetermined system of linear algebraic equations is used. The conditions for the uniqueness of the solution of a special kind of system obtained as a result of the use of a priori information from sensors installed in the monitored nodes of the network are determined. However, checking these conditions with a full search can only be used for small networks. The estimations limiting the number of viewed configurations of nodes are obtained and the interval of changing the number of monitored nodes that guarantee the complete observability of the network is justified. These results make it possible to increase the dimensionality of the problems being solved. Methods are developed for finding suboptimal solutions to establish the complete observability of the network for a given intensity threshold. Numerical results of constructing suboptimal solutions for various values of the intensity threshold are obtained. The results of visualization of the sensory configuration of the observed nodes are presented, which guarantee complete observability of the network. Conditions for effective applicability of exact methods are obtained for problems of the investigated class.
Keywords: graph, sparse system, modeling, configuration of sensors, optimal and suboptimal solutions, visualization. 
@article{BGUMI_2018_2_a7,
     author = {L. Pilipchuk and A. S. Pilipchuk and E. N. Polyachok and A. I. Farazei},
     title = {Identification of the sensors configuration and flows control},
     journal = {Journal of the Belarusian State University. Mathematics and Informatics},
     pages = {67--76},
     publisher = {mathdoc},
     volume = {2},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/BGUMI_2018_2_a7/}
}
TY  - JOUR
AU  - L. Pilipchuk
AU  - A. S. Pilipchuk
AU  - E. N. Polyachok
AU  - A. I. Farazei
TI  - Identification of the sensors configuration and flows control
JO  - Journal of the Belarusian State University. Mathematics and Informatics
PY  - 2018
SP  - 67
EP  - 76
VL  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/BGUMI_2018_2_a7/
LA  - ru
ID  - BGUMI_2018_2_a7
ER  - 
%0 Journal Article
%A L. Pilipchuk
%A A. S. Pilipchuk
%A E. N. Polyachok
%A A. I. Farazei
%T Identification of the sensors configuration and flows control
%J Journal of the Belarusian State University. Mathematics and Informatics
%D 2018
%P 67-76
%V 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/BGUMI_2018_2_a7/
%G ru
%F BGUMI_2018_2_a7
L. Pilipchuk; A. S. Pilipchuk; E. N. Polyachok; A. I. Farazei. Identification of the sensors configuration and flows control. Journal of the Belarusian State University. Mathematics and Informatics, Tome 2 (2018), pp. 67-76. http://geodesic.mathdoc.fr/item/BGUMI_2018_2_a7/

[1] L. Bianco, G. Confessore, M. Gentili, “Combinatorial aspects of the sensor location problem”, Annals of Operation Research, 144(1) (2006), 201–234 | DOI | MR | Zbl

[2] L. Bianco, G. Confessore, P. Reverberi, “A network based model for traffic sensor location with implication in O/D matrix estimates”, Transportation Science, 35(1) (2001), 50–60 | DOI | Zbl

[3] L. A. Pilipchuk, “Sparse Linear Systems and Their Applications”, Minsk: Belarusian State University, 2013

[4] L. Bianco, C. Cerrone, R. Cerulli, M. Gentili, “Locating sensors to observe network arc flows: exact and heuristic approaches”, Computers and Operation Research, 46 (2014), 12–22 | DOI | MR | Zbl

[5] L. A. Pilipchuk, A. S. Pilipchuk, “Sparse linear systems: theory of decomposition, methods, technology, applications and implementation in Wolfram Mathematica”, AIP Conference Proceedings, 1690(1) (2015), 060006 | DOI

[6] M. Fidler, I. Nedoma, Ya. Ramik, I. Ron, K. Tsimmermann, “Zadachi lineinoi optimizatsii s netochnymi dannymi”, Moskva: Institut kompyuternykh issledovanii, 2008

[7] R. Gabasov, F. M. Kirillova, O. I. Kostyukova, “Konstruktivnye metody optimizatsii. Setevye zadachi”, Minsk: BGU, 1986 | Zbl

[8] L. Pilipchuk, A. Pilipchuk, Y. Pesheva, “Algorithms for construction of optimal and suboptimal solutions in network optimization problems”, International Journal of Pure and Applied Mathematics, 54(2) (2009), 193–205 | MR | Zbl

[9] I. V. Romanovskii, “Suboptimalnye resheniya”, Petrozavodsk: Izdatelstvo Petrozavodskogo universiteta, 1998

[10] I. V. Romanovskii, “Perebor suboptimalnykh reshenii v diskretnykh zadachakh optimizatsii”, Kompyuternye instrumenty v obrazovanii, 6 (2012), 25–34