Open Access
MATEC Web Conf.
Volume 398, 2024
2nd International Conference on Modern Technologies in Mechanical & Materials Engineering (MTME-2024)
Article Number 01011
Number of page(s) 9
Published online 25 June 2024
  1. McGuire, Kimberly N., Guido CHE de Croon, and Karl Tuyls. “A comparative study of bug algorithms for robot navigation.” Robotics and Autonomous Systems 121 (2019): 103261. [CrossRef] [Google Scholar]
  2. P. E. Hart, N. J. Nilsson and B. Raphael, “A Formal Basis for the Heuristic Determination of Minimum Cost Paths,” in IEEE Transactions on Systems Science and Cybernetics, vol. 4, no. 2, pp. 100–107, July 1968, doi: 10.1109/TSSC.1968.300136. [CrossRef] [Google Scholar]
  3. E.W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math. 1 (1) (1959) 269–271, URL [Google Scholar]
  4. J. Ng and T. Bräunl, “Performance Comparison of Bug Navigation Algorithms”, 2007 J Intell Robot Syst, vol. 50, pp. 73–84. [CrossRef] [Google Scholar]
  5. S. S, D. A. Nandesh, R. Raman K, G. K and R. R, “An Investigation of Bug Algorithms for Mobile Robot Navigation and Obstacle Avoidance in Two-Dimensional Unknown Static Environments,” 2021 International Conference on Communication information and Computing Technology (ICCICT), Mumbai, India, 2021, pp. 1–6, doi: 10.1109/ICCICT50803.2021.9510118. [Google Scholar]
  6. I. Kamon, E. Rivlin and E. Rimon, “A new range-sensor based globally convergent navigation algorithm for mobile robots”, 1996 Proceedings of IEEE International Conference on Robotics and Automation, vol. 1, pp. 429–435. [Google Scholar]
  7. A. Sankaranarayanan and M. Vidyasagar, “A new path planning algorithm for moving a point object amidst unknown obstacles in a plane”, 1990 Proceedings. IEEE International Conference on Robotics and Automation, vol. 3, pp. 1930–1936. [Google Scholar]
  8. Marco Dorigo, Dario Floreano, Luca Maria Gambardella, Francesco Mondada, Stefano Nolfi, Tarek Baaboura, Mauro Birattari, Michael Bonani, Manuele Bram-billa, Arne Brutschy, et al. 2013. Swarmanoid: a novel concept for the study of heterogeneous robotic swarms. IEEE Robotics & Automation Magazine 20, 4 (2013), 60–71. [CrossRef] [Google Scholar]
  9. Johansson, Alexander, and Johan Markdahl. “Swarm Bug Algorithms for Path Generation in Unknown Environments.” arXiv preprint arXiv:2308.07736 (2023). [Google Scholar]
  10. R. Pepy and A. Lambert, “Safe Path Planning in an Uncertain-Configuration Space using RRT,” 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, Beijing, China, 2006, pp. 5376–5381, doi: 10.1109/IROS.2006.282101. [Google Scholar]
  11. Agarwal, Pankaj K., Eyal Flato, and Dan Halperin. “Polygon decomposition for efficient construction of Minkowski sums.” Computational Geometry 21.1-2 (2002): 39–61. [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.