Simple Search Scheme (VIDEO)
Caption
A simple example of a controller algorithm that decides where robots should move according to a set of temporal logic rules such as visit these places in order, don't visit one place until another is visited, and never visit the same place twice. Each dot on this graph is a location and each dotted line is a potential path. While current state-of-the-art algorithms can solve problems such as these, they cannot handle hundreds of robots and complicated rules.
Credit
Michael Zavlanos, Duke University
Usage Restrictions
None
License
Licensed content