Update Research_Pylot-Planning_PAF21-Perception.md: Typo removed

doc/03_research/research_PAF_23/Research_Pylot-Planning_PAF21-Perception.md

@@ -11,15 +11,15 @@
 
 ![freenet_gif](https://github.com/erdos-project/frenet_optimal_trajectory_planner/raw/master/img/fot2.gif)
 
-- **RRT\*-Planner**: RRT* algorithm to plan the path ([GitHub](https://github.com/erdos-project/rrt_star_planner))
+- **RRT\*-Planner**: RRT* algorithm for path planning ([GitHub](https://github.com/erdos-project/rrt_star_planner))
   - Creates random nodes
   - Adds nodes to the graph that are not blocked by objects on the road
   - Generally terminates as soon as a node is found in the target area
   - RRT*: Searches for the shortest path
 
 ![rrt_star_gif](https://github.com/erdos-project/rrt_star_planner/raw/master/img/rrtstar.gif)
 
-- **Hybrid A\* planner**: Hybrid A* algorithm for route planning ([GitHub](https://github.com/erdos-project/hybrid_astar_planner))
+- **Hybrid A\* planner**: Hybrid A* algorithm for path planning ([GitHub](https://github.com/erdos-project/hybrid_astar_planner))
   - Calculates the shortest path between two nodes from a graph
   - Similar to Dijkstra's algorithm
   - Nodes are estimated based on their costs and promising nodes are selected first