From 6c9ff734e6e4c6a231a6c8cb6a665276b4cf340a Mon Sep 17 00:00:00 2001
From: samuelkuehnel <51356601+samuelkuehnel@users.noreply.github.com>
Date: Mon, 13 Nov 2023 13:11:47 +0100
Subject: [PATCH] Update Research_Pylot-Planning_PAF21-Perception.md: Typo
 removed

---
 .../Research_Pylot-Planning_PAF21-Perception.md               | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/doc/03_research/research_PAF_23/Research_Pylot-Planning_PAF21-Perception.md b/doc/03_research/research_PAF_23/Research_Pylot-Planning_PAF21-Perception.md
index b2e3d17c..33df4320 100644
--- a/doc/03_research/research_PAF_23/Research_Pylot-Planning_PAF21-Perception.md
+++ b/doc/03_research/research_PAF_23/Research_Pylot-Planning_PAF21-Perception.md
@@ -11,7 +11,7 @@
 
 ![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
@@ -19,7 +19,7 @@
 
 ![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