A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Map construction and exploration by mobile agents scattered in a dangerous network
2009
2009 IEEE International Symposium on Parallel & Distributed Processing
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
doi:10.1109/ipdps.2009.5161080
dblp:conf/ipps/FlocchiniKMS09
fatcat:bfubukqxpbagxaafxharmfolbq