Distributed Control by Lagrangian Steepest Descent

Details Distributed Control by Lagrangian Steepest Descent Distributed Control by Lagrangian Steepest Descent

2004-03-10

arxiv.org/abs/cs/0403012v1

Computer Science

Multiagent Systems

8 pages

Scientific paper

Often adaptive, distributed control can be viewed as an iterated game between independent players. The coupling between the players' mixed strategies, arising as the system evolves from one instant to the next, is determined by the system designer. Information theory tells us that the most likely joint strategy of the players, given a value of the expectation of the overall control objective function, is the minimizer of a Lagrangian function of the joint strategy. So the goal of the system designer is to speed evolution of the joint strategy to that Lagrangian minimizing point, lower the expectated value of the control objective function, and repeat. Here we elaborate the theory of algorithms that do this using local descent procedures, and that thereby achieve efficient, adaptive, distributed control.

Affiliated with

Also associated with

No associations

Rating

Distributed Control by Lagrangian Steepest Descent does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distributed Control by Lagrangian Steepest Descent, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Control by Lagrangian Steepest Descent will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-418233