具自我診斷能力之可組合的嵌入式系統｜國立清華大學博碩士論文庫

簡易檢索 / 詳目顯示

回結果列表

研究生：	許庭瑜 Hsu, Ting-Yu
論文名稱：	具自我診斷能力之可組合的嵌入式系統 Physically Composable Embedded Systems with Self-Diagnostic Capability
指導教授：	周百祥 Chou, Pai H. 周志遠 Chou, Jerry
口試委員:	蔡明哲 Tsai, Ming-Jer 韓永楷 Hon, Wing Kai
學位類別：	碩士 Master
系所名稱：
論文出版年：	2017
畢業學年度：	105
語文別：	英文
論文頁數：	55
中文關鍵詞：	拓樸、可組合的、自我診斷、嵌入式系統
外文關鍵詞：	topology, composable, self-diagnostic, embedded system
相關次數：	點閱：2 下載：0
分享至:	分享至facebook 分享至twitter

查詢本校圖書館目錄查詢臺灣博碩士論文知識加值系統勘誤回報

這篇論文提供了一套可以依使用者需求任意組合的嵌入式系統模組。
模組間可以像樂高積木一般簡單的被組合在一起，並自主運行模組間的溝通。
這些積木模組可分成條管(tube)及耦合器(coupler)兩種類型，
以模組組成之拓樸網路架構來看，tube及coupler分別對應邊和頂點。
就結果而言，這套系統能夠找出所有積木模組組成之圖形拓樸、
協調模組間的電源分配及資料傳輸的路徑，並且具有自我診斷能力，
能夠即時發現所使用的模組是否故障。
實驗結果顯示，這套系統能讓未受訓的人組成可應用在智慧取藥系統的藥櫃模組，
並透過客戶端應用程式正確且快速的控制藥櫃模組，
而不需要請專業人員來進行硬體及韌體的佈建。

This thesis describes a new platform for building a class of custom
embedded system by composing them as simply as piecing together Lego
blocks. The building blocks consist of tubes and couplers that
correspond to edges and vertices for network formation. The resulting
system discovers its own graph topology and negotiates resources such
as power budget, route availability, and self diagnosis for
malfunctioning components. Experimental results show that the
platform enables untrained persons to construct and administer a
custom system for a cell indicator system for pharmacies (CISP)
rapidly and correctly that would otherwise require considerable
professionals hardware and firmware engineering efforts to construct.

Contents i
Acknowledgments v
Introduction 1
1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
2 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
3 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
4 Thesis Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
Related Work 4
1 Reconﬁgurable Module System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
2 Enumeration of Cycles in Graph . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
System Overview 7
1 Hardware Building Blocks of EcoJimu . . . . . . . . . . . . . . . . . . . . . . . . . 7
1.1 Couplers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
1.2 Tube . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
2 System Block Diagram . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2.1 EcoJimu Subsystem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2.2 Host Subsystem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
Technical Approach 12
1 Hardware . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
1.1 Schematic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
2 Firmware . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
2.1 Communication Speciﬁcation . . . . . . . . . . . . . . . . . . . . . . . . . 14
2.2 Workﬂow . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
2.3 Diagnosis of Composition State . . . . . . . . . . . . . . . . . . . . . . . . 19
3 Software . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
3.1 Workﬂow . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
Topology Algorithm 24
1 Preliminary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
2 Algorithm for Finding Minimal Cycles . . . . . . . . . . . . . . . . . . . . . . . . . 25
2.1 Observation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
2.2 Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
Evaluation 32
1 Experimental Setup . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
2 Experimental Result . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
2.1 Enumerating Minimal Cycles . . . . . . . . . . . . . . . . . . . . . . . . . 33
2.2 Revising Minimal Cycles . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
Conclusions and Future Work 36
1 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36
2 Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
A Schematic 41
B Source Code 46
B.1 Host Program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46
                                

[1] P. H. Chou, H.-M. Tseng, T.-Y. Hsu, C.-T. Lee, C.-C. Nien, and S.-Y. Chien, “Cell indicator
system for pharmacies,” in 2017 1st IEEE International Conference on Smart City Innovations,
pp. 1133–1138, Aug. 2017.
[2] Q. Chi, H. Yan, C. Zhang, Z. Pang, and L. D. Xu, “A reconﬁgurable smart sensor interface
for industrial WSN in IoT environment,” IEEE Transactions on Industrial Informatics, vol. 10,
pp. 1417–1425, May 2014.
[3] S. Folea, S. Enyedi, L. Miclea, and H. Hedesiu, “Reconﬁgurable test platform for modular em-
bedded systems in manufacturing processes,” in 2015 10th International Design Test Symposium
(IDT), pp. 72–77, Dec. 2015.
[4] L. Bauer, C. Braun, M. E. Imhof, M. A. Kochte, H. Zhang, H. J. Wunderlich, and J. Henkel,
“OTERA: Online test strategies for reliable reconﬁgurable architectures,” in 2012 NASA/ESA
Conference on Adaptive Hardware and Systems (AHS), pp. 38–45, June 2012.
[5] B. Salemi, M. Moll, and W.-m. Shen, “SUPERBOT: A deployable, multi-functional, and mod-
ular self-reconﬁgurable robotic system,” in 2006 IEEE/RSJ International Conference on Intelli-
gent Robots and Systems, pp. 3636–3641, Oct. 2006.
[6] M. Yim, W.-m. Shen, B. Salemi, D. Rus, M. Moll, H. Lipson, E. Klavins, and G. S. Chirikjian,
“Modular self-reconﬁgurable robot systems [grand challenges of robotics],” IEEE Robotics Au-
tomation Magazine, vol. 14, pp. 43–52, Mar. 2007.
[7] Y. Zhu, J. Zhao, X. Cui, X. Wang, S. Tang, X. Zhang, and J. Yin, “Design and implementa-
tion of UBot: A modular self-reconﬁgurable robot,” in 2013 IEEE International Conference on
Mechatronics and Automation, pp. 1217–1222, Aug. 2013.
[8] W.-m. Shen, B. Salemi, and P. Will, “Hormone-inspired adaptive communication and distributed
control for CONRO self-reconﬁgurable robots,” IEEE Transactions on Robotics and Automa-
tion, vol. 18, pp. 700–712, Oct. 2002.
[9] “littleBits.” https://littlebits.cc/.
[10] D. Ajwani, S. Ali, and J. P. Morrison, “Graph partitioning for reconﬁgurable topology,” in 2012
IEEE 26th International Parallel and Distributed Processing Symposium, pp. 1530–2075, May
2012.
[11] J. T. Welch, Jr., “A mechanical analysis of the cyclic structure of undirected linear graphs,” J.
ACM, vol. 13, pp. 205–210, Apr. 1966.
[12] C. G. Gotlieb and D. G. Corneil, “Algorithms for ﬁnding a fundamental set of cycles for an
undirected linear graph,” Commun. ACM, vol. 10, pp. 780–783, Dec. 1967.
[13] R. C. Read and R. E. Tarjan, “Bounds on backtrack algorithms for listing cycles, paths, and
spanning trees,” Networks, 1975.
[14] J. L. Szwarcﬁter and P. E. Lauer, “A search strategy for the elementary cycles of a directed
graph,” BIT Numerical Mathematics, vol. 16, no. 2, pp. 192–204, 1976.
[15] D. B. Johnson, “Finding all the elementary circuits of a directed graph,” SIAM Journal on Com-
puting, vol. 4, no. 1, pp. 77–84, 1975.
[16] J. C. Tiernan, “An efﬁcient search algorithm to ﬁnd the elementary circuits of a graph,” Commun.
ACM, vol. 13, pp. 722–726, Dec. 1970.
[17] P. Mateti and N. Deo, “On algorithms for enumerating all circuits of a graph,” SIAM Journal on
Computing, vol. 5, pp. 90–99, Apr. 1976.
[18] E. Birmelé, R. A. Ferreira, R. Grossi, A. Marino, N. Pisanti, R. Rizzi, G. A. T. Sacomoto, and
M. Sagot, “Optimal listing of cycles and st-paths in undirected graphs,” CoRR, 2012.
[19] J. D. Horton, “A polynomial-time algorithm to ﬁnd the shortest cycle basis of a graph,” SIAM
Journal on Computing, vol. 16, no. 2, pp. 358–366, 1987.
[20] J. Leydold and P. F. Stadler, “Minimal cycle bases of outerplanar graphs,” The Electronic Journal
of Combinatorics [electronic only], vol. 5, no. 1, 1998.
[21] H. Liu and J. Wang, “A new way to enumerate cycles in graph,” in Advanced Int’l Conference
on Telecommunications and Int’l Conference on Internet and Web Applications and Services
(AICT-ICIW’06), pp. 57–57, Feb. 2006.
[22] “Linux Mint.” https://www.linuxmint.com/.
[23] “BluePy.” https://pypi.python.org/pypi/bluepy/1.1.0.
[24] “NetworkX.” https://networkx.github.io/index.html.
[25] “Matplotlib.” https://matplotlib.org.
[26] “USB Type-C.” https://en.wikipedia.org/wiki/USB-C.

簡易檢索 / 詳目顯示

相關論文