default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetr Vana
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Jindriska Deckerová
, Petr Vána, Jan Faigl:
Combinatorial lower bounds for the Generalized Traveling Salesman Problem with Neighborhoods. Expert Syst. Appl. 258: 125185 (2024)- 2022
- [j9]Doron Pinsky, Petr Vána, Jan Faigl, Oren Salzman:
T*$\boldsymbol{\varepsilon}$ - Bounded-Suboptimal Efficient Motion Planning for Minimum-Time Planar Curvature-Constrained Systems. IEEE Robotics Autom. Lett. 7(2): 4102-4109 (2022) - [j8]Jan Drchal, Jan Faigl, Petr Vána:
WiSM: Windowing Surrogate Model for Evaluation of Curvature-Constrained Tours With Dubins Vehicle. IEEE Trans. Cybern. 52(2): 1302-1311 (2022) - [c22]Jakub Sláma, Petr Vána, Jan Faigl:
Generating Safe Corridors Roadmap for Urban Air Mobility. IROS 2022: 11866-11871 - [c21]Petr Vána, Jan Faigl:
Bounding optimal headings in the Dubins Touring Problem. SAC 2022: 770-773 - [i2]Doron Pinsky, Petr Vána, Jan Faigl, Oren Salzman:
T*ε - Bounded-Suboptimal Efficient Motion Planning for Minimum-Time Planar Curvature-Constrained Systems. CoRR abs/2204.01673 (2022) - 2021
- [c20]Jakub Sláma, Petr Vána, Jan Faigl:
Risk-aware Trajectory Planning in Urban Environments with Safe Emergency Landing Guarantee. CASE 2021: 1606-1612 - [c19]Jáchym Herynek, Petr Vána, Jan Faigl:
Finding 3D Dubins Paths with Pitch Angle Constraint Using Non-linear Optimization. ECMR 2021: 1-6 - [c18]Kristýna Kucerová, Petr Vána, Jan Faigl:
Variable-Speed Traveling Salesman Problem for Vehicles with Curvature Constrained Trajectories. IROS 2021: 4714-4719 - 2020
- [j7]Petr Vána, Jan Faigl:
Optimal solution of the Generalized Dubins Interval Problem: finding the shortest curvature-constrained path through a set of regions. Auton. Robots 44(7): 1359-1376 (2020) - [j6]Petr Vána, Jakub Sláma, Jan Faigl:
Surveillance planning with safe emergency landing guarantee for fixed-wing aircraft. Robotics Auton. Syst. 133: 103644 (2020) - [c17]Petr Vána, Armando Alves Neto, Jan Faigl, Douglas G. Macharet:
Minimal 3D Dubins Path with Bounded Curvature and Pitch Angle. ICRA 2020: 8497-8503 - [c16]Jan Faigl, Petr Vána, Jan Drchal:
Fast Sequence Rejection for Multi-Goal Planning with Dubins Vehicle. IROS 2020: 6773-6780 - [c15]Petra Stefaníková, Petr Vána, Jan Faigl:
Greedy randomized adaptive search procedure for close enough orienteering problem. SAC 2020: 808-814 - [c14]Kristýna Kucerová, Petr Vana, Jan Faigl:
On finding time-efficient trajectories for fixed-wing aircraft using dubins paths with multiple radii. SAC 2020: 829-831 - [i1]Jan Drchal, Jan Faigl, Petr Vána:
WiSM: Windowing Surrogate Model for Evaluation of Curvature-Constrained Tours with Dubins vehicle. CoRR abs/2002.00811 (2020)
2010 – 2019
- 2019
- [j5]Robert Penicka, Jan Faigl, Martin Saska, Petr Vána:
Data collection planning with non-zero sensing distance for a budget and curvature constrained unmanned aerial vehicle. Auton. Robots 43(8): 1937-1956 (2019) - [j4]Jan Faigl, Petr Vána, Robert Penicka, Martin Saska:
Unsupervised learning-based flexible framework for surveillance planning with aerial vehicles. J. Field Robotics 36(1): 270-301 (2019) - [j3]Jan Faigl, Petr Vana, Jindriska Deckerová:
Fast Heuristics for the 3-D Multi-Goal Path Planning Based on the Generalized Traveling Salesman Problem With Neighborhoods. IEEE Robotics Autom. Lett. 4(3): 2439-2446 (2019) - [c13]Petr Vána, Jan Faigl, Jakub Sláma:
Emergency Landing Aware Surveillance Planning for Fixed-wing Planes. ECMR 2019: 1-6 - [c12]Jan Faigl, Petr Vána, Robert Penicka:
Multi-Vehicle Close Enough Orienteering Problem with Bézier Curves for Multi-Rotor Aerial Vehicles. ICRA 2019: 3039-3044 - [c11]Milos Prágr, Petr Vána, Jan Faigl:
Aerial Reconnaissance and Ground Robot Terrain Learning in Traversal Cost Assessment. MESAS 2019: 3-10 - 2018
- [j2]Jan Faigl, Petr Vana:
Surveillance Planning With Bézier Curves. IEEE Robotics Autom. Lett. 3(2): 750-757 (2018) - [c10]Petr Vana, Jakub Sláma, Jan Faigl, Pavel Paces:
Any-Time Trajectory Planning for Safe Emergency Landing. IROS 2018: 5691-5696 - [c9]Jakub Marek, Petr Vána, Jan Faigl:
Trajectory Planning for Aerial Vehicles in the Area Coverage Problem with Nearby Obstacles. MESAS 2018: 226-236 - [c8]Petr Vána, Jan Faigl:
Optimal Solution of the Generalized Dubins Interval Problem. Robotics: Science and Systems 2018 - 2017
- [j1]Robert Penicka, Jan Faigl, Petr Vána, Martin Saska:
Dubins Orienteering Problem. IEEE Robotics Autom. Lett. 2(2): 1210-1217 (2017) - [c7]Jan Faigl, Petr Vana, Martin Saska, Tomás Báca, Vojtech Spurný:
On solution of the Dubins touring problem. ECMR 2017: 1-6 - [c6]Petr Vana, Jan Faigl, Jakub Sláma, Robert Penicka:
Data collection planning with Dubins airplane model and limited travel budget. ECMR 2017: 1-6 - [c5]Jan Faigl, Petr Vana:
Unsupervised learning for surveillance planning with team of aerial vehicles. IJCNN 2017: 4340-4347 - 2016
- [c4]Jan Faigl, Petr Vána:
Self-Organizing Map for the Curvature-Constrained Traveling Salesman Problem. ICANN (2) 2016: 497-505 - [c3]Premysl Kafka, Jan Faigl, Petr Vana:
Random Inspection Tree Algorithm in visual inspection with a realistic sensing model and differential constraints. ICRA 2016: 2782-2787 - [c2]Jan Faigl, Petr Vana:
Self-Organizing Map for data collection planning in persistent monitoring with spatial correlations. SMC 2016: 3264-3269 - 2015
- [c1]Petr Vana, Jan Faigl:
On the Dubins Traveling Salesman Problem with Neighborhoods. IROS 2015: 4029-4034
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-10-23 21:21 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:
