Triangulation Guided High Clearance Collision-Free Paths

Algorithms dealing with the construction of high clearance collision-free paths in the presence of polygonal obstacles is an important problem in robotics and transportation engineering. Method of extracting collision-free paths guided by triangulation of free space is examined. Two algorithms for improving the standard triangulation guided algorithms are presented. The time complexities of the presented algorithms are analysed. Finally, further applications of the proposed techniques are discussed.

Publication Details

Journal
Digital Scholarship - UNLV (University of Nevada Reno)
Published
2024-10-02
DOI
https://doi.org/10.34917/37650855
Primary Topic
Historical Architecture and Urbanism
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Triangulation Guided High Clearance Collision-Free Paths

Digital Scholarship - UNLV (University of Nevada Reno)
Historical Architecture and Urbanism
article

Triangulation Guided High Clearance Collision-Free Paths

article en

Abstract

Algorithms dealing with the construction of high clearance collision-free paths in the presence of polygonal obstacles is an important problem in robotics and transportation engineering. Method of extracting collision-free paths guided by triangulation of free space is examined. Two algorithms for improving the standard triangulation guided algorithms are presented. The time complexities of the presented algorithms are analysed. Finally, further applications of the proposed techniques are discussed.

Digital Scholarship - UNLV (University of Nevada Reno)
Openalex Percentile: Top 51%
Historical Architecture and Urbanism
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Triangulation Guided High Clearance Collision-Free Paths · Digital Scholarship - UNLV (University of Nevada Reno) (2024) | TGRS Research Map | TGRS