Distributed navigation in an unknown physical environment

摘要: We address the problem of navigating from an initial node to a goal by group agents in unknown physical environment. In such environments mobile must physically move around discover existence nodes and edges. assume that communicate exchanging messages about their discoveries, current locations intended plans. also agent can only with predefined set neighboring agents. A distributed algorithm, which is run independently each agent, presented. Given knowledge environment positions intentions other agents, algorithm instructs where go next. An experimental evaluation presented, constrained liberal neighborhood schemes. Results show it more beneficial have scheme because this intelligent behavior generates spread throughout efficiently. Agents reach fast length path they find very close optimal path.