Merge branch 'master' of https://github.com/sisl/POMDPSolve.jl

.travis.yml

@@ -10,6 +10,6 @@ notifications:
   email: false
 script:
   - if [[ -a .git/shallow ]]; then git fetch --unshallow; fi
-  - julia --check-bounds=yes -e 'Pkg.clone(pwd()); Pkg.clone("https://github.com/sisl/POMDPs.jl"); Pkg.clone("https://github.com/sisl/POMDPToolbox.jl"); Pkg.clone("https://github.com/sisl/POMDPXFile.jl"); Pkg.clone("https://github.com/sisl/POMDPFiles.jl"); Pkg.test("POMDPSolve"; coverage=true)'
+  - julia --check-bounds=yes -e 'Pkg.clone(pwd()); Pkg.clone("https://github.com/sisl/POMDPs.jl"); Pkg.clone("https://github.com/sisl/POMDPToolbox.jl"); Pkg.clone("https://github.com/sisl/POMDPXFile.jl"); Pkg.clone("https://github.com/sisl/POMDPFiles.jl"); Pkg.build("POMDPSolve"); Pkg.test("POMDPSolve"; coverage=true)'
 after_success:
   - julia -e 'cd(Pkg.dir("POMDPSolve")); Pkg.add("Coverage"); using Coverage; Coveralls.submit(Coveralls.process_folder())'

README.md

@@ -4,7 +4,7 @@ This is a Julia wrapper for the POMDP-Solve program, orginally developed at Brow
 This package uses the code available from the [pomdp-solve github page](https://github.com/cmansley/pomdp-solve).
 
 The pomdp-solve program solves partially observable Markov decision
-processes (POMDPs), taking a model specification and outputting a value
+processes (POMDPs), taking a model specification and producing a value
 function and action policy.  It employs many different algorithms,
 some exact and some approximate.