scispace - formally typeset
Search or ask a question
Author

Ivan Petrović

Bio: Ivan Petrović is an academic researcher from University of Zagreb. The author has contributed to research in topics: Mobile robot & Motion planning. The author has an hindex of 28, co-authored 248 publications receiving 3002 citations. Previous affiliations of Ivan Petrović include Czech Technical University in Prague & University of Toronto.


Papers
More filters
Proceedings ArticleDOI
03 Jul 2011
TL;DR: The Model Predictive Control (MPC) strategy is used to solve the mobile robot trajectory tracking problem, where controller must ensure that robot follows pre-calculated trajectory.
Abstract: In this paper the Model Predictive Control (MPC) strategy is used to solve the mobile robot trajectory tracking problem, where controller must ensure that robot follows pre-calculated trajectory. The so-called explicit optimal controller design and implementation are described. The MPC solution is calculated off-line and expressed as a piecewise affine function of the current state of a mobile robot. A linearized kinematic model of a differential drive mobile robot is used for the controller design purpose. The optimal controller, which has a form of a look-up table, is tested in simulation and experimentally.

36 citations

Proceedings Article
23 May 2011
TL;DR: A modified Asano's algorithm is implemented for determining the visibility polygons and visibility graphs and the main advantage of this method is that it can be applied in dynamical environments (environments that change in time).
Abstract: Computational geometry is very important for solving motion planning problems Visibility graphs are very useful in determining the shortest path In this work, a modified Asano's algorithm is implemented for determining the visibility polygons and visibility graphs Implementation is done using the CGAL library Although the principle for determining visibility graphs is rather simple, the procedure is very time and space consuming and the goal is to achieve lower algorithm complexity The algorithm consists of two steps: first, angular sorting of points is done using the dual transformation, and second, visibility between the points is determined Testing of the algorithm is done on two polygonal test sets The first is made of squares, uniformly and densely distributed The second is made of triangles, randomly and sparsely distributed Results show a cubical complexity of the algorithm, depending on the number of reflex points The main advantage of this method is that it can be applied in dynamical environments (environments that change in time) It is not required to perform the calculation for all points on the map Instead, the graph can be refreshed locally so it is very practical for online use

36 citations

Proceedings ArticleDOI
10 Dec 2003
TL;DR: In this paper, an extended Kalman filter (EKF) and an unscented Kalman Filter (UKF) are used for state estimation of nonlinear systems.
Abstract: Electronic throttle body (ETB) is a device used in cars to regulate air inflow into the motor's combustion system. Its good behavior is crucial for the superimposed engine speed control system. However, electronic throttle body is a highly nonlinear process, and its only measurable state is the throttle valve position measured by a cheap potentiometer of low resolution, resulting in significant quantization noise. In order to apply an advanced control strategy, all states should be usually available and the measurement noise should be reduced. With these two goals in mind we have implemented an extended Kalman filter (EKF), as a common solution for state estimation of nonlinear systems, and an unscented Kalman filter (UKF), which is a preferable solution when the process nonlinearities are very strong. Both filters are based on discrete time piece-wise affine process model which uses new friction model. By experimental tests on a real ETB it is shown that UKF gives better estimates of its state variables.

36 citations

Journal ArticleDOI
TL;DR: The novel algorithm of complete coverage called complete coverage D* (CCD*) algorithm is developed, based on the D* search of the two-dimensional occupancy grid map of the environment, with emphasis on safety of motion and reductions of path length and search time.

34 citations

Proceedings ArticleDOI
24 Dec 2012
TL;DR: The state is represented with a mixture of von Mises distributions, thus offering advantages of being able to model multimodal distributions, handle nonlinear state transition and measurement models, and to completely cover the whole state space, all with a modest number of parameters.
Abstract: This paper presents a novel method for Bayesian bearing-only tracking. Unlike the classical approaches, which involve using Gaussian distribution, the tracking procedure is completely covered with the von Mises distribution, including state representation, transitional probability, and measurement model, since it captures and models well the peculiarities of directional data. The state is represented with a mixture of von Mises distributions, thus offering advantages of being able to model multimodal distributions, handle nonlinear state transition and measurement models, and to completely cover the whole state space, all with a modest number of parameters. The tracking procedure is solved by convolution with a von Mises distribution (prediction step) and multiplication with a mixture representing the measurement model (update step). Since in the update step the number of mixture components grows exponentially, a method is presented for component reduction of a von Mises mixture. Furthermore, a closed-form solution is derived for quadratic Renyi entropy of the von Mises mixture. The algorithm is tested and compared to a particle filter representation in a speaker tracking scenario on a synthetic data set and real-world recordings. The results supported the proposed approach and showed similar performance to the particle filter.

33 citations


Cited by
More filters
Journal ArticleDOI

[...]

08 Dec 2001-BMJ
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

33,785 citations

Posted Content
TL;DR: This paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies which are adaptive, distributed, asynchronous, and verifiably correct.
Abstract: This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies. The resulting closed-loop behavior is adaptive, distributed, asynchronous, and verifiably correct.

2,198 citations

Journal Article
TL;DR: In this paper, two major figures in adaptive control provide a wealth of material for researchers, practitioners, and students to enhance their work through the information on many new theoretical developments, and can be used by mathematical control theory specialists to adapt their research to practical needs.
Abstract: This book, written by two major figures in adaptive control, provides a wealth of material for researchers, practitioners, and students. While some researchers in adaptive control may note the absence of a particular topic, the book‘s scope represents a high-gain instrument. It can be used by designers of control systems to enhance their work through the information on many new theoretical developments, and can be used by mathematical control theory specialists to adapt their research to practical needs. The book is strongly recommended to anyone interested in adaptive control.

1,814 citations

Journal ArticleDOI
TL;DR: A review of motion planning techniques implemented in the intelligent vehicles literature, with a description of the technique used by research teams, their contributions in motion planning, and a comparison among these techniques is presented.
Abstract: Intelligent vehicles have increased their capabilities for highly and, even fully, automated driving under controlled environments. Scene information is received using onboard sensors and communication network systems, i.e., infrastructure and other vehicles. Considering the available information, different motion planning and control techniques have been implemented to autonomously driving on complex environments. The main goal is focused on executing strategies to improve safety, comfort, and energy optimization. However, research challenges such as navigation in urban dynamic environments with obstacle avoidance capabilities, i.e., vulnerable road users (VRU) and vehicles, and cooperative maneuvers among automated and semi-automated vehicles still need further efforts for a real environment implementation. This paper presents a review of motion planning techniques implemented in the intelligent vehicles literature. A description of the technique used by research teams, their contributions in motion planning, and a comparison among these techniques is also presented. Relevant works in the overtaking and obstacle avoidance maneuvers are presented, allowing the understanding of the gaps and challenges to be addressed in the next years. Finally, an overview of future research direction and applications is given.

1,162 citations

Journal Article
TL;DR: A new approach to visual navigation under changing conditions dubbed SeqSLAM, which removes the need for global matching performance by the vision front-end - instead it must only pick the best match within any short sequence of images.
Abstract: Learning and then recognizing a route, whether travelled during the day or at night, in clear or inclement weather, and in summer or winter is a challenging task for state of the art algorithms in computer vision and robotics. In this paper, we present a new approach to visual navigation under changing conditions dubbed SeqSLAM. Instead of calculating the single location most likely given a current image, our approach calculates the best candidate matching location within every local navigation sequence. Localization is then achieved by recognizing coherent sequences of these “local best matches”. This approach removes the need for global matching performance by the vision front-end - instead it must only pick the best match within any short sequence of images. The approach is applicable over environment changes that render traditional feature-based techniques ineffective. Using two car-mounted camera datasets we demonstrate the effectiveness of the algorithm and compare it to one of the most successful feature-based SLAM algorithms, FAB-MAP. The perceptual change in the datasets is extreme; repeated traverses through environments during the day and then in the middle of the night, at times separated by months or years and in opposite seasons, and in clear weather and extremely heavy rain. While the feature-based method fails, the sequence-based algorithm is able to match trajectory segments at 100% precision with recall rates of up to 60%.

686 citations