Parallel and Distributed Processing Symposium, International (2009)
May 23, 2009 to May 29, 2009
Paola Flocchini , School of Information Technology and Engineering, University of Ottawa, Canada
Matthew Kellett , Defence R&D Canada - Ottawa, Government of Canada, Canada
Peter Mason , Defence R&D Canada - Ottawa, Government of Canada, Canada
Nicola Santoro , School of Computer Science, Carleton University, Canada
We consider the map construction problem in a simple, connected graph by a set of mobile computation entities or agents that start from scattered locations throughout the graph. The problem is further complicated by dangerous elements, nodes and links, in the graph that eliminate agents traversing or arriving at them. The agents working in the graph communicate using a limited amount of storage at each node and work asynchronously. We present a deterministic algorithm that solves the exploration and map construction problems. The end result is also a rooted spanning tree and the election of a leader. The total cost of the algorithm is O(n<inf>s</inf> m) total number of moves, where m is the number of links in the network and n<inf>s</inf> is the number of safe nodes, improving the existing O(m<sup>2</sup>) bound.
Paola Flocchini, Matthew Kellett, Peter Mason, Nicola Santoro, "Map construction and exploration by mobile agents scattered in a dangerous network", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 1-10, 2009, doi:10.1109/IPDPS.2009.5161080