diff --git a/PathPlanning/BatchInformedRRTStar/animation.gif b/PathPlanning/BatchInformedRRTStar/animation.gif
new file mode 100644
index 00000000..937a7920
Binary files /dev/null and b/PathPlanning/BatchInformedRRTStar/animation.gif differ
diff --git a/PathPlanning/BatchInformedRRTStar/batch_informed_rrtstar.py b/PathPlanning/BatchInformedRRTStar/batch_informed_rrtstar.py
index 8865cf46..826c615b 100644
--- a/PathPlanning/BatchInformedRRTStar/batch_informed_rrtstar.py
+++ b/PathPlanning/BatchInformedRRTStar/batch_informed_rrtstar.py
@@ -9,6 +9,7 @@ Uses lazy connecting by combining sampling based methods and A*
 like incremental graph search algorithms.
 
 author: Karan Chawla(@karanchawla)
+        Atsushi Sakai(@Atsushi_twi)
 
 Reference: https://arxiv.org/abs/1405.5848
 """
@@ -20,11 +21,10 @@ import matplotlib.pyplot as plt
 
 show_animation = True
 
-# Class to represent the explicit tree created
-# while sampling through the state space
-
 
 class RTree(object):
+    # Class to represent the explicit tree created
+    # while sampling through the state space
 
     def __init__(self, start=[0, 0], lowerLimit=[0, 0], upperLimit=[10, 10], resolution=1):
 
@@ -581,7 +581,6 @@ def main():
     bitStar = BITStar(start=[-1, 0], goal=[3, 8], obstacleList=obstacleList,
                       randArea=[-2, 15])
     path = bitStar.plan(animation=show_animation)
-    #  print(path)
     print("Done")
 
     if show_animation:
diff --git a/PathPlanning/BatchInformedRRTStar/bit_star.png b/PathPlanning/BatchInformedRRTStar/bit_star.png
deleted file mode 100644
index ee3036e8..00000000
Binary files a/PathPlanning/BatchInformedRRTStar/bit_star.png and /dev/null differ