This chapter introduces and discusses the existing computational models employed in the literature for studying the feasibility and complexity of computations by mobile agents: computational mobile entities that operate and move in discrete spaces, modeled as graphs. While almost all models share some fundamental features, making basic common assumptions, their fundamental differences depend on the assumptions made on the capabilities of the agents, in particular on the means of interaction with the environment and of inter-agent communication. Clearly, there are many variations of the models, depending on the assumed level of synchrony, anonymity, persistent memory, and topological knowledge. This Chapter aims to provide an overview of these models and assumptions.
CITATION STYLE
Das, S., & Santoro, N. (2019). Moving and computing models: Agents. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11340 LNCS, pp. 15–34). Springer Verlag. https://doi.org/10.1007/978-3-030-11072-7_2
Mendeley helps you to discover research relevant for your work.