Distributed Control by Lagrangian Steepest Descent
| dc.creator | Wolpert, David H. | |
| dc.creator | Bieniawski, Stefan | |
| dc.date | 2004-03-10 | |
| dc.date.accessioned | 2026-07-07T03:20:59Z | |
| dc.date.available | 2026-07-07T03:20:59Z | |
| dc.description | 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. | |
| dc.description | 8 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0403012 | |
| dc.identifier | http://arxiv.org/abs/cs/0403012 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32031 | |
| dc.subject | Multiagent Systems | |
| dc.subject | Computer Science and Game Theory | |
| dc.subject | Adaptation and Self-Organizing Systems | |
| dc.subject | J.6; J.7; G.m | |
| dc.title | Distributed Control by Lagrangian Steepest Descent | |
| dc.type | text |