mobile agent

Finite graph exploration by a mobile agent

The paper considers the task of finite connected graph exploration by a mobile agent.  The mobile agent moves along the graph, reads and changes marks of the graph elements, and explores the graph based on this information.  A new algorithm for finite undirected graph exploration of time complexity O(n3), space complexity O(n2) and the upper estimate of the number of transitions along the edges made by the agent O(n3) is proposed.  For the algorithm to work, the agent needs one color.  The algorithm is based on depth-first traversal method.

Coscheduling Spatial Self-organization and Distributed Data Collection in Multi-agent System

The problem of coscheduling spatial self-organization control processes and distributed data collection processes in a multi-agent system has been considered. The goal of coscheduling is to find and use the possibilities of functional coordination of these processes and increase the efficiency of the multi-agent system due to their parallel execution. An analysis of the main features of spatial self-organization tasks that affect the solution of the problem of coscheduling has been carried out.