Title: Non-intersecting curved paths using Bezier curves in the 2D-Euclidean plane for multiple autonomous robots

Authors: Utsa Roy; Krishnendu Saha; Chintan Kr. Mandal

Addresses: Department of Computer Science and Engineering, Jadavpur University, Kolkata, India ' Department of Computer Science and Engineering, Jadavpur University, Kolkata, India ' Department of Computer Science and Engineering, Jadavpur University, Kolkata, India

Abstract: This paper proposes an algorithm for generating non-intersecting continuous paths for multiple robots having unique source and destination with convex polygonal obstacles in the 2D-Euclidean plane. It generates paths using Dijkstra's algorithm with the edges of the visibility graph of the map. Although Dijkstra's algorithm is used, the generated paths between the source-destinations will not be explicitly 'short paths' as an edge of the visibility graph cannot be used in multiple paths. The robots are prioritised with respect to the Euclidean distance between them. The discrete paths are converted into continuous paths using Bezier curves along the corners of the edges. The algorithm sequentially generate paths one after another based on a priority based on the Euclidean distance between their source and destination.

Keywords: visibility graph? Dijkstra's algorithm? convex hull? Bezier curve.

DOI: 10.1504/IJCVR.2023.134311

International Journal of Computational Vision and Robotics, 2023 Vol.13 No.6, pp.599 - 618

Accepted: 24 May 2022
Published online: 18 Oct 2023 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article