Your browser does not support JavaScript!

An algorithm for observability determination in water-system state estimation

An algorithm for observability determination in water-system state estimation

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IEE Proceedings D (Control Theory and Applications) — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A new algorithm for efficient determination of topological observability in water-system state estimation has been proposed. The algorithm is based on observation that the search for a spanning tree of full rank can be performed as a sequence of maximum assignments. After giving a brief outline of the observability theory expressed in terms of water systems, the algorithm is described in full detail. Computational efficiency of the algorithm is evaluated on a 34-node water distribution system.


    1. 1)
      • I.S. Duff . On algorithms for obtaining maximum transversal. ACM Trans. , 3 , 315 - 330
    2. 2)
      • Edelman, H.: `A universal assessment for the superior quality of distribution of measuring points for the state-estimate of high voltage network', Proc. 5th PSC Conference, 1975, Cambridge.
    3. 3)
      • Koglin, H.J.: `Optimal measuring system for state estimation', Proc. 5th PSC Conference, 1975, Cambridge.
    4. 4)
      • K.A. Clements , G.R. Krumpholz , P.W. Davis . Power system observability: apractical algorithm using network topology. IEEE Trans. , 1534 - 1542
    5. 5)
      • E.A. Dinic . Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Math. Docl. , 5 , 1277 - 1280
    6. 6)
      • E. Handshin , C. Bongers . (1972) , Theoretical and practical considerations in the design of state estimators for electric power systems.
    7. 7)
      • Hopcroft, J., Karp, R.M.: `An ', IEEE Conf. Record 12th Annual Symposium on Switching and Automata Theory, 1971, p. 122–125.
    8. 8)
      • Narsingh Deo . (1980) , Graph theory with applications to engineering and computer science.
    9. 9)
      • Clements, K.A., Wollenberg, B.F.: `An algorithm for observability determination in power system state estimation', IEEE PES Summer Meeting, 1975.
    10. 10)
      • J. Hopcroft , R. Tarjan . Efficient algorithms for graph manipulation. Commun. ACM , 6 , 372 - 378

Related content

This is a required field
Please enter a valid email address