Date of Award
1996
Document Type
Thesis
Publication Status
Version of Record
Submission Date
October 2026
Thesis/Dissertation Advisor [Chair]
Larrondo-Petrie, Maria M.
Abstract
Based on multi-agent supporting system (MASS) structures used to investigate the synchronous algorithms in my previous work, the partially and totally asynchronous distributed algorithms are proposed in this thesis. The stability of discrete MASS with asynchronous distributed algorithms is analyzed. The partially asynchronous algorithms proposed for both 1- and 2-dimensional MASS are proven to be convergent, if the vertical disturbances vary sufficiently slower than the convergent time of the system. The adjacent error becomes zero when the system converges. It is also proven that in 1-dimensional MASS using the proposed totally asynchronous algorithm, the maximum of the absolute value of the adjacent error is non-increasing over time. Finally, the simulation results for all the above cases are presented to demonstrate the theoretical findings.
Extent
130 p.
Recommended Citation
Jin, Kai., "Asynchronous distributed algorithms for multi-agent supporting systems" (1996). Electronic Theses and Dissertations 1990 - 1999. 868.
https://digitalcommons.fau.edu/etd_general_4/868
Identifier
FADT15277
Comments
College of Engineering and Computer Science|FAU Electronic Theses and Dissertations Collection|Thesis (M.S.C.S.)--Florida Atlantic University, 1996.|College of Engineering and Computer Science