This repo contains all homeworks from "Multi-Agent Systems" course.
Below are listed all tasks with links and descriptions.
15.10.19
Platforms for development multi-agent systems
-
You're given 10 agents. Each agent randomly connected to other agents. Each agent proposes a number. Agents are able to communicate only with neighbours. Program should count a mean value. For example:
- Each agent may contain dictionary with other's agents id's, and program stops after point where each agent have information about other agents.
05.11.19
Multi-Agent management in dynamic network
Graph theory. Consensus in dynamic networks
-
You're given 10 agents. Each agent randomly connected to other agents. Each agent proposes a number. Agents are able to communicate only with neighbours. Agents may send data with mistakes and with a random delay (information reaches target on the next tick). Program should count a mean value in a way:
- If graph is balanced, sum and substract values from nearest agent so after some iteration each agent will have mean value in itself.