Search Results for author: Jan Faigl

Found 4 papers, 0 papers with code

Multi-Tour Set Traveling Salesman Problem in Planning Power Transmission Line Inspection

no code implementations2 Feb 2023 František Nekovář, Jan Faigl, Martin Saska

This letter concerns optimal power transmission line inspection formulated as a proposed generalization of the traveling salesman problem for a multi-route one-depot scenario.

Traveling Salesman Problem

Vehicle Fault-Tolerant Robust Power Transmission Line Inspection Planning

no code implementations2 Feb 2023 František Nekovář, Jan Faigl, Martin Saska

On an inspection vehicle mission interruption, which might happen at any time during the execution of the inspection plan, the inspection is re-planned using the remaining vehicles and their remaining battery budgets.

T*$\varepsilon$ -- Bounded-Suboptimal Efficient Motion Planning for Minimum-Time Planar Curvature-Constrained Systems

no code implementations4 Apr 2022 Doron Pinsky, Petr Váňa, Jan Faigl, Oren Salzman

We demonstrate using empirical evaluation that our planning framework can reduce the runtime by several orders of magnitude compared to the state-of-the-art while still providing guarantees on the quality of the solution.

Motion Planning

WiSM: Windowing Surrogate Model for Evaluation of Curvature-Constrained Tours with Dubins vehicle

no code implementations3 Feb 2020 Jan Drchal, Jan Faigl, Petr Váňa

We address the computationally challenging DTSP by fast evaluation of the sequence of visits by the proposed Windowing Surrogate Model (WiSM) which estimates the length of the optimal Dubins path connecting a sequence of locations in a Dubins tour.

Combinatorial Optimization Traveling Salesman Problem

Cannot find the paper you are looking for? You can Submit a new open access paper.