From c0a5495ddbde7d20ee8c98fb942f50c30105b217 Mon Sep 17 00:00:00 2001 From: Muhammet Balcilar Date: Fri, 21 Sep 2018 02:54:07 +0200 Subject: [PATCH] Update README.md --- README.md | 13 +++++++++++-- 1 file changed, 11 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index f1dcc66..c807f2f 100644 --- a/README.md +++ b/README.md @@ -1,2 +1,11 @@ -# RobotPathPlanning -Sampling-based Mobile Robot Path Planning Algorithm by Dijkstra, Astar and Dynamic Programming +# Sampling-based Mobile Robot Path Planning Algorithm by Dijkstra, Astar and Dynamic Programming + +In this repository, we briefly presented full source code of Dijkstra, Astar and Dynamic Programming approach to find best route from starting node to end node on 2D graph. We also provide a main script which performs these algorithms on given map. + +## Map Definiton +We already provide a sample map creatin in map_definition.m source code. We defined all closed polygon in that maps which shows the obstacles. In sample map, there are 13 different obstances whose edges are defined by given x and y corordinate. One sample is shown by followings; +``` +map.pgx{1}=[2 8.5 8.5 4 2 2 1 1 2 4 2]; +map.pgy{1}=[8 10 1 3 3 1 1 6 6 5 8]; +``` +