Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Konstantin Mironov

dblp:221/5507 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0000-0002-4828-1345ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 since 2021Systems, architecture and hardware · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Motion planning and robot control · 72% Robot navigation and mapping · 28%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › path planning
local path planning
0.812024
Neural Potential Field for Obstacle-Aware Local Motion Planning · ICRA 2024
Robotics › Motion planning and robot control
motion planning
0.812024
Neural Potential Field for Obstacle-Aware Local Motion Planning · ICRA 2024
Robotics › Robot navigation and mapping
obstacle avoidance
0.812024
Neural Potential Field for Obstacle-Aware Local Motion Planning · ICRA 2024
Robotics › Motion planning and robot control › robot control
model predictive control
0.212024
Neural Potential Field for Obstacle-Aware Local Motion Planning · ICRA 2024
Robotics › Motion planning and robot control
robot control
0.212024
Neural Potential Field for Obstacle-Aware Local Motion Planning · ICRA 2024

Methods — techniques the papers use, named apart from their topics

signed distance function · 0.8neural potential field · 0.8neural image encoders · 0.8
YearPublicationVenuePosition
2025 Polygon decomposition for obstacle representation in motion planning with Model Predictive Control
Aleksey Logunov, Muhammad Alhaddad, Konstantin Mironov, Konstantin S. Yakovlev, Aleksandr I. Panov
Eng. Appl. Artif. Intell.3
2024 Neural Potential Field for Obstacle-Aware Local Motion Planning
abstract
Model predictive control (MPC) may provide local motion planning for mobile robotic platforms. The challenging aspect is the analytic representation of collision cost for the case when both the obstacle map and robot footprint are arbitrary. We propose a Neural Potential Field: a neural network model that returns a differentiable collision cost based on robot pose, obstacle map, and robot footprint. The differentiability of our model allows its usage within the MPC solver. It is computationally hard to solve problems with a very high number of parameters. Therefore, our architecture includes neural image encoders, which transform obstacle maps and robot footprints into embeddings, which reduce problem dimensionality by two orders of magnitude. The reference data for network training are generated based on algorithmic calculation of a signed distance function. Comparative experiments showed that the proposed approach is comparable with existing local planners: it provides trajectories with outperforming smoothness, comparable path length, and safe distance from obstacles.
Muhammad Alhaddad, Konstantin Mironov, Aleksey Staroverov, Aleksandr I. Panov
ICRA2
2024 Model-based Policy Optimization using Symbolic World Model
abstract
The application of learning-based control methods in robotics presents significant challenges. One is that model-free reinforcement learning algorithms use observation data with low sample efficiency. To address this challenge, a prevalent approach is model-based reinforcement learning, which involves employing an environment dynamics model. We suggest approximating transition dynamics with symbolic expressions, which are generated via symbolic regression. Approximation of a mechanical system with a symbolic model has fewer parameters than approximation with neural networks, which can potentially lead to higher accuracy and quality of extrapolation. We use a symbolic dynamics model to generate trajectories in model-based policy optimization to improve the sample efficiency of the learning algorithm. We evaluate our approach across various tasks within simulated environments. Our method demonstrates superior sample efficiency in these tasks compared to model-free and model-based baseline methods.
Andrey Gorodetskiy, Konstantin Mironov, Aleksandr I. Panov
IROS2