This paper presents an attempt to solve path planning problem for a mobile robot operating in indoor environment model using iterative numerical technique. It is based on the use of Laplace's Equation to compute the potential functions in the environment grid model of the robot. The proposed block iterative method, better known as Four Point-Explicit Group via Nine-Point Laplacian (4EGSOR9...

The presence of near-end interferences and echo path changes make it essential for an adaptive filter to vary its learning rate according to corresponding conditions. In this paper, a robust step-size control algorithm which is based on the optimization of the square of the bin-wise a posteriori error is proposed. To prevent the adaptive filter from diverging in the presence of interferences, c...

Consider laying out a fixed-topology tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse a path from the root to a node of depth D. We prove that the optimal number of memory transfers is Θ   D lg(1+B) when D = O(lgN) lgN lg ( 1+ lg N D ) when D = Ω(lgN) and D = O(B lgN) D B when D ...

In this paper, we are interested in the edge intersection graphs of paths a grid where each path has at most one bend, called B 1 -EPG and first introduced by Golumbic et al (2009). We also consider proper subclass -EPG, x graphs, which allows only “ ” shape. show that two superclasses trees (one them being cactus graphs). On other hand, block provide linear time algorithm to produce representa...

In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...

the colorful paths and rainbow paths have been considered by severalauthors.a colorful directed path in a digraph $g$ is a directed path with $chi(g)$ vertices whose colors are different. a $v$-colorful directed path is such a directed path, starting from $v$. we prove that for a given $3$-regular triangle-free digraph $g$ determining whether there is a proper $chi(g)$-coloring of $g$such that ...

Recently, a distance function was defined on the face-centered cubic and body-centered cubic grids by combining weights and neighbourhood sequences. These distances share many properties with traditional path-based distance functions, such as the city-block distance, but are less rotational dependent. We present conditions for metricity and algorithms to compute the distances.

In a signed graph G, a negative clique is a complete subgraph having negative edges only. In this article, we give characteristic polynomial expressions, and eigenvalues of some signed graphs having negative cliques. This includes signed cycle graph, signed path graph, a complete graph with disjoint negative cliques, and star block graph with negative cliques.

This paper proposes to conceptualize a geographic trajectory as an attribute-time path (ATP) traversing an n-dimensional attribute space. Geographic entities occupying a certain study area are conceptualized as discrete loci in that same n-dimensional space. Those entities undergo spatialization and the resulting point locations become vertices as the ATP is projected into lower dimensions to f...

This paper is concerned with the planning of optimal trajectories for vehicle collision avoidance with a Timed Elastic Band (TEB) framework. The avoidance trajectory is represented by a TEB which is optimized with respect to multiple partially conflicting objectives. The resulting trajectory constitutes the optimal compromise between a mere braking and a lane change maneuver that avoids the col...