Premium
Decentralized adaptive scheduling using consensus variables
Author(s) -
Moore Kevin L.,
Lucarelli Dennis
Publication year - 2006
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.1143
Subject(s) - setpoint , scheduling (production processes) , computer science , negotiation , distributed computing , network topology , consensus , mathematical optimization , multi agent system , operations research , artificial intelligence , engineering , mathematics , computer network , law , political science
In this paper we present a new approach to decentralized adaptive scheduling, using recent results on the control of consensus variables in graphs with nearest‐neighbour communication topologies. First, existing results for single consensus variables are extended to include the cases of forced consensus, when one of the negotiating agents is driven by a setpoint, and of constrained consensus, where multiple consensus variables are required to be separated by a fixed amount. Next, we consider a class of adaptive scheduling problems, whereby a set of decentralized coordinators should cooperate to adapt shared schedule times in response to disturbances or changes in the system. Our approach is to choose task timings to be the consensus variables in the system. The utility of these ideas is illustrated using the example of a synchronized strike mission. Copyright © 2006 John Wiley & Sons, Ltd.