4 ms·
Considered using this algorithm for simple robotics. Specifically, a "dark seeker" robot that prefers to hide in dark places. Sure, wire a photocell to a simp
by JKCalhoun 6y ago
Considered using this algorithm for simple robotics.
Specifically, a "dark seeker" robot that prefers to hide in dark places.
Sure, wire a photocell to a simple turtle-like robot and send them on a random walk to wander and measure how dark their environment is. But how to decide what is dark?
It's dark under the table, but even darker under the chair. Should the robot stop under the chair to "hide"? Perhaps the robot might have wandered a bit more and found that it was even darker still under the couch. But is it darker still somewhere else?
Never mind that the value it reads varies depending upon the time of day and which environment you drop it into.
I think you can see how I imagined the Secretary Problem algorithm to step in. Let it wander for some fixed amount of time simply to "sample" the environment. Then after that sample period the robot stops as soon as it stumbles into an area darker than the darkest it had just sampled.
Seems like a reasonable algorithm for a robot with fewer than two neurons to rub together.