dont use sections for sub-sections

Author: SchwartzCode

docs/modules/5_path_planning/time_based_grid_search/time_based_grid_search_main.rst

@@ -25,39 +25,37 @@ https://www.cs.cmu.edu/~maxim/files/sipp_icra11.pdf
 
 It is faster than space-time A* because it pre-computes the intervals of time that are unoccupied in each cell. This allows it to reduce the number of successor node it generates by avoiding nodes within the same interval.
 
-Comparison with Space-time A*:
-~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+**Comparison with Space-time A*:**
 
 Arrangement 1 starting at (1, 18)
 
-**SafeInterval planner**::
+SafeInterval planner::
 
     Found path to goal after 322 expansions
     Planning took: 0.00730 seconds
 
-**SpaceTimeAStar**::
+SpaceTimeAStar::
 
     Found path to goal after 2717154 expansions
     Planning took: 20.51330 seconds
 
-Benchmarks:
-~~~~~~~~~~~~
+**Benchmarking the Safe Interval Path Planner:**
 
-**250 random obstacles**::
+250 random obstacles::
 
     Found path to goal after 764 expansions
     Planning took: 0.60596 seconds
 
 .. image:: https://raw.githubusercontent.com/AtsushiSakai/PythonRoboticsGifs/refs/heads/master/PathPlanning/TimeBasedPathPlanning/SafeIntervalPathPlanner/path_animation.gif
 
-**Arrangement 1 starting at (1, 18)**::
+Arrangement 1 starting at (1, 18)::
 
     Found path to goal after 322 expansions
     Planning took: 0.00730 seconds
 
 .. image:: https://raw.githubusercontent.com/AtsushiSakai/PythonRoboticsGifs/refs/heads/master/PathPlanning/TimeBasedPathPlanning/SafeIntervalPathPlanner/path_animation2.gif
 
-References:
+References
 ~~~~~~~~~~~
 
 -  `Cooperative Pathfinding <https://www.davidsilver.uk/wp-content/uploads/2020/03/coop-path-AIWisdom.pdf>`__