Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
19964.3k citationsLydia E. Kavraki, P. Švestka et al.IEEE Transactions on Robotics and Automationprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of P. Švestka's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by P. Švestka with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites P. Švestka more than expected).
This network shows the impact of papers produced by P. Švestka. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by P. Švestka. The network helps show where P. Švestka may publish in the future.
Co-authorship network of co-authors of P. Švestka
This figure shows the co-authorship network connecting the top 25 collaborators of P. Švestka.
A scholar is included among the top collaborators of P. Švestka based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with P. Švestka. P. Švestka is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Aronov, Boris, Mark de Berg, A. Frank van der Stappen, P. Švestka, & Jules Vleugels. (1998). Motion planning for multiple robots. TU/e Research Portal. 374–382.10 indexed citations
Švestka, P.. (1996). On probabilistic completeness and expected complexity for probabilistic path planning. Data Archiving and Networked Services (DANS).12 indexed citations
9.
Kavraki, Lydia E., P. Švestka, J.-C. Latombe, & M.H. Overmars. (1996). Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation. 12(4). 566–580.4298 indexed citations breakdown →
10.
Švestka, P.. (1995). Coordinated motion planning for multiple car-like robots using probabilistic roadmaps. IEEE Transactions on Robotics and Automation. 11. 1631–1636.23 indexed citations
11.
Overmars, Mark H. & P. Švestka. (1995). A probabilistic learning approach to motion planning. 19–37.113 indexed citations
12.
Švestka, P. & M.H. Overmars. (1995). A paradigm for probabilistic path planning. Utrecht University Repository (Utrecht University).8 indexed citations
13.
Švestka, P.. (1993). A probabilistic approach to motion planning for car-like robots. Utrecht University Repository (Utrecht University).19 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.