Efficient and inefficient ant coverage methods

Annals of Mathematics and Artificial Intelligence

Volumn 31, Issue 1-4, 2001, Pages 41-76

  Koenig, Sven ^a   Szymanski, Boleslaw ^b   Liu, Yaxin ^a  

^a Georgia Institute of Technology   (United States)

^b Rensselaer Polytechnic Institute   (United States)

Author keywords

Ant robots; Cover time; Graph coverage; Lawn mowing; Learning real time A*; Node counting; Real time heuristic search; Surveillance; Vacuum cleaning

Indexed keywords

EID: 0035611782     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1016665115585     Document Type: Article

References (30)

1. F. Adler and D. Gordon, Information collection and spread by networks of patrolling ants, The American Naturalist 140(3) (1992) 373-400.
2. T. Balch and R. Arkin, Avoiding the past: A simple, but effective strategy for reactive navigation, in: International Conference on Robotics and Automation (1993) pp. 678-685.
3. A. Barto, S. Bradtke and S. Singh, Learning to act using real-time dynamic programming, Artif. Intell. 73(1) (1995) 81-138.
4. B. Bonet and H. Geffner, Planning with incomplete information as heuristic search in belief space, in: Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (2000) pp. 52-61.
5. B. Bonet, G. Loerincs and H. Geffner, A robust and fast action selection mechanism, in: Proceedings of the National Conference on Artificial Intelligence (1997) pp. 714-719.
6. R. Brooks and A. Flynn, Fast, cheap, and out of control: A robot invasion of the solar system, Journal of the British Interplanetary Society (1989) 478-485.
7. G. Chartrand and L. Lesniak, Graphs and Digraphs (Wadsworth and Brooks/Cole, 2nd edition, 1986).
8. T. Ishida, Real-Time Search for Learning Autonomous Agents (Kluwer Academic, 1997).
9. T. Ishida and R. Korf, Moving target search, in: Proceedings of the International Joint Conference on Artificial Intelligence (1991) pp. 204-210.
10. L. Kaelbling, M. Littman and A. Moore, Reinforcement learning: A survey, J. Artif. Intell. Res. 4 (1996) 237-285.
11. S. Koenig, A. Blum, T. Ishida and R. Korf, eds., Proceedings of the AAAI-97 Workshop on On-Line Search (AAAI Press, 1997). Available as AAAI Technical Report WS-97-10.
12. S. Koenig and R.G. Simmons, Real-time search in non-deterministic domains, in: Proceedings of the International Joint Conference on Artificial Intelligence (1995) pp. 1660-1667.
13. S. Koenig and R.G. Simmons, Easy and hard testbeds for real-time search algorithms, in: Proceedings of the National Conference on Artificial Intelligence (1996) pp. 279-285.
14. S. Koenig and R.G. Simmons, Solving robot navigation problems with initial pose uncertainty using real-time heuristic search, in: Proceedings of the International Conference on Artificial Intelligence Planning Systems (1998) pp. 145-153.
15. S. Koenig and B. Szymanski, Value-update rules for real-time search, in: Proceedings of the National Conference on Artificial Intelligence (1999) pp. 718-724.
16. R. Korf, Real-time heuristic search: First results, in: Proceedings of the National Conference on Artificial Intelligence (1987) pp. 133-138.
17. R. Korf, Real-time heuristic search, Artif. Intell. 42(2-3) (1990) 189-211.
18. N. Nilsson, Problem-Solving Methods in Artificial Intelligence (McGraw-Hill, 1971).
19. J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving (Addison-Wesley, 1985).
20. A. Pirzadeh and W. Snyder, A unified solution to coverage and search in explored and unexplored terrains using indirect control, in: Proceedings of the International Conference on Robotics and Automation (1990) pp. 2113-2119.
21. R. Russell, Heat trails as short-lived navigational markers for mobile robots, in: Proceedings of the International Conference on Robotics and Automation (1997) pp. 3534-3539.
22. R. Russell, D. Thiel and A. Mackay-Sim, Sensing odour trails for mobile robot navigation, in: Proceedings of the International Conference on Robotics and Automation (1994) pp. 2672-2677.
23. S. Russell and E. Wefald, Do the Right Thing - Studies in Limited Rationality (MIT Press, 1991).
24. R. Sharpe and B. Webb, Simulated and situated models of chemical trail following in ants, in: Proceedings of the International Conference on Simulation of Adaptive Behavior (1998) pp. 195-204.
25. R. Sutton and A. Barto, Reinforcement Learning: An Introduction (MIT Press, 1998).
26. B. Szymanski and S. Koenig, The complexity of node counting on undirected graphs, Technical Report, Computer Science Department, Rensselaer Polytechnic Institute, Troy, NY (1998).
27. S. Thrun, Efficient exploration in reinforcement learning. Technical Report CMU-CS-92-102, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (1992).
28. S. Thrun, The role of exploration in learning control, in: Handbook of Intelligent Control: Neural, Fuzzy and Adaptive Approaches, eds. D. White and D. Sofge (Van Nostrand-Reinhold, 1992) pp. 527-559.
29. I. Wagner, M. Lindenbaum and A. Bruckstein, On-line graph searching by a smell-oriented vertex process, in: Proceedings of the AAAI Workshop on On-Line Search, eds. S. Koenig, A. Blum, T. Ishida and R. Korf (1997) pp. 122-125. Available as AAAI Technical Report WS-97-10.
30. I. Wagner, M. Lindenbaum and A. Bruckstein, Efficiently searching a dynamic graph by a smell-oriented vertex process, Ann. Math. Artif. Intell. 24 (1998) 211-223.