Exploration path generation for multiple mobile robots using reaction-diffusion equation on a graph

Integrated Computer-Aided Engineering

Volumn 11, Issue 3, 2004, Pages 195-212

  Trevai, Chomchana ^a   Fukazawa, Yusuke ^a   Yuasa, Hideo ^a   Ota, Jun ^a   Arai, Tamio ^a   Asama, Hajime ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GRAPH THEORY; INFORMATION ANALYSIS; MATHEMATICAL MODELS; POSITION CONTROL; PROBLEM SOLVING;

ADAPTABILITY; EXPLORATION PATHS; FRONTIER-BASED EXPLORATION; RACTION-DIFFUSION EQUATION;

MOBILE ROBOTS;

EID: 3142668396     PISSN: 10692509     EISSN: None     Source Type: Journal    
DOI: 10.3233/ica-2004-11301     Document Type: Article

References (16)

1. H. Asama, M. Sato, L. Bogoni, H. Kaetsu, A. Matsumoto and I. Endo, Development of an omnidirectional mobile robot with 3 dof decoupling drive mechanism, in Proceeding of IEEE International Conference on Robotics and Automation, April, 1996.
2. W. Burgard, M. Moors, D. Fox, R. Simmons and S. Thrun, Collaborative multi-robot exploration, in Proc. of IEEE International Conference on Robotics & Automation ICRA, 2000.
3. Z. Czech, Parallel simulated annealing for the set-partitioning problem, in Proceedings of the 8th Euromicro Workshop on Parallel and Distributed Processing, 2000, 343-350.
4. Z. Czech, Parallel simulated annealing for the delivery problem, in Proceedings of the 9th Euromicro Workshop on Parallel and Distributed Processing, 2001, 219-226.
5. Y. Gabriely and E. Rimon, Spanning-tree based coverage of contiguous areas by a mobile robot, in Proceedings of IEEE International Conference on Robotics & Automation, 2001, 1927-1933.
6. Y. Gabriely and E. Rimon, Spiral-stc: An on-line coverage algorithm of grid environments by a mobile robot, in Proceedings of the 2002 IEEE International Conference on Robotics & Automation, pages 2002, 954-960.
7. E. González, A. Suárez, C. Moreno and F. Artigue, Complementary regions: a surface filling algorithm, in Proceedings of IEEE Int. Conferences on Robotics and Automation, 1996, 909-914.
8. M. Jäger and B. Nebel, Dynamic decentralized area partitioning for cooperating cleaning robots, in Proceedings of IEEE International Conference on Robotics and Automation, May, 2002.
9. D. Kurabayashi, S. Koga, T. Arai, J. Ota, H. Asama and I. Endo, Local path re-planning for unforeseen obstacle avoidance by an autonomous sweeping robot, in Proceedings of the 1998 IEEE International Conference on Robotics & Automation, (vol. 4), 1998.
10. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley & Sons, 1985.
11. C. Luo, S.X. Yang, D.A. Stacey and J.C. Jofriet, A solution to vicinity problem of obstacles in complete coverage path planning, in Proceedings of the 2002 IEEE International Conference Robotics and Automation, 2002, 612-617.
12. J.B. Mellisen and P.C. Shuur, Covering a rectangle with six and seven circles, In Discrete Applied Mathematics 14 (1999), 149-156.
13. L.E. Reichl, A modern course in statistical physics, Edward Arnold, 1980.
14. R. Simmons, D. Apfelbaum, W. Burgard, D. Fox, M. Moors, S. Thron and H. Younes, Coordination for multi-robot exploration and mapping, In Proc. of the National Conference on Artificial Intelligence AAAI, 2000.
15. B. Yamauchi, Frontier-based exploration using multiple robots, in Proceedings of Second International Conference On Autonomous Agents, 1998.
16. H. Yuasa and M. Ito, Self-organizing system theory by use of reaction-diffusion equation on a graph with boundary, in Proceedings of IEEE International Conference on Systems, Mans, and Cybernetics, (Vol. 1), 1999.