Adaptive message rate control of infrastructured DSRC vehicle networks for coexisting road safety and non-safety applications

Intelligent transport system (ITS) has large potentials on road safety applications as well as nonsafety applications. One of the big challenges for ITS is on the reliable and cost-effective vehicle communications due to the large quantity of vehicles, high mobility, and bursty traffic from the safety and non-safety applications. In this paper, we investigate the use of dedicated short-range communications (DSRC) for coexisting safety and non-safety applications over infrastructured vehicle networks. The main objective of this work is to improve the scalability of communications for vehicles networks, ensure QoS for safety applications, and leave as much as possible bandwidth for non-safety applications. A two-level adaptive control scheme is proposed to find appropriate message rate and control channel interval for safety applications. Simulation results demonstrated that this adaptive method outperforms the fixed control method under varying number of vehicles. © 2012 Wenyang Guan et al.

Stochastic control strategies and adaptive critic methods

Adaptive critic methods have common roots as generalizations of dynamic programming for neural reinforcement learning approaches. Since they approximate the dynamic programming solutions, they are potentially suitable for learning in noisy, nonlinear and nonstationary environments. In this study, a novel probabilistic dual heuristic programming (DHP) based adaptive critic controller is proposed. Distinct to current approaches, the proposed probabilistic (DHP) adaptive critic method takes uncertainties of forward model and inverse controller into consideration. Therefore, it is suitable for deterministic and stochastic control problems characterized by functional uncertainty. Theoretical development of the proposed method is validated by analytically evaluating the correct value of the cost function which satisfies the Bellman equation in a linear quadratic control problem. The target value of the critic network is then calculated and shown to be equal to the analytically derived correct value.

Self-adaptive probabilistic roadmap generation for intelligent virtual agents

Agents inhabiting large scale environments are faced with the problem of generating maps by which they can navigate. One solution to this problem is to use probabilistic roadmaps which rely on selecting and connecting a set of points that describe the interconnectivity of free space. However, the time required to generate these maps can be prohibitive, and agents do not typically know the environment in advance. In this paper we show that the optimal combination of different point selection methods used to create the map is dependent on the environment, no point selection method dominates. This motivates a novel self-adaptive approach for an agent to combine several point selection methods. The success rate of our approach is comparable to the state of the art and the generation cost is substantially reduced. Self-adaptation therefore enables a more efficient use of the agent's resources. Results are presented for both a set of archetypal scenarios and large scale virtual environments based in Second Life, representing real locations in London.

Reductions of peak-to-average power ratio and optical beat interference in cost-effective OFDMA-PONs

The peak-to-average power ratio (PAPR) and optical beat interference (OBI) effects are examined thoroughly in orthogonal frequency-division multiplexing access (OFDMA)-passive optical networks (PONs) at a signal bit rate up to ∼ 20 Gb/s per channel using cost-effective intensity-modulation and direct-detection (IM/DD). Single-channel OOFDM and upstream multichannel OFDM-PONs are investigated for up to six users. A number of techniques for mitigating the PAPR and OBI effects are presented and evaluated including adaptive-loading algorithms such as bit/power-loading, clipping for PAPR reduction, and thermal detuning (TD) for the OBI suppression. It is shown that the bit-loading algorithm is a very efficient PAPR reduction technique by reducing it at about 1.2 dB over 100 Km of transmission. It is also revealed that the optimum method for suppressing the OBI is the TD + bit-loading. For a targeted BER of 1 × 10-3, the minimum allowed channel spacing is 11 GHz when employing six users. © 2013 Springer Science+Business Media New York.

Self-adaptive volunteered services composition through stimulus-and time-awareness

Volunteered Service Composition (VSC) refers to the process of composing volunteered services and resources. These services are typically published to a pool of voluntary resources. Selection and composition decisions tend to encounter numerous uncertainties: service consumers and applications have little control of these services and tend to be uncertain about their level of support for the desired functionalities and non-functionalities. In this paper, we contribute to a self-awareness framework that implements two levels of awareness, Stimulus-awareness and Time-awareness. The former responds to basic changes in the environment while the latter takes into consideration the historical performance of the services. We have used volunteer service computing as an example to demonstrate the benefits that self-awareness can introduce to self-adaptation. We have compared the Stimulus-and Time-awareness approaches with a recent Ranking approach from the literature. The results show that the Time-awareness level has the advantage of satisfying higher number of requests with lower time cost.