Hard-to-predict routing algorithm from intruders for autonomous surveillance robots
| Autor: | Kazuki Kajita, Eiji Konaka |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
0209 industrial biotechnology
Computational complexity theory SIMPLE (military communications protocol) Computer science Real-time computing Routing algorithm 02 engineering and technology Interval (mathematics) Route inspection problem 020901 industrial engineering & automation 0202 electrical engineering electronic engineering information engineering Robot 020201 artificial intelligence & image processing Routing (electronic design automation) |
| Zdroj: | IECON |
| DOI: | 10.1109/iecon.2018.8591272 |
| Popis: | Autonomous surveillance robots are now successful applications of robotics technologies. In this area, multiple surveillance routes have not been considered as a performance criterion. If the surveillance route is fixed and this fact is leaked to intruders, the place with a long-time interval between two visits of a robot could be open to attack. In this paper, a novel, simple, and easy-to-implement routing algorithm is proposed; the main idea is to add redundant edges to the original undirected graph. Then, the routing is formulated as a Chinese Postman Problem. The usefulness of the proposed algorithm is verified through some numerical experiments. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|