Robots for the Kids in All of Us
summary
Solves a 10x10 maze on a 64 MB EV3 running a Java/LeJOS JVM, loading a 14,000+ point graph into primitive int maps so the 12 MB JVM leaves ~2 MB free; implements Dijkstra and A (commonly chosen heuristic tweaks) and generates a 226-node path which it flattens (look‑ahead three points) to avoid stopping between moves. Uses Eclipse Collections* to cut allocations and avoid GC death, integrates a Raspberry Pi + Twitter API for remote commands, and the robot demos work after tuning.
AI-written summary · about
chapters (11)
- 0:00Intro
- 0:24Introductions
- 11:28Dijkstra's Algorithm
- 15:25Problem Statement
- 16:50Graph
- 19:41Successors
- 21:22Cost Function
- 21:44Prioritization
- 26:46Path: Dijkstra's
- 28:20Motion Uninterrupted
- 31:17Twitter Commands
related talks
35mRobotics on Java Simplified
30mMuch Robots Very Java So IoT
50mA Raspberry Pi and DeepLearning4J Brain That Plays Minecraft
49mA Raspberry Pi and DeepLearning4J Brain That Plays Minecraft
27mA journey to MRuby on LEGO robots
02mHighlight
29mProgramming Lego Mindstorms robots with Python
04mDemonstrates the Duchess Robot