Reference · The Applied Higher-Order Functions catalogue

rainbow.algorithms.proofs.ahof.open-loop-planning

The Applied Higher-Order Functions cataloguesrc/rainbow/algorithms/proofs/ahof/open_loop_planning.clj2 definitions, 3 theorems

AHoF D39 Open-Loop Planning: optimize a fixed open-loop action sequence, keeping the plan with the larger total value; it keeps the larger value: prefers-plan-zero? a b = decide ('b 'a) best-plan-value a b = if ('b 'a) then 'a else 'b over exact rationals. Proved native and axiom-free: the preference decision, the selected value, and the switch. Requires audit/decide-nnrat-at-most, logic/if-data (both in the D63 checkpoint). Scope (measured by the kernel): this module has 3 worked instances (statements about specific values). None of its theorems is a guarantee about the algorithm for all inputs; `lein verify rainbow.algorithms.proofs.ahof.open-loop-planning` prints this classification.

olp/prefers-plan-zero? :
  (x₁ x₂ : ℚ≥0)
  → data/Bool

olp/best-plan-value :
  (x₁ x₂ : ℚ≥0)
  → ℚ≥0

olp/prefers-example :
  → bo/is-safe 3/4 1/2 = data/true

olp/selected-value :
  → fsc/node-value 3/4 1/2 = 3/4

olp/switches :
  → bo/is-safe 1/2 3/4 = data/false