We propose a sensor based navigation algorithm for a mobile robot that assures a convergence property when the robot is navigated from a given start position to a goal position while avoiding moving and fixed obstacles. This algorithm guides the robot toward the goal by using its sensor information in an unknown environment. Conventional sensor based navigation algorithms such as Bug algorithm ...

Mobile robots often find themselves in a situation where they must find a trajectory to another position in their environment, subject to constraints posed by obstacles and the capabilities of the robot itself. This is the problem of planning a path through a continuous domain, for which several approaches have been developed. A method for autonomous mobile robot path planning is presented. Ini...

In this paper, a method for matching symbols in line-drawings is presented. Facing both segmentation and recognition of symbols is a difficult challenge. Starting from the results of a vectorization procedure, a visibility graph is built to enhance the main geometric constraints which were specified during the construction of the initial document. The cliques detection, which correspond to a pe...

Visibility computations are central in any computer graphics application. The most common way to reduce this expense is the use of approximate approaches using spatial subdivision. More recently analytic approaches efficiently encoding visibility have appeared for 2D (the visibility complex) and for certain limited cases in 3D (aspect graph, discontinuity meshes). In this paper we propose a new...

Recent observation studies have revealed that earthquakes are classified into several different categories. Each category might be characterized by the unique statistical feature in time series, but present understanding is still limited due to their nonlinear and nonstationary nature. Here we utilize complex network theory shed new light on properties of earthquake series. We investigate two k...

We show that the segment endpoint visibility graph of any finite set of 2n line segments contains a planar matching that does not use any segment edge, if the line segments in our set are convexly independent.

Introduction: Epileptic seizure detection is a key step for both researchers and epilepsy specialists for epilepsy assessment due to the non-stationariness and chaos in the electroencephalogram (EEG) signals. Current research is directed toward the development of an efficient method for epilepsy or seizure detection based the limited penetrable visibility graph (LPVG) algorith...