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

Premysl Kafka

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

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

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 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 · 91% 3D vision · 9%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › path planning
coverage path planning
0.212016
Random Inspection Tree Algorithm in visual inspection with a realistic sensing model and differential constraints · ICRA 2016
Robotics › Motion planning and robot control › path planning › coverage path planning
inspection planning
0.212016
Random Inspection Tree Algorithm in visual inspection with a realistic sensing model and differential constraints · ICRA 2016
Robotics › Motion planning and robot control › motion planning
sampling-based motion planning
0.212016
Random Inspection Tree Algorithm in visual inspection with a realistic sensing model and differential constraints · ICRA 2016
Computer vision › 3D vision › multi-view geometry
visibility constraints
0.112016
Random Inspection Tree Algorithm in visual inspection with a realistic sensing model and differential constraints · ICRA 2016

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

sampling-based planning · 0.2heuristic search · 0.2
YearPublicationVenuePosition
2016 Random Inspection Tree Algorithm in visual inspection with a realistic sensing model and differential constraints
abstract
In this paper, we consider existing asymptotically optimal inspection planning algorithm in coverage path planning with realistic visibility constraints of standard cameras. Although the existing approach is able to provide an optimal solution with omnidirectional sensing and limited sensing range, it is prohibitively computationally expensive for problems with only few objects to be covered and limited field of view. Based on the analysis of the utilized sampling-based strategy, we propose a heuristic approach to decrease computational requirements in problems with restricted viewing frustum, which is a more realistic model of a digital camera. In addition, we also consider a minimal distance and angle under which the object to be covered is captured by the forward looking camera to make a snapshot of the object with the required details.
Premysl Kafka, Jan Faigl, Petr Vana
ICRA1