Deterministic RG-Trees via Voronoi Diagrams Voronoi Diyagramları ile Deterministik RG-Trees

Date

2024-01-01

Author

Gölbol, Ferhat
Schmidt, Klaus Verner

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

36
views

0
downloads

Obstacle avoidance motion planning is a basic problem in mobile robotics. In cases like in a factory, the environment map is known, and the planner's main task is to find a feedback control law that steers the robot to the goal location without collision. This study presents a novel deterministic method that quickly finds a suitable path by covering the obstacle-free space from start to goal with overlapping polygonal regions guided by Voronoi diagrams. Using a reference governor ensures that the robot stays in these regions and safely moves to the goal. A simulation study confirms the computational gains of our method.

Subject Keywords

motion planning, reference governor, Voronoi diagram

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85200829694&origin=inward
https://hdl.handle.net/11511/110723

DOI

https://doi.org/10.1109/siu61531.2024.10601053

Conference Name

32nd IEEE Conference on Signal Processing and Communications Applications, SIU 2024

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Citation Formats

F. Gölbol and K. V. Schmidt, “Deterministic RG-Trees via Voronoi Diagrams Voronoi Diyagramları ile Deterministik RG-Trees,” presented at the 32nd IEEE Conference on Signal Processing and Communications Applications, SIU 2024, Mersin, Türkiye, 2024, Accessed: 00, 2024. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85200829694&origin=inward.