Wyniki wyszukiwania dla: GRAPH DECONTAMINATION

• Decontaminating Arbitrary Graphs by Mobile Agents: a Survey

  Publikacja

  • D. Osula

  - UTILITAS MATHEMATICA - Rok 2019

  A team of mobile agents starting from homebases need to visit and clean all nodes of the network. The goal is to find a strategy, which would be optimal in the sense of the number of needed entities, the number of moves performed by them or the completion time of the strategy. Currently, the field of distributed graph searching by a team of mobile agents is rapidly expanding and many new approaches and models are being presented...

  Pełny tekst do pobrania w serwisie zewnętrznym

• Multi-agent graph searching and exploration algorithms

  Publikacja

  • D. Osula

  - Rok 2020

  A team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...

  Pełny tekst do pobrania w portalu