-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathplot_election.py
More file actions
162 lines (131 loc) · 5.61 KB
/
plot_election.py
File metadata and controls
162 lines (131 loc) · 5.61 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
import numpy as np
import matplotlib.pyplot as plt
from abc import ABC, abstractmethod
import argparse
from collections import OrderedDict
from helpers.fiedler import fiedler, normalized_fiedler
from data.formations import formations
from helpers.get_edges import get_edges
from helpers.print_graph import print_graph
from algorithms.floyd_warshall import floydWarshall, floydWarshallCenter
from algorithms.specify import SpecifySmallStep
import random
from structures.timed_communication_network import TimedNeighborCommunication, TimedBroadcastNode, TimedEnvironment
from structures.id_manager import IdManager
import pandas as pd
import networkx as nx
from helpers.mkdir_p import mkdir_p
import matplotlib.ticker as plticker
random.seed(12)
INF = 99999
def tie_breaker(leaders):
if len(leaders) == 0: return -1
return max(leaders)
def evaluate_noisy_broadcast(graph):
# Setup flock
flock_size = len(graph)
nodes = [TimedBroadcastNode(flock_size) for i in range(flock_size)]
manager = IdManager(graph, nodes)
env = TimedEnvironment(graph, manager)
for node in nodes:
node.set_communicator(TimedNeighborCommunication(node.id, manager, env))
def translate_id(leaders):
return [manager.get_index(id) for id in leaders]
# Fill routing table
for node in nodes:
node.setup()
states = [(0,[tie_breaker(translate_id(node.leader)) for node in nodes])]
t_steps = 0
last_t_steps = t_steps
while(len(env.packet_queue)):
# print("in process", sum(len(node.in_queue) for node in nodes))
last_t_steps = t_steps
env.run()
t_steps = env.time
if last_t_steps != t_steps:
states.append((t_steps,[tie_breaker(translate_id(node.leader)) for node in nodes]))
states.append((t_steps,[tie_breaker(translate_id(node.leader)) for node in nodes]))
print("took t={} to complete broadcast and election".format(t_steps))
# Assert all equal
center = set(manager.get_index(leader) for leader in nodes[0].leader)
for i,node in enumerate(nodes):
if i != 0:
leader_set = set(manager.get_index(leader) for leader in node.leader)
assert(len(center.symmetric_difference(leader_set)) == 0)
# print("processed ", [(node.id, node.packets_processed) for node in nodes])
# print("sent ", [(node.id, node.packets_sent) for node in nodes])
# print("total processed ", sum([node.packets_processed for node in nodes]))
# print("total sent ", sum([node.packets_sent for node in nodes]))
# print("routes", longest_route)
# print("routes for 0", nodes[0].route_t)
return list(center), states
def plot_states(node_states, correct, save_name = None):
steps = [t for (t,_) in node_states]
lines = [[] for _ in node_states[0][1]]
for i, (t, states) in enumerate(node_states):
for j,bot_val in enumerate(states):
lines[j].append(bot_val)
_, ax = plt.subplots()
loc = plticker.MultipleLocator(base=(1 if max(steps) < 20 else 5)) # this locator puts ticks at regular intervals
ax.xaxis.set_major_locator(loc)
# Plot correct answer as black dotted line
for data in lines:
line, = ax.plot(steps, data)
ax.plot(steps, [correct] * len(steps), '-', color = 'black', linewidth=4, marker="*", linestyle = 'None')
ax.set_ylabel('Agent Id', size="xx-large")
ax.set_xlabel('Time', size="xx-large")
ax.set_title('Election ({})'.format(save_name), size="xx-large")
plt.legend()
mkdir_p("figures/leader_election_convergence")
if save_name:
plt.savefig("figures/leader_election_convergence/{}.png".format(save_name))
plt.close()
else: plt.show()
if __name__ == "__main__":
#
# Arguments
#
parser = argparse.ArgumentParser()
parser.add_argument("--formation", type=int, help="enter a formation number/id",
nargs='?', default=0, const=0, choices=range(0, len(formations) + 1))
args = parser.parse_args()
# To Create a Formation, add one to `formations.py`
if args.formation == 0:
forms = formations
else:
form = formations[args.formation - 1]
forms = [form]
#
# Run Simulations
#
dash = '-' * 100
columns = ["Formation", "Test Result", "Predicted", "Center", "R", "D"]
print(dash)
print('{:<36s}{:<16s}{:<24s}{:<24s}{:<4s}{:<4s}'.format(*columns))
print(dash)
# Preload classes to allow decision tree to make only once
def format_edge(graph,u,v):
if u == v: return 0
if graph[u][v]: return graph[u][v]
else: return INF
def format_graph(graph):
V = len(graph)
return [[format_edge(graph,i,j) for j in range(V)] for i in range(V)]
def perform_test(graph, name, generate_figure = False):
if fiedler(graph) < 0.01:
return
formatted = format_graph(graph)
# print("formatted")
# print_graph(formatted)
center, radius, diameter = floydWarshallCenter(formatted)
predicted, states = evaluate_noisy_broadcast(graph)
result = ""
# If not predicted any false and at least one element in predicted also in true
if (len(set(predicted).symmetric_difference(center)) == 0): result = "SUCCESS"
print('{:<36s}{:<16s}{:<24s}{:<24s}{:<4d}{:<4d}'.format(name, result, str(predicted), str(center), radius, diameter))
print()
if generate_figure: plot_states(states, tie_breaker(center), save_name=name)
alg_results = OrderedDict()
for formation in forms:
for key in ["full", "tree"]:
perform_test(formation[key], formation["name"] + " " + key, True)