You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: content/projects.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -9,7 +9,7 @@ date: 2026-02-08T17:24:00+11:00
9
9
10
10
muesli-bt is a deliberately anachronistic-looking robotics behaviour system: a small Lisp at the centre, used to author behaviour trees that run inside a host robot application.
11
11
12
-
It is old-school in how you write behaviours (simple, explicit, hackable), but paired with more contemporary runtime expectations like inspection-ready logs, deterministic replay, and clear tick and deadline semantics. The process has been a bit anachronistic too: started manually, then finished off with some LLM-assisted vibe coding.
12
+
It is old-school in how you write behaviours (simple, explicit, hackable), but paired with more contemporary runtime expectations like inspection-ready logs, deterministic replay, and clear tick and deadline semantics.
13
13
14
14
Technically, muesli-bt is an embeddable runtime for Lisp-authored behaviour trees, with bounded-time planning during ticks and explicit async calls (including cancellation and safe fallback patterns). It is designed to integrate cleanly into C++ hosts and to support tooling that can inspect, replay, and debug real robot runs.
0 commit comments