“…There are other applications in patrolling. For instance, Ghadiry et al 15 show an approach in which sets of viewpoints and robots are used to monitor an environment, whose number of robots is less than the number of the viewpoints. The robots are supposed to visit the viewpoints by traveling between them continuously.…”
Section: Related Workmentioning
confidence: 99%
“…If the map did not have enough strategic points, these previous approaches may fail or yield not very reasonable paths. So before the end of algorithm, if the shortestPath is still empty, a dynamic path is created from scratch with A* (lines [14][15][16] to guarantee that a path will be returned no matter where s and g are on the map. This scenario is illustrated by the last frame of Fig.…”
SUMMARY
Today, robots can be found helping humans with their daily tasks. Some tasks require the robot to visit a set of locations in the environment efficiently, like in the Traveling Salesman Problem. As indoor environments are maze-like areas, feasible paths connecting locations must be computed beforehand, so they can be combined during the scheduling, which can be impracticable for real-time applications. This work presents an on-line Route Scheduling supported by a Fast Path Planning Method able to adjust pre-built paths. Experiments were carried out with virtual and real robots to evaluate time and quality of tours.
“…There are other applications in patrolling. For instance, Ghadiry et al 15 show an approach in which sets of viewpoints and robots are used to monitor an environment, whose number of robots is less than the number of the viewpoints. The robots are supposed to visit the viewpoints by traveling between them continuously.…”
Section: Related Workmentioning
confidence: 99%
“…If the map did not have enough strategic points, these previous approaches may fail or yield not very reasonable paths. So before the end of algorithm, if the shortestPath is still empty, a dynamic path is created from scratch with A* (lines [14][15][16] to guarantee that a path will be returned no matter where s and g are on the map. This scenario is illustrated by the last frame of Fig.…”
SUMMARY
Today, robots can be found helping humans with their daily tasks. Some tasks require the robot to visit a set of locations in the environment efficiently, like in the Traveling Salesman Problem. As indoor environments are maze-like areas, feasible paths connecting locations must be computed beforehand, so they can be combined during the scheduling, which can be impracticable for real-time applications. This work presents an on-line Route Scheduling supported by a Fast Path Planning Method able to adjust pre-built paths. Experiments were carried out with virtual and real robots to evaluate time and quality of tours.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.