About
7
Publications
2,847
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
21
Citations
Introduction
I am a researcher working on the development of scheduling techniques for discrete-continuous problem of UAV-based aerial inspection. My passion is to employ robotics and computer science for practical purposes.
Current institution
Publications
Publications (7)
In this paper a new efficient tabu search algorithm for assigning freight to the intermodal transport connections was developed. There were also formulated properties of the problem that can be used to design robust heuristic algorithms based on the local search methods. The quality of solutions produced by the tabu search algorithm and by often re...
This paper deals with scheduling and routing rail freight transportation. There are provided mathematical descriptions of constraints in the real rail transportation such as timetables of passenger trains, safety time buffers etc. We developed an algorithm which determines the fastest route of cargo train in a railway network. It is based on Dijkst...
The paper deals with scheduling and routing rail freight transportation. There are provided mathematical descriptions of constraints in the real rail transportation such as timetables of passenger trains, safety time buffers etc. We developed an algorithm which determines the fastest route of cargo train in a railway network. It is based on Dijkstr...
An autonomous aerial inspection using unmanned aerial vehicles (UAVs) requires effective and nearly optimal algorithms for scheduling UAVs. A UAV performing aerial inspection does not need to take photos of inspected objects from exact given points in space. For every inspected object, there is a feasible area (or point) from which clear photos can...
The article introduces an innovative approach for the inspection challenge that represents a generalization of the classical Traveling Salesman Problem. Its principle idea is to visit continuous areas (circles) in a way, that minimizes traveled distance. In practice, the problem can be defined as an issue of scheduling unmanned aerial vehicle which...
Unmanned aerial vehicles (UAVs) are a powerful tool for remote monitoring of objects requiring early anomaly detection, emergency intervention, or measurement data collection. We consider the problem of determining the optimal path of a UAV performing remote inspection of objects. The UAV inspects objects repeatedly (infinitely many times) every sp...
New strategies are proposed for implementing algorithms based on Branch and Bound scheme. Those include two minimal spanning tree lower bound modifications, a design based on the fact that edges in the optimal tour can never cross in the euclidean TSP and parallelization of Branch and Bound scheme. Proposed approaches are compared with primary algo...
Questions
Question (1)
I have a problem, where equation changes with problem instance size.
There are given n circles (centers and radiuses ). Circles dont intersect, they are separable. I need to visit every circle starting from the first circle and returning to the first circle. The sequence of visiting circles is known. The task is to find points on these circles (described by radius) to minimize the path.
For 3 circles we have to find P1 P2 and P3 that minimizes d=d(P1, P2)+d(P2, P3) + d(P3, P1) (for permutation (1, 2, 3)). When number of circles changes, the minimised equation changes.
I would like to have a module invoked from C++/Python that will solve such problem for me. I would like to send number of circles and its parameters, and solver should solves a problem and responds with P1, P2, P3,...Pn.
In the attachment you can find an image of two circles and some points P1, P2 (it is not optimal solution, of course).
