The paper addresses three important topics in mobile robotics. These are the path follower, the multi-sensors and the steering fuzzy controllers for wheeled mobile robot. This paper presents a novel computer vision methodology for building a system capable of determining the presence of a path follower, tracking the objects on that path, and recognizing the objects shape in vertical or in horiz...

Constraint-based path selection is an invaluable component of a full-ßedged quality of service (QoS) architecture. It aims at identifying a path that satisÞes a set of constraints (e.g., bounded delay, packet loss rate, etc.). Unfortunately, multi-constrained path selection problems are NPcomplete, and therefore often considered computationally intractable. This has led to the proposal of many ...

To designing higher-speed digital mobile communication systems, we must predict the multi-path propagation characteristics more accurately. Available path number and delay spread are effective indicators that make it easy to evaluate multi-path propagation. In this paper, we propose a novel delay profile model that can predict the available path number and the delay spread accurately due to its...

The paper proposes two fixpoint path query languages Path-Fixpoint and Path-While for unstructured data whose expressive power is that of Fixpoint and While queries respectively. These languages are multi-sorted like logic languages integrating fixpoint path expressions.

Abstract Multi-agent path finding arises, on the one hand, in numerous applied areas. A classical example is automated warehouses with a large number of mobile goods-sorting robots operating simultaneously. On other for this problem, there are no universal solution methods that simultaneously satisfy (often contradictory) requirements. Examples such criteria guarantee optimal solutions, high-sp...

In this paper, we propose a novel sampling-based planner for multi-goal path planning among obstacles, where the objective is to visit predefined target locations while minimizing travel costs. The order of visiting targets often achieved by solving Traveling Salesman Problem (TSP) or its variants. TSP requires define costs between individual targets, which - in map with obstacles compute mutua...