A dynamic path planning approach for multi-robot sensor-based coverage considering energy constraints

2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2009

Volumn , Issue , 2009, Pages 5930-5935

  Yazici, Ahmet ^a   Kirlik, Gokhan ^a   Parlaktuna, Osman ^a   Sipahioglu, Aydin ^a  

^a ESKISEHIR OSMANGAZI UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITATED ARC ROUTING PROBLEM; COVERAGE PROBLEM; DYNAMIC PATH PLANNING; ENERGY CAPACITY; ENERGY CONSTRAINT; GENERALIZED VORONOI DIAGRAM; INITIAL ENERGY; MULTIROBOTS; RE-PLANNING; SIMULATION ENVIRONMENT;

INDUSTRIAL ROBOTS; INTELLIGENT ROBOTS; MOBILE ROBOTS; MULTIPURPOSE ROBOTS; PLANNING; SENSORS; WIRELESS NETWORKS;

ROBOT PROGRAMMING;

EID: 76249109609     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2009.5354058     Document Type: Conference Paper

References (17)

1. E. U. Acar, H. Choset and J. Y. Lee, "Sensor-based coverage with extended range detectors", IEEE Transactions on Robotics, vol. 22 (1), pp. 189-198, 2006.
2. A. Sipahioglu, A. Yazici, G. Kirlik, O. Parlaktuna, "A sensor-based coverage approach in dynamic environments", The 6th International Symposium On Intelligent & Manufacturing Systems, pp. 502-509, Sakarya, Turkey, 2008.
3. D. Kurabayashi et al., "Cooperative sweeping by multiple mobile robots", Proc IEEE Int. Conf Robotics Automat, vol. 3, pp. 1744-1749, 1994.
4. D. Latimer et al., "Towards sensor based coverage with robot teams", Robotics and Automation Proceedings ICRA '02, vol. 1, pp. 961-96, 2002.
5. Y. Mei, Y.H. Lu, Y.C. Hu, C.S.G Lee, "Deployment of mobile robots with energy and timing constraints", IEEE Transactions on Robotics and Automation, vol. 22(3), pp. 507-522, 2006.
6. H.A. Eiselt, "A historical perspective on arc routing". In: Dror M., editor. Arc routing. Theory, solutions and applications. Boston, Kluwer Academic Publishers, pp. 1-16, 2000.
7. O. Parlaktuna, A. Sipahioglu, G. Kirlik, A. Yazici, Multi-robot sensor-based coverage path planning using capacitated arc routing approach, the 24th IEEE International Symposium on Intelligent Control (ISIC), in MSC09, pp. 1146-1151, Russia, July 8-10 2009.
8. K. H. Rosen, Handbook of Graph Theory, New Jersey: CRC Press, 2004.
9. J. Edmonds, E.L. Johnson, "Matching, Euler tours and Chinese Postman", Mathematical Programming vol. 5, pp. 88-124, 1973.
10. A. Hertz, G. Laporte and P. N. Hugo, "Improvement procedures for the undirected rural postman problem", INFORMS Journal on Computing, vol. 11, pp. 53-62, 1999.
11. A. Osterhues and F. Mariak, "On variants of the k-Chinese postman problem", Operations Research und Wirtschafts informatik, Universitat Dortmund, No. 30, 2005.
12. G. Ulusoy, "The fleet size and mix problem for capacitated arc routing", European Journal of Operation Research, vol. 22, pp. 329-337, 1985.
13. A. Hertz, M. Mittaz, "Heuristic algorithms". In: Dror M., editor. Arc routing. Theory, solutions and applications. Boston, Kluwer Academic Publishers, pp. 327-386, 2000.
14. A. Hertz, G. Laporte, G. and M. Mittaz, "A tabu search heuristic for the capacitated arc routing problem", Operations Research, vol. 48, pp. 129-135, 2000.
15. P. Lacomme, C. Prins and W. Ramdane-Chérif, "Competitive memetic algorithms for arc routing problems", Annals of Operations Research, vol. 131, pp. 159-85, 2004.
16. CPLEX Optimization Inc., CPLEX Version 11.0, 2007.
17. Eskisehir Osmangazi University, Artificial Intelligence & Robotic Laboratory, www.ai-robotlab.ogu.edu.tr, 2008.