Minimal Resource Allocation on CAN Bus Using Radial Basis Function Networks

  • Authors:
  • Yan Hao Wei;Mu-Song Chen;Chuan Ku Lin;Chi-Pan Hwang

  • Affiliations:
  • Department of Electrical Engineering, Da-Yeh University,;Department of Electrical Engineering, Da-Yeh University,;Department of Electrical Engineering, Da-Yeh University,;Department of Electrical Engineering, National Chung-Hwa University,

  • Venue:
  • ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

Optimal message scheduling is one of the key issues in the field of controller area network (CAN) bus system. There are numerous approaches related to this issue. Most of them are essentially based on priority-based strategies. In 1, we utilized Radial Basic Function (RBF) network 2 as a message scheduling controller to dynamically schedule messages. Furthermore, an online Backward-Through-Time (BTT) algorithm is presented for parameter optimization under a priorifixed network structure. Intuitively, an inappropriate RBF network structure leads to performance degradation. In the worst case, the CAN system diverges. In this paper, we extend our previous works by including Minimal Resource Allocation (MRA) algorithm for structure determination. In this way, both problems of parameter optimization and structure determination can be resolved at the same time. Simulation results demonstrated that the proposed BTT with MRA methods outperform our previous results in terms of convergence time, stability, and the number of required hidden neurons (or radial basis functions).