Skip to content

Commit b3d16a1

Browse files
authored
Merge pull request #33 from hsm207/patch-2
Fix typo
2 parents aa27fbf + 9bf3cad commit b3d16a1

File tree

2 files changed

+3
-3
lines changed

2 files changed

+3
-3
lines changed

tutorials/A Bottom-Up Introduction to Gen.ipynb

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -65,7 +65,7 @@
6565
" n = uniform_discrete(1, 10)\n",
6666
"```\n",
6767
"\n",
68-
"Then, with probability `p`, it multiplies by `n` by two:\n",
68+
"Then, with probability `p`, it multiplies `n` by two:\n",
6969
"```julia\n",
7070
" if bernoulli(p)\n",
7171
" n *= 2\n",

tutorials/Modeling with Black-Box Julia Code.ipynb

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -246,7 +246,7 @@
246246
"cell_type": "markdown",
247247
"metadata": {},
248248
"source": [
249-
"Next, we load a file that defines a `Path` data type (a sequence of `Points`), and a `plan_path` method, which uses a path planning algorithm based on rapidly exploring random tree (RRT, [1]) to find a sequence of `Point`s beginning with `start` and ending in `dest` such that the line segment between each consecutive pair of points does nt intersect any obstacles in the scene. The planning algorithm may fail to find a valid path, in which case it will return a value of type `Nothing`.\n",
249+
"Next, we load a file that defines a `Path` data type (a sequence of `Points`), and a `plan_path` method, which uses a path planning algorithm based on rapidly exploring random tree (RRT, [1]) to find a sequence of `Point`s beginning with `start` and ending in `dest` such that the line segment between each consecutive pair of points does not intersect any obstacles in the scene. The planning algorithm may fail to find a valid path, in which case it will return a value of type `Nothing`.\n",
250250
"\n",
251251
"`path::Union{Path,Nothing} = plan_path(start::Point, dest::Point, scene::Scene, planner_params::PlannerParams)`\n",
252252
"\n",
@@ -469,7 +469,7 @@
469469
"cell_type": "markdown",
470470
"metadata": {},
471471
"source": [
472-
"In this visualization, the start location is represented by a blue dot, and the destination is represented by a red dot. The measured coordinates at each time point are represented by black dots. The path, if path planning was succesfull, is shown as a gray line fro the start point to the destination point. Notice that the speed of the agent is different in each case."
472+
"In this visualization, the start location is represented by a blue dot, and the destination is represented by a red dot. The measured coordinates at each time point are represented by black dots. The path, if path planning was succesfull, is shown as a gray line from the start point to the destination point. Notice that the speed of the agent is different in each case."
473473
]
474474
},
475475
{

0 commit comments

Comments
 (0)