def test_scenario_one_multiple_searcher(self):
m = BasicMap(15, 15)
middle = (7,7)
# Add some lost persons to the map
lp00 = RandomWalkLostPerson(m)
lp00.init(middle)
searchers = []
for i in range(10):
# Add some searchers to the map
searcher = RandomWalkSearcher(m)
searcher.init(middle)
searchers.append(searcher)
s = Scenario(m, [lp00], searchers)
s.simulate(100) # Simulate for N time steps
print("lost person history: \n")
print(lp00.get_history())
print("\n")
for i in range(10):
print("searcher history: " , i)
print(searchers[i].get_history())
print("\n")
def test_scenario_randomWalker(self):
m = BasicMap(10, 10)
# Add some lost persons to the map
lp00 = RandomWalkLostPerson(m)
lp00.init((2, 5))
# Add some searchers to the map
searcher00 = StationarySearcher(m)
searcher00.init((4, 8))
s = Scenario(m, [lp00], [searcher00])
s.simulate(10) # Simulate for N time steps
print(lp00.get_history())
print(searcher00.get_history())
def test_quadrant_partitioner(self):
m = BasicMap(25, 25)
middle = (12, 12)
# Add some lost persons to the map
lp00 = RandomWalkLostPerson(m)
lp00.init(middle)
# Partition map into quadrants
searchers = []
partitioner = QuadrantPartitioner()
[rows_midpoint, cols_midpoint] = partitioner.partition(m)
quad01_rows = (0, rows_midpoint)
quad01_cols = (0, cols_midpoint)
s00 = RandomWalkSearcher(m, quad01_rows, quad01_cols)
s00.init(middle)
searchers.append(s00)
quad02_rows = (0, rows_midpoint)
quad02_cols = (cols_midpoint, m.numColumns()-1)
s01 = RandomWalkSearcher(m, quad02_rows, quad02_cols)
s01.init(middle)
searchers.append(s01)
quad03_rows = (rows_midpoint, m.numRows()-1)
quad03_cols = (0, cols_midpoint-1)
s02 = RandomWalkSearcher(m, quad03_rows, quad03_cols)
s02.init(middle)
searchers.append(s02)
quad04_rows = (rows_midpoint, m.numRows()-1)
quad04_cols = (cols_midpoint, m.numColumns()-1)
s03 = RandomWalkSearcher(m, quad04_rows, quad04_cols)
s03.init(middle)
searchers.append(s03)
scenario = Scenario(m, [lp00], searchers, latency=50)
scenario.simulate(100)
print("lost person history: \n")
print(lp00.get_history())
print("\n")
for i in range(4):
print("searcher history: " , i)
print(searchers[i].get_history())
print("\n")
def test_scenario_one_random_searcher(self):
m = BasicMap(15, 15)
middle = (7,7)
# Add some lost persons to the map
lp00 = RandomWalkLostPerson(m)
lp00.init(middle)
# Add some searchers to the map
searcher00 = RandomWalkSearcher(m)
searcher00.init(middle)
s = Scenario(m, [lp00], [searcher00])
s.simulate(100) # Simulate for N time steps
print("lost person history: \n")
print(lp00.get_history())
print("\n")
print("searcher history: ")
print(searcher00.get_history())
def test_vertical_sweep_searcher(self):
m = BasicMap(101, 101)
# m.print() interval: [0, 29]
middle = (50, 50)
# Add some lost persons to the map
lp00 = RandomWalkLostPerson(m)
lp00.init(middle)
num_searchers = 10
lane_size = int(30 / num_searchers)
lanes = []
lower = 0
upper = lane_size - 1
lanes.append((lower, upper))
while upper < 29:
lower = upper + 1
upper = upper + lane_size
lanes.append((lower, upper))
searchers = []
for i in range(0, len(lanes)):
searcher = VerticalSweepSearcher(m, lanes[i])
searcher.init((0, math.floor((lanes[i][0] + lanes[i][1])/2)))
searchers.append(searcher)
self.assertTrue(len(searchers) == num_searchers)
scenario = Scenario(m, [lp00], searchers)
scenario.simulate(100)
print("lost person history: \n")
print(lp00.get_history())
print("\n")
for i in range(num_searchers):
print("searcher history: " , i)
print(searchers[i].get_history())
print(len(searchers[i].get_history()))
print("\n")