Loading [MathJax]/extensions/MathZoom.js
Konstantin Yakovlev - IEEE Xplore Author Profile

Showing 1-14 of 14 results

Filter Results

Show

Results

Mapping is one of the crucial tasks enabling autonomous navigation of a mobile robot. Conventional mapping methods output a dense geometric map representation, e.g. an occupancy grid, which is not trivial to keep consistent for prolonged runs covering large environments. Meanwhile, capturing the topological structure of the workspace enables fast path planning, is typically less prone to odometry ...Show More
Multi-agent pathfinding (MAPF) is the problem of finding a set of conflict-free paths for a set of agents. Typically, the agents' moves are limited to a pre-defined graph of possible locations and allowed transitions between them, e.g. a 4-neighborhood grid. We explore how to solve MAPF problems when each agent can move between any pair of possible locations as long as traversing the line segment ...Show More
Multi-agent pathfinding (MAPF) is a problem that involves finding a set of non-conflicting paths for a set of agents confined to a graph. In this work, we study a MAPF setting, where the environment is only partially observable for each agent, i.e., an agent observes the obstacles and other agents only within a limited field-of-view. Moreover, we assume that the agents do not communicate and do no...Show More
Mapping is one of the key components of mobile robot navigation. Representing a map as a topological structure is suitable for fast path planning and does not require high positioning precision or high computational resources, which is particularly useful in large environments. In recent years, numerous methods of topological graph building have emerged. Most of these methods build a topological g...Show More
This letter addresses the kinodynamic motion planning for non-holonomic robots in dynamic environments with both static and dynamic obstacles – a challenging problem that lacks a universal solution yet. One of the promising approaches to solve it is decomposing the problem into the smaller sub-problems and combining the local solutions into the global one. The crux of any planning method for non-h...Show More
Kinodynamic motion planning for non-holomonic mobile robots is a challenging problem that is lacking a universal solution. One of the computationally efficient ways to solve it is to build a geometric path first and then transform this path into a kinematically feasible one. Gradient-informed Path Smoothing (GRIPS) [1] is a recently introduced method for such transformation. GRIPS iteratively defo...Show More
Avoiding collisions is the core problem in multiagent navigation. In decentralized settings, when agents have limited communication and sensory capabilities, collisions are typically avoided in a reactive fashion, relying on local ob-servations/communications. Prominent collision avoidance techniques, e.g. ORCA, are computationally efficient and scale well to a large number of agents. However, in ...Show More
In this work we study the behavior of groups of autonomous vehicles, which are the part of the Internet of Vehicles systems. One of the challenging modes of operation of such systems is the case when the observability of each vehicle is limited and the global/local communication is unstable, e.g. in the crowded parking lots. In such scenarios the vehicles have to rely on the local observations and...Show More
Motion planning is a fundamental task for wheeled mobile robots. This task becomes challenging when the kinematic constraints of the robot (differential-drive, car-like, etc.) are to be taken into account. In this work we analyze and empirically compare two promising approaches to construct kinematically-feasible trajectories for differential drive robots – Theta*-RRT and GRIPS. Both of these appr...Show More
Robot simulators provide an easy way for evaluation of new concepts and algorithms in a simulated physical environment reducing development time and cost. Therefore it is convenient to have a tool that quickly creates a 3D landscape from an arbitrary 2D image or 2D laser range finder data. This paper presents a new tool that automatically constructs such landscapes for Gazebo simulator. The tool c...Show More
We consider the problem of planning angleconstrained paths in dynamic 2D environment represented as a grid. We propose an extension of the LIAN algorithm, which is tailored to solve the problem on static grids, by combining it with the prominent Lifelong planning approach. We describe the resultant algorithm, LPLian, and evaluate it empirically in the series of simulated experiments. The results o...Show More
Vision-based depth reconstruction is a challenging problem extensively studied in computer vision but still lacking universal solution. Reconstructing depth from single image is particularly valuable to mobile robotics as it can be embedded to the modern vision-based simultaneous localization and mapping (vSLAM) methods providing them with the metric information needed to construct accurate maps i...Show More
Methods for centralized planning of the collision-free trajectories for a fleet of mobile robots typically solve the discretized version of the problem and rely on numerous simplifying assumptions, e.g. moves of uniform duration, cardinal only translations, equal speed and size of the robots etc., thus the resultant plans can not always be directly executed by the real robotic systems. To mitigate...Show More
This paper investigates the usage of the RGB-D cameras for generation of dense 3D maps of environments. The proposed approach to generation of dense three-dimensional maps of indoor environments with a complex infrastructure is based on multisensor dynamic information, spatial alignment of successive frames of data, view-based loop closure detection (the robot returns to the primary point), the al...Show More