Skip to content

Commit

Permalink
Fixed some typos
Browse files Browse the repository at this point in the history
  • Loading branch information
dylan-asmar committed Jan 30, 2024
1 parent 587ea0b commit 4b206e8
Show file tree
Hide file tree
Showing 3 changed files with 3 additions and 3 deletions.
2 changes: 1 addition & 1 deletion docs/src/example_defining_problems.md
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@ There is a large variety of problems that can be expressed as MDPs and POMDPs an
For the examples, we will use the CryingBaby problem from [Algorithms for Decision Making](https://algorithmsbook.com/) by Mykel J. Kochenderfer, Tim A. Wheeler, and Kyle H. Wray.

!!! note
This craying baby problem follows the description in Algorithsm for Decision Making and is different than `BabyPOMDP` defined in [POMDPModels.jl](https://github.com/JuliaPOMDP/POMDPModels.jl).
This craying baby problem follows the description in Algorithms for Decision Making and is different than `BabyPOMDP` defined in [POMDPModels.jl](https://github.com/JuliaPOMDP/POMDPModels.jl).

From [Appendix F](https://algorithmsbook.com/files/appendix-f.pdf) of Algorithms for Decision Making:
> The crying baby problem is a simple POMDP with two states, three actions, and two observations. Our goal is to care for a baby, and we do so by choosing at each time step whether to feed the baby, sing to the baby, or ignore the baby.
Expand Down
2 changes: 1 addition & 1 deletion docs/src/example_gridworld_mdp.md
Original file line number Diff line number Diff line change
Expand Up @@ -189,7 +189,7 @@ If your problem is very large we probably do not want to store all of our states
# Define the length of the state space, number of grid locations plus the terminal state
Base.length(mdp::GridWorldMDP) = mdp.size_x * mdp.size_y + 1
# `states` now returns the mdp, which we will constructur our iterator from
# `states` now returns the mdp, which we will construct our iterator from
POMDPs.states(mdp::GridWorldMDP) = mdp
function Base.getindex(mdp::GridWorldMDP, si::Int) # Enables mdp[si]
Expand Down
2 changes: 1 addition & 1 deletion docs/src/example_solvers.md
Original file line number Diff line number Diff line change
Expand Up @@ -37,7 +37,7 @@ end
```

## Offline (SARSOP)
In this example, we will use the [NativeSARSOP](https://github.com/JuliaPOMDP/NativeSARSOP.jl) solver. We are generating the policy offline, so we will also save the policy to a file so we can use it at a later time without having to recompute it.
In this example, we will use the [NativeSARSOP](https://github.com/JuliaPOMDP/NativeSARSOP.jl) solver. The process for generating offline polcies is similar for all offline solvers. First, we define the solver with the desired parameters. Then, we call `POMDPs.solve` with the solver and the problem. We can query the policy using the `action` function.

```@example crying_sim
using NativeSARSOP
Expand Down

0 comments on commit 4b206e8

Please sign in to comment.