Decentralized closing ranks in vehicle formations and sensor networks
In this paper, we present recent results on the closing ranks problem in vehicle formations and sensor networks. The closing ranks problem is to determine new sensing/communication links in the event of agent failure in order to recover certain properties of the underlying information architecture. We model the information architecture as a graph G(V.E), where V is a set of vertices representing the agents and E is a set of edges representing information flow amongst the agents. We focus on two...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of Mediterranean Conference on Control and Automation 2008|
|01_Summers_Decentralized_closing_ranks_in_2008.pdf||362.46 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.