Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Misel Brezak

dblp:43/3164 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Motion planning and robot control · 100%
Theoretical computer science
1 paper
Computational geometry · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control
path planning
0.212014
Real-time Approximation of Clothoids With Bounded Error for Path Planning Applications · IEEE Trans. Robotics 2014
Computational geometry › curve representation
curve approximation
0.112014
Real-time Approximation of Clothoids With Bounded Error for Path Planning Applications · IEEE Trans. Robotics 2014

Methods — techniques the papers use, named apart from their topics

lookup table approximation · 0.4geometric transformation · 0.4bounded error approximation · 0.4
YearPublicationVenuePosition
2014 Real-time Approximation of Clothoids With Bounded Error for Path Planning Applications
abstract
We present a method for real-time computation of clothoid coordinates that guarantees bounded approximation error over a wide range of clothoid parameters provided that the clothoid's orientation change and length areReal-time approximation bounded. It is shown that coordinates of clothoid with any parameters can be computed from those of a single clothoid (with fixed parameters), using appropriate geometrical transformations. A comprehensive analysis is given on how to determine a required set of clothoids and, based on this, how to sample a clothoid in a lookup table in order to achieve required approximation precision. The algorithm is computationally very efficient and therefore suitable for real-time path planning, as well as for other applications that benefit from fast clothoid computation.
Misel Brezak, Ivan Petrovic
IEEE Trans. Robotics1