IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v176y2020icp57-72.html
   My bibliography  Save this article

Efficient intersection between splines of clothoids

Author

Listed:
  • Bertolazzi, Enrico
  • Bevilacqua, Paolo
  • Frego, Marco

Abstract

A technique for the intersection of two splines of clothoid curves is herein presented. The study is motivated by the motion planning problem for a nonholonomic automated robotic vehicle, where a clothoid spline represents the path of the robot and the presence of an intersection with the path of another robot or with some obstacles boundaries means a possible collision. The algorithm works by segmenting each spline into small tangent triangles and then by organising the resulting, possibly large, number of triangles in a tree structure to exploit an efficient hierarchical check for intersections. Among various possible tree structures, the AABB tree is selected, which is a balanced choice between the complexity of the construction and the cost of evaluation, and avoids the need for extensive comparisons between each pair of clothoid segments that compose the splines. Indeed, only on pairs of intersecting triangles the collision is checked at curve level. This reduction of the computational cost yields an algorithm that can be effectively applied to real time applications.

Suggested Citation

  • Bertolazzi, Enrico & Bevilacqua, Paolo & Frego, Marco, 2020. "Efficient intersection between splines of clothoids," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 176(C), pages 57-72.
  • Handle: RePEc:eee:matcom:v:176:y:2020:i:c:p:57-72
    DOI: 10.1016/j.matcom.2019.10.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475419302897
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2019.10.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Nakanishi, Toshio & Yikai, Kunio & Satoh, Jun-ichi & Miyoshi, Isao & Satoh, Akira & Takahashi, Michiya, 1995. "The development of a road traffic simulation system in broad areas," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 39(3), pages 207-212.
    2. Tounsi, M. & Le Corre, J.F., 1996. "Trajectory generation for mobile robots," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 41(3), pages 367-376.
    3. Garach, L. & de Oña, J. & Pasadas, M., 2014. "Determination of alignments in existing roads by using spline techniques," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 102(C), pages 144-152.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. De Santos-Berbel, César & Castro, Maria, 2020. "Effect of vehicle swiveling headlamps and highway geometric design on nighttime sight distance," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 170(C), pages 32-50.
    2. César De Santos-Berbel & Sara Ferreira & António Couto & António Lobo, 2024. "Development of Motorway Horizontal Alignment Databases for Accurate Accident Prediction Models," Sustainability, MDPI, vol. 16(17), pages 1-18, August.
    3. My, Chu Anh & Makhanov, Stanislav S. & Van, Nguyen A. & Duc, Vu M., 2020. "Modeling and computation of real-time applied torques and non-holonomic constraint forces/moment, and optimal design of wheels for an autonomous security robot tracking a moving target," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 170(C), pages 300-315.
    4. Liatsis, P & Tawfik, H.M, 1999. "Two-dimensional road shape optimisation using genetic algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 51(1), pages 19-31.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:176:y:2020:i:c:p:57-72. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.