In this work, connectivity graphs have been studied as models of local interactions in multi-agent robotic systems. A systematic study of the space of connectivity graphs has been done from a geometric and topological point of view. Some results on the realization of connectivity graphs in their respective configuration spaces have been given. A complexity analysis of networks, from the point of view of intrinsic structural complexity, has been given. Various topological spaces in networks, as induced from their connectivity graphs, have been recognized and put into applications, such as those concerning coverage problems in sensor networks. A framework for studying dynamic connectivity graphs has been proposed. This framework has been used for several applications that include the generation of low-complexity formations as well as collaborative beamforming in sensor networks. The theory has been verified by generating extensive simulations, with the help of software tools of computational homology and semi-definite programming. Finally, several open problems and areas of further research have been identified.
| Identifer | oai:union.ndltd.org:GATECH/oai:smartech.gatech.edu:1853/7596 |
| Date | 16 December 2005 |
| Creators | Muhammad, Abubakr |
| Publisher | Georgia Institute of Technology |
| Source Sets | Georgia Tech Electronic Thesis and Dissertation Archive |
| Language | en_US |
| Detected Language | English |
| Type | Dissertation |
| Format | 1785551 bytes, application/pdf |
Page generated in 0.002 seconds