Simple Search Scheme (VIDEO) Duke University This video is under embargo. Please login to access this video. To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 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 Disclaimer: AAAS and EurekAlert! are not responsible for the accuracy of news releases posted to EurekAlert! by contributing institutions or for the use of any information through the EurekAlert system.