auto_crawler.py 5.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153
  1. from lottery import *
  2. from threading import Thread
  3. from argparse import ArgumentParser
  4. avg_len = 5
  5. kp_STEP=0.01
  6. KP_SEARCH= -0.04019999999996926
  7. KI_STEP=0.01
  8. KI_SEARCH=-0.002299999823093906
  9. KD_STEP=0.01
  10. KD_SEARCH=0.03840000000000491
  11. EPSILON=0.0001
  12. RUNNING_TIME=1000
  13. NODES = 1000
  14. highest_acc = 0
  15. KP='kp'
  16. KI='ki'
  17. KD='kd'
  18. KP_RANGE_MULTIPLIER = 2
  19. KI_RANGE_MULTIPLIER = 2
  20. KD_RANGE_MULTIPLIER = 2
  21. highest_gain = (KP_SEARCH, KI_SEARCH, KD_SEARCH)
  22. parser = ArgumentParser()
  23. parser.add_argument('-p', '--high-precision', action='store_true')
  24. parser.add_argument('-r', '--randomize-nodes', action='store_false')
  25. parser.add_argument('-t', '--rand-running-time', action='store_false')
  26. parser.add_argument('-d', '--debug', action='store_false')
  27. args = parser.parse_args()
  28. high_precision = args.high_precision
  29. randomize_nodes = args.randomize_nodes
  30. rand_running_time = args.rand_running_time
  31. debug = args.debug
  32. def experiment(accs=[], controller_type=CONTROLLER_TYPE_DISCRETE, kp=0, ki=0, kd=0, distribution=[], hp=True):
  33. dt = DarkfiTable(ERC20DRK, RUNNING_TIME, controller_type, kp=kp, ki=ki, kd=kd)
  34. RND_NODES = random.randint(5, NODES) if randomize_nodes else NODES
  35. for idx in range(0,RND_NODES):
  36. darkie = Darkie(distribution[idx])
  37. dt.add_darkie(darkie)
  38. acc = dt.background(rand_running_time, hp)
  39. return acc
  40. def multi_trial_exp(kp, ki, kd, distribution = [], hp=True):
  41. global highest_acc
  42. global highest_gain
  43. new_record=False
  44. exp_threads = []
  45. accs = []
  46. for i in range(0, AVG_LEN):
  47. acc = experiment(accs, CONTROLLER_TYPE_DISCRETE, kp=kp, ki=ki, kd=kd, distribution=distribution, hp=hp)
  48. accs += [acc]
  49. avg_acc = sum(accs)/float(AVG_LEN)
  50. buff = 'accuracy:{}, kp: {}, ki:{}, kd:{}'.format(avg_acc, kp, ki, kd)
  51. if avg_acc > 0:
  52. gain = (kp, ki, kd)
  53. acc_gain = (avg_acc, gain)
  54. if avg_acc > highest_acc:
  55. new_record = True
  56. highest_acc = avg_acc
  57. highest_gain = (kp, ki, kd)
  58. with open("highest_gain.txt", 'w') as f:
  59. f.write(buff)
  60. return buff, new_record
  61. SHIFTING = 0.05
  62. def crawler(crawl, range_multiplier, step=0.1):
  63. start = None
  64. if crawl==KP:
  65. start = highest_gain[0]
  66. elif crawl==KI:
  67. start = highest_gain[1]
  68. elif crawl==KD:
  69. start = highest_gain[2]
  70. range_start = (start*range_multiplier if start <=0 else -1*start)
  71. range_end = (-1*start if start<=0 else range_multiplier*start)
  72. # if number of steps under 10 step resize the step to 50
  73. while (range_end-range_start)/step < 10:
  74. range_start -= SHIFTING
  75. range_end += SHIFTING
  76. step /= 10
  77. crawl_range = np.arange(range_start, range_end, step)
  78. np.random.shuffle(crawl_range)
  79. crawl_range = tqdm(crawl_range)
  80. distribution = [random.gauss(ERC20DRK/NODES, ERC20DRK/NODES*0.1) for i in range(NODES)]
  81. for i in crawl_range:
  82. kp = i if crawl==KP else highest_gain[0]
  83. ki = i if crawl==KI else highest_gain[1]
  84. kd = i if crawl==KD else highest_gain[2]
  85. buff, new_record = multi_trial_exp(kp, ki, kd, distribution, hp=high_precision)
  86. crawl_range.set_description('highest:{} / {}'.format(highest_acc, buff))
  87. if new_record:
  88. break
  89. while True:
  90. prev_highest_gain = highest_gain
  91. # kp crawl
  92. crawler(KP, KP_RANGE_MULTIPLIER, KP_STEP)
  93. if highest_gain[0] == prev_highest_gain[0]:
  94. KP_RANGE_MULTIPLIER+=1
  95. KP_STEP/=10
  96. else:
  97. start = highest_gain[0]
  98. range_start = (start*KP_RANGE_MULTIPLIER if start <=0 else -1*start) - SHIFTING
  99. range_end = (-1*start if start<=0 else KP_RANGE_MULTIPLIER*start) + SHIFTING
  100. while (range_end - range_start)/KP_STEP >500:
  101. if KP_STEP < 0.1:
  102. KP_STEP*=10
  103. KP_RANGE_MULTIPLIER-=1
  104. #TODO (res) shouldn't the range also shrink?
  105. # not always true.
  106. # how to distinguish between thrinking range, and large step?
  107. # good strategy is step shoudn't > 0.1
  108. # range also should be > 0.8
  109. # what about range multiplier?
  110. # ki crawl
  111. crawler(KI, KI_RANGE_MULTIPLIER, KI_STEP)
  112. if highest_gain[1] == prev_highest_gain[1]:
  113. KI_RANGE_MULTIPLIER+=1
  114. KI_STEP/=10
  115. else:
  116. start = highest_gain[1]
  117. range_start = (start*KI_RANGE_MULTIPLIER if start <=0 else -1*start) - SHIFTING
  118. range_end = (-1*start if start<=0 else KI_RANGE_MULTIPLIER*start) + SHIFTING
  119. while (range_end - range_start)/KI_STEP >500:
  120. if KP_STEP < 0.1:
  121. KI_STEP*=10
  122. KI_RANGE_MULTIPLIER-=1
  123. # kd crawl
  124. crawler(KD, KD_RANGE_MULTIPLIER, KD_STEP)
  125. if highest_gain[2] == prev_highest_gain[2]:
  126. KD_RANGE_MULTIPLIER+=1
  127. KD_STEP/=10
  128. else:
  129. start = highest_gain[2]
  130. range_start = (start*KD_RANGE_MULTIPLIER if start <=0 else -1*start) - SHIFTING
  131. range_end = (-1*start if start<=0 else KD_RANGE_MULTIPLIER*start) + SHIFTING
  132. while (range_end - range_start)/KD_STEP >500:
  133. if KD_STEP < 0.1:
  134. KD_STEP*=10
  135. KD_RANGE_MULTIPLIER-=1