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
Lecture Notes in Computer Science
Physical A* (PHA*) and its multi-agent version MAPHA* [2, 3] are algorithm that find the shortest path between two points in an unknown real physical environment with one or many mobile agents. Previous work assumed a complete sharing of knowledge between agents. Here we apply this algorithm to a more restricted model of communication which we call large pheromones, where agents communicate by writing and reading data at nodes of the graph that constitutes their environment. Unlike smalldoi:10.1007/978-3-540-28646-2_36 fatcat:log5s6opjjb55pds5ndekvdtcq