default search action
Michal Kleinbort
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j4]Michal Kleinbort
, Kiril Solovey
Corrections to "Probabilistic Completeness of RRT for Geometric and Kinodynamic Planning With Forward Propagation". IEEE Robotics Autom. Lett. 8(2): 1149-1150 (2023) - 2020
- [b1]Michal Kleinbort:
Sampling-based robot motion planning : The common bottlenecks, novel methods and their analysis. Tel Aviv University, Israel, 2020 - [j3]Kiril Solovey
The critical radius in sampling-based motion planning. Int. J. Robotics Res. 39(2-3) (2020) - [c5]Michal Kleinbort, Edgar Granados, Kiril Solovey, Riccardo Bonalli, Kostas E. Bekris, Dan Halperin:
Refined Analysis of Asymptotically-Optimal Kinodynamic Planning in the State-Cost Space. ICRA 2020: 6344-6350
2010 – 2019
- 2019
- [j2]Michal Kleinbort
Probabilistic Completeness of RRT for Geometric and Kinodynamic Planning With Forward Propagation. IEEE Robotics Autom. Lett. 4(2): 277-283 (2019) - [i7]Michal Kleinbort, Kiril Solovey, Riccardo Bonalli, Kostas E. Bekris, Dan Halperin:
RRT2.0 for Fast and Optimal Kinodynamic Sampling-Based Motion Planning. CoRR abs/1909.05569 (2019) - 2018
- [c4]Kiril Solovey, Michal Kleinbort:
The Critical Radius in Sampling-based Motion Planning. Robotics: Science and Systems 2018 - [i6]Michal Kleinbort, Kiril Solovey, Zakary Littlefield, Kostas E. Bekris, Dan Halperin:
Probabilistic completeness of RRT for geometric and kinodynamic planning with forward propagation. CoRR abs/1809.07051 (2018) - 2017
- [i5]Kiril Solovey, Michal Kleinbort:
The Critical Radius in Sampling-Based Motion Planning. CoRR abs/1709.06290 (2017) - 2016
- [j1]Michael Hemmer, Michal Kleinbort, Dan Halperin:
Optimal randomized incremental construction for guaranteed logarithmic planar point location. Comput. Geom. 58: 110-123 (2016) - [c3]Michal Kleinbort, Oren Salzman, Dan Halperin:
Collision Detection or Nearest-Neighbor Search? On the Computational Bottleneck in Sampling-based Motion Planning. WAFR 2016: 624-639 - [i4]Michal Kleinbort, Oren Salzman, Dan Halperin:
Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning. CoRR abs/1607.04800 (2016) - 2015
- [c2]Michal Kleinbort, Oren Salzman, Dan Halperin:
Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors. ICRA 2015: 2985-2990 - 2014
- [i3]Michal Kleinbort, Oren Salzman, Dan Halperin:
Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors. CoRR abs/1409.8112 (2014) - [i2]Michael Hemmer, Michal Kleinbort, Dan Halperin:
Optimal randomized incremental construction for guaranteed logarithmic planar point location. CoRR abs/1410.5602 (2014) - 2012
- [c1]Michael Hemmer, Michal Kleinbort, Dan Halperin:
Improved Implementation of Point Location in General Two-Dimensional Subdivisions. ESA 2012: 611-623 - [i1]Michael Hemmer, Michal Kleinbort, Dan Halperin:
Improved Implementation of Point Location in General Two-Dimensional Subdivisions. CoRR abs/1205.5434 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: