Abstract not found

) terms than the adaptive-ACMA with time varying environment. 1.

The aim of this correspondence is to improve the performance of the least mean square (LMS) and normalized-LMS (NLMS) adaptive algorithms in tracking of time-varying models. A new procedure for estimation of weight increments for including in the LMS-type adaptive algorithms is proposed

In this paper, we describe an algorithm for predicting future positions and orientation of a moving object in a time-varying environment using an autoregressive model (ARM). No constraint is placed on the obstacles motion. The model addresses prediction of translational and rotational motions

algorithm (equipped with the error sign) and the stop and go sign algorithm (whose adaptation is carried in some iterations and stopped on others). A comparative study between the basic sign algorithms and these two variants in case of time-varying environments, including additive impulsive noise, jumping

Direct sequence (DS) code division multiple access (CDMA) is a promising technology for wireless communication with multiple simultaneous transmissions. The capacity of DS-CDMA is interference-limited and can therefore be increased by techniques that suppress interference. In this paper, an interference cancellation method is given. We propose a novel parallel interference cancellation detector matched to the behavior of multipath fading channels. The proposed structure can cancel both intersymbol interference and co-channel interference and is blind in the sense that no knowledge of the training sequence of the interfering users is required. I.

fading. The shadowing and fading are assumed time-varying with different time-scales due to mobility and hopping. The receiver employs decision-feedback demodulation for differential unitary space-time modulation and erasure insertion decoding for Reed-Solomon codes [14] [15]. The decoding error

In thispaper, we study the problem ofdynamic coverage ofaset ofpoints of interest(POIs) inatime-varying environment. We consider the scenario where a physical quantity is constantly growing at certain rates at the POIs. A number of mobile agents are then deployed to periodically cover (sense

be modeled as an automaton, where each node corresponds to a distinct robot state. Through transitions between states, robot can coordinate multiple behaviors easily and rapidly under dynamic environment. As an illustration, a soccer task was finished by an AMR system with this method. The robot performed

Abstract — In this paper we present decentralized algorithms for motion coordination of a group of autonomous vehicles, aimed at minimizing the expected waiting time to service stochastically-generated targets. The vehicles move within a convex environment with bounded velocity, and target