By Topic

Coordination in hierarchical algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tryphon C. Xinogalas ; Control Systems Center, University of Manchester Institute of Science and Technology, Manchester M60 1QD, England ; Sastry Dasigi ; Madan G. Singh

An analogy between hierarchical computation and the univariate method in classical nonlinear programming is brought out. This provides a basis for determining the sources of inefficiency and divergence in several coordination schemes proposed in the literature. The analogy also indicates ways of improving them. Several algorithms, both from static and dynamic (linear and nonlinear) optimisation, are examined to illustrate the ideas presented. Each algorithm is used with the proposed strategy, defined as the univariate coordination and the conventional one, defined as the standard coordination, on a number of numerical examples. The gains in the computational efficiency confirm the superiority of univariate coordination. Apart from computational advantages, the analogy between hierarchical computation and the univariate method in nonlinear programming provides a rational basis for distributing the computational tasks among various levels. This is useful in deriving new multilevel optimisation algorithms.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:SMC-13 ,  Issue: 3 )