Demo Data from EDBT 2026 / reviewers in the wild / expert
Matej Dobrevski
dblp:219/9460
· DBLP profile ↗
3ranked-venue papers
2as first author
1since 2021 · last 2024
0000-0002-0181-8205ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorSecurity and privacy · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 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 |
Robot navigation and mapping · 70% Motion planning and robot control · 30% | |
| Network and information security
1 paper |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Robot navigation and mapping › mobile robot navigation
adaptive navigation |
0.8 | 1 | 2024 | Dynamic Adaptive Dynamic Window Approach · IEEE Trans. Robotics 2024 |
Robotics › Motion planning and robot control › motion planning › reactive motion generation
dynamic window approach |
0.8 | 1 | 2024 | Dynamic Adaptive Dynamic Window Approach · IEEE Trans. Robotics 2024 |
Robotics › Robot navigation and mapping › mobile robot navigation
local navigation |
0.8 | 1 | 2024 | Dynamic Adaptive Dynamic Window Approach · IEEE Trans. Robotics 2024 |
Robotics › Robot navigation and mapping › obstacle avoidance
dynamic obstacle avoidance |
0.2 | 1 | 2024 | Dynamic Adaptive Dynamic Window Approach · IEEE Trans. Robotics 2024 |
Methods — techniques the papers use, named apart from their topics
reinforcement learning · 0.8proximal policy optimization · 0.8neural network · 0.8dynamical bayesian inference · 0.3coupling function · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Dynamic Adaptive Dynamic Window ApproachabstractRobust local navigation is a critical capability for any mobile robot operating in a real-world, unstructured environment, especially when there are humans or other moving obstacles in the workspace. One of the most commonly used methods for local navigation is the Dynamic Window Approach (DWA), which does not address the problem of dynamic obstacles and depends heavily on the settings of the parameters in its cost function. Thus, it is a static approach that does not adapt to the characteristics of the environment, which can change significantly. On the other hand, data-driven deep learning approaches attempt to adapt to the characteristics of the environment by predicting the appropriate robot motion based on the current observation. However, they cannot guarantee collision-free trajectories for unseen inputs. In this work, we combine the best of both worlds. We propose a neural network to predict the weights of the DWA, which is then used for safe local navigation. To address the problem of dynamic obstacles the proposed method considers a short sequence of observations to allow the network to model the motion of the obstacles and adjust the DWA weights accordingly. The network is trained using the Proximal Policy Optimization (PPO) in a reinforcement learning setting in a simulated dynamic environment. We perform a comprehensive evaluation of the proposed approach in realistic scenarios using range scans of real 3D spaces and show that it outperforms both DWA and purely Deep Learning approaches. Matej Dobrevski, Danijel Skocaj |
IEEE Trans. Robotics | 1 |
| 2020 | Adaptive Dynamic Window Approach for Local NavigationabstractLocal navigation is an essential ability of any mobile robot working in a real-world environment. One of the most commonly used methods for local navigation is the Dynamic Window Approach (DWA), which heavily depends on the settings of the parameters in its cost function. Since the optimal choice of the parameters depends on the environment that may significantly vary and change at any time, the parameters should be chosen dynamically in a data-driven way. To cope with this problem, we propose a novel deep convolutional neural network, which dynamically predicts these parameters considering the sensor readings. The network is trained using a state-of-the art reinforcement learning algorithm. In this way, we combine the power of data-driven learning and the dynamic model of the robot, enabling adaptation to the current environment as well as guaranteeing collision-free movement and smooth trajectories of the mobile robot. The experimental results show that the proposed method outperforms the DWA method as well as its recent extension. Matej Dobrevski, Danijel Skocaj |
IROS | 1 |
| 2018 | Experimental Realization of the Coupling Function Secure Communications Protocol and Analysis of Its Noise RobustnessabstractThere is an increasing need for everyday communications to be both secure and resistant to external perturbations. We have, therefore, created an experimental implementation of the coupling-function-based secure communication protocol in order to assess its robustness to channel noise. The transmitter and receiver are implemented on single-board computers, thereby facilitating communication of the analog electronic signals. The information signals are encrypted at the transmitter as the time-variability of nonlinear coupling functions between dynamical systems. This results in a complicated nonlinear mixing and scrambling of the information. To replicate the channel noise, analog white noise is added to the encrypted signals. After digitization at the receiver, the decryption is performed with dynamical Bayesian inference to take account of time-varying dynamics in the presence of noise. The dynamical Bayesian approach effectively separates the deterministic information signals from the perturbations of dynamical channel noise. The experimental realization has demonstrated the feasibility, and established the performance, of the protocol for secure, reliable, communication even with high levels of channel noise. Gorjan Nadzinski, Matej Dobrevski, Peter V. E. McClintock, Aneta Stefanovska, Mile J. Stankovski, Tomislav Stankovski |
IEEE Trans. Inf. Forensics Secur. | 2 |