Author:
Agarwal Saurav,Akella Srinivas
Publisher
Springer International Publishing
Reference19 articles.
1. Agarwal, S., Akella, S.: Line coverage with multiple robots. In: IEEE International Conference on Robotics and Automation, Paris, France (2020)
2. van Bevern, R., Komusiewicz, C., Sorge, M.: A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: theory and experiments. Networks 70(3), 262–278 (2017)
3. Choset, H.: Coverage for robotics - a survey of recent results. Ann. Math. Artif. Intell. 31(1), 113–126 (2001)
4. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA (1976)
5. Corberan, A., Laporte, G. (eds.): Arc Routing: Problems, Methods, and Applications. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2014)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献