Title :
Generating Optimal Two-Robot Street Walk Schedules
Author_Institution :
Dept. of Math. & Comput. Sci., Univ. of Lethbridge, Lethbridge, AB
Abstract :
Two robots collaboratively search a street area. At an abstract level, this is the well-known two-guard street walk problem. Variations of the problem, i.e., general walk, straight walk, counter walk, straight counter walk, have been studied. In this work, deepening our previous work on simple characterizations of walkable streets, we consider the generation of optimal walk schedules by two robots.
Keywords :
mobile robots; motion estimation; multi-robot systems; path planning; scheduling; general walk; optimal two-robot street walk schedules; robots collaborative search; straight counter walk; two-guard street walk problem; walkable streets; Biomimetics; Character generation; Clocks; Collaborative work; Counting circuits; Legged locomotion; Motion planning; Orbital robotics; Robots; Scheduling; Motion planning; area exploration and searching; robotics; visibility;
Conference_Titel :
Robotics and Biomimetics, 2008. ROBIO 2008. IEEE International Conference on
Conference_Location :
Bangkok
Print_ISBN :
978-1-4244-2678-2
Electronic_ISBN :
978-1-4244-2679-9
DOI :
10.1109/ROBIO.2009.4913321
