M
Marija Seder
Researcher at University of Zagreb
Publications - 27
Citations - 494
Marija Seder is an academic researcher from University of Zagreb. The author has contributed to research in topics: Motion planning & Mobile robot. The author has an hindex of 6, co-authored 20 publications receiving 349 citations.
Papers
More filters
Proceedings ArticleDOI
Dynamic window based approach to mobile robot motion control in the presence of moving obstacles
Marija Seder,Ivan Petrović +1 more
TL;DR: A motion control method for mobile robots in partially unknown environments populated with moving obstacles based on the integration of focused D* search algorithm and dynamic window local obstacle avoidance algorithm with some adaptations that provide efficient avoidance of moving obstacles.
Journal ArticleDOI
Path Planning for Active SLAM Based on the D* Algorithm With Negative Edge Weights
TL;DR: A path planning algorithm for active SLAM that continuously improves robot’s localization while moving smoothly, without stopping, toward a goal position is proposed, based on the D* shortest path graph search algorithm with negative edge weights for finding the shortest path taking into account localization uncertainty.
Proceedings ArticleDOI
An integrated approach to real-time mobile robot control in partially known indoor environments
TL;DR: A motion control method for mobile robots in partially known indoor environments based on integration of focussed D* search algorithm and dynamic window local obstacle avoidance algorithm is presented.
Journal ArticleDOI
Receding Horizon Control for Convergent Navigation of a Differential Drive Mobile Robot
TL;DR: A receding horizon control (RHC) algorithm for convergent navigation of a differential drive mobile robot is proposed, which produces faster motion to the goal with significantly lower computational costs and it does not need any controller tuning to cope with diverse obstacle configurations.
Journal ArticleDOI
Hierarchical path planning of mobile robots in complex indoor environments
TL;DR: The FHD* algorithm guarantees the optimality of the global path, and requires considerably less time for the path replanning operations, and can be easily extended to the problem of path planning between different floors or buildings.