Minimal resource allocation on CAN bus using radial basis function networks

Yan Hao Wei, Mu Song Chen, Chuan Ku Lin, Chi Pan Hwang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 priori fixed 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).

Original languageEnglish
Title of host publicationAdvances in Neural Networks - ISNN 2007 - 4th International Symposium on Neural Networks, ISNN 2007, Proceedings
Pages998-1005
Number of pages8
EditionPART 3
Publication statusPublished - 2007 Dec 1
Event4th International Symposium on Neural Networks, ISNN 2007 - Nanjing, China
Duration: 2007 Jun 32007 Jun 7

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 3
Volume4493 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Symposium on Neural Networks, ISNN 2007
CountryChina
CityNanjing
Period07-06-0307-06-07

Fingerprint

Radial basis function networks
Radial Basis Function Network
Resource Allocation
Resource allocation
Parameter Optimization
Controller
Network Structure
Controllers
Scheduling
Convergence Time
Diverge
Radial Functions
Neurons
Basis Functions
Neuron
Schedule
Degradation
Simulation

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Wei, Y. H., Chen, M. S., Lin, C. K., & Hwang, C. P. (2007). Minimal resource allocation on CAN bus using radial basis function networks. In Advances in Neural Networks - ISNN 2007 - 4th International Symposium on Neural Networks, ISNN 2007, Proceedings (PART 3 ed., pp. 998-1005). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4493 LNCS, No. PART 3).
Wei, Yan Hao ; Chen, Mu Song ; Lin, Chuan Ku ; Hwang, Chi Pan. / Minimal resource allocation on CAN bus using radial basis function networks. Advances in Neural Networks - ISNN 2007 - 4th International Symposium on Neural Networks, ISNN 2007, Proceedings. PART 3. ed. 2007. pp. 998-1005 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3).
@inproceedings{66e667a638544bfba8767439980a7d63,
title = "Minimal resource allocation on CAN bus using radial basis function networks",
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 priori fixed 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).",
author = "Wei, {Yan Hao} and Chen, {Mu Song} and Lin, {Chuan Ku} and Hwang, {Chi Pan}",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "9783540723943",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 3",
pages = "998--1005",
booktitle = "Advances in Neural Networks - ISNN 2007 - 4th International Symposium on Neural Networks, ISNN 2007, Proceedings",
edition = "PART 3",

}

Wei, YH, Chen, MS, Lin, CK & Hwang, CP 2007, Minimal resource allocation on CAN bus using radial basis function networks. in Advances in Neural Networks - ISNN 2007 - 4th International Symposium on Neural Networks, ISNN 2007, Proceedings. PART 3 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 3, vol. 4493 LNCS, pp. 998-1005, 4th International Symposium on Neural Networks, ISNN 2007, Nanjing, China, 07-06-03.

Minimal resource allocation on CAN bus using radial basis function networks. / Wei, Yan Hao; Chen, Mu Song; Lin, Chuan Ku; Hwang, Chi Pan.

Advances in Neural Networks - ISNN 2007 - 4th International Symposium on Neural Networks, ISNN 2007, Proceedings. PART 3. ed. 2007. p. 998-1005 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4493 LNCS, No. PART 3).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Minimal resource allocation on CAN bus using radial basis function networks

AU - Wei, Yan Hao

AU - Chen, Mu Song

AU - Lin, Chuan Ku

AU - Hwang, Chi Pan

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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 priori fixed 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).

AB - 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 priori fixed 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).

UR - http://www.scopus.com/inward/record.url?scp=38049174247&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38049174247&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:38049174247

SN - 9783540723943

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 998

EP - 1005

BT - Advances in Neural Networks - ISNN 2007 - 4th International Symposium on Neural Networks, ISNN 2007, Proceedings

ER -

Wei YH, Chen MS, Lin CK, Hwang CP. Minimal resource allocation on CAN bus using radial basis function networks. In Advances in Neural Networks - ISNN 2007 - 4th International Symposium on Neural Networks, ISNN 2007, Proceedings. PART 3 ed. 2007. p. 998-1005. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3).