With the widespread use of IoT applications and the increasing trend in the number of
connected smart devices, the concept of routing has become very challenging. In this …

The majority of planning algorithms used are based on the occupancy grid maps, but in
complicated situations, the occupancy grid maps have a significant search overhead. This …

It is well known that there may be significant individual differences in physiological signal
patterns for emotional responses. Emotion recognition based on electroencephalogram …

Autonomous navigation in unknown environments holds significance for mobile robots. This
article presents a novel efficient path planner, named E-Planner, which utilizes the visibility …

The construction of complex networks from electroencephalography (EEG) proves to be an
effective method for representing emotion patterns in affection computing as it offers rich …

This thesis is concerned with analyzing the computational complexity of NP-hard problems
related to data science. For most of the problems considered in this thesis, the computational …

To construct a simple polygon from a set of plane points, we propose an iterative inserting
ordered points (IIOP) algorithm. Using a given a set of ordered non-collinear points, a simple …

Proximity graphs are induced by sets of points in the plane or higher-dimensional structures.
Such graphs describe which sets of points are close to one another and which are not …