EX#15-1 Comprehensive (選做題，可不做)

 

 四選三

1. 設計基地台用高功率微波氮化鎵放大器，電路，數學模型，IC Die Chart

GaN, "Calibrated for 0.25 µm GaN-on-SiC RF process (Wolfspeed G2 / WIN NP25 class)" for base station

artifact (topology change, single device)

2. Build a city or a 3d landscape you choose. text to 3d model.

artifact, fractal

北車1, 北車2

花蓮鯉魚潭

中原電子系館

3. Build a Blue LED lattice model.

成績分布草案(EX#14尚未統計)

 

成績分布草案(EX#14尚未統計)

HW#15 Fractals (選做題，可不做)

 

1. Generate fractals from text. You may choose two themes to present. The following are some examples and the prompts that generate them.

artifact (share)

 3d fractal cloud plain cloud

Clouds & lightning

artifact (share)

artifact (share)

artifact(share)

artifact, fly thru woods

Trees are fractals

 

2. identify hazards in a fractal 3d assessment display, first person perspective, according to a real world photo, more in photo gallery Choose any photo to proceed with.

依據照片重建三維碎形場景，辨識其中可能的危險部位，需考慮視角與觀測位置轉換以便可以瀏覽各處細節，提供影像庫選取一張照片(可使用自選)

樣本參考

share, artifact

樣本參考

1. add 3d model in three.js

2. fractal 3d trees

3. a node's label only resolves once the probe reaches it

4. faithful positioning (like the photo)

artifact

樣本參考

artifact

樣本參考

artifact

 3. Visualize fractals  

Make 2 fractals resembling natural 3d object such as clouds, lungs, blood vessels, ocean waves, and forests.

share (Build realistic trees)

share

share (Swiss Cheese)

share (Fractal Antenna)

F-16 Jet Stream Animation

 F-16 戰機噴射氣流分析與動畫

2d Use fluid dynamics based on the Finite Element Method.

3d FEM

HW#14 Robot and BLV Navigation

課堂練習 

Deadline:  Saturday at 23:59 (one more week)

Send all the share links to  me chang212@gmail.com by email with subject HW#14 [your id, your name]

 3 選一

1. 參考Voronoi navigation app，製作以下場景的導航

 share

task 1: make an entrance/exit. make the auto-navigation route deliberately exit through this gate (e.g., a waypoint placed just outside on the brick path) and go to central woods as destination.

task 2: set FPV (first-person view) and maintain horizontal view angle

task 3: show Voronoi Waypoints for navigation

提示：給還不熟悉Claude 的同學，如何套用既有導航系統到這個溜冰場情境(如照片)，已經會套用artifact 同學可以跳過

如何套用 https://claude.ai/share/8ac9c5a7-4944-41e7-a1af-027635b14dac

2. Implement Voronoi-based navigation for robots or BLV users

Non-Voronoi Navigation

3. Benchmark the two static vs. dynamic Voronoi-based navigation. 30 seeds.

Voronoi start-up A* + Repelling

dynamic voronoi

Follow up HW#13

 Problem 1

以下是比較不同演算法得出的繞線以及比較不同繞線的電路效能

Trace Routing Errors and Repairs router optimization （original by Ms. Wu）

A* vs Dijkstra side-by-side comparison originally by Ms. Kuo

Problem 2

suggestions

- Add a short note on how CL1 and CL2 set the load capacitance the crystal sees: CL = (CL1*CL2)/(CL1+CL2) + Cstray. With 22 pF caps this lands near the common 12 to 18 pF crystal spec once stray is included, and stating it explicitly ties your part choices to the datasheet.

pierceCalc

Consider analysis of heatmap

trace, 3d, heat map＊ heat map by me, trace route and 3D by Mr. Su

HW#13 Circuit Optimization on PCB

課堂練習 

Deadline:  Saturday at 23:59 (one more week)

Send all the share links to  me chang212@gmail.com by email with subject HW#13 [your id, your name]

1. Optimize trace routing for the Differential Pair Circuit on PCB 

trace routing, share (artifact, more accurate schematic)

Steps

Starting from the imperfect design, complete the trace routing. Do trace routing ( 參考 share, share 2, share 3)

我是希望你們可以自行變換

無論是優化，更換演算法，UI 都可以，總之不是複製

2. 設計Crystal 石英振盪電路的PCB

 (slides) schematic

除了ＰＣＢ視覺化，我是希望可以做一下 sensitivity analysis 或是 heat map

(3, 4 任選一題來做)

3. 使用鑽孔路徑演算法進行以下PCB 鑽孔(演算法 提供參考)

PCB 1

4. 

PCB 2

甚麼是 TSP?

Traveling Salesman Problem 簡稱TSP

 (一個推銷員要拜訪所有客戶城市，每個城市只能拜訪一次，最後要回到出發城市，請為他/她計算最短的拜訪路徑)

TSP在工業界有重要應用，包括物流（UPS/Amazon配送路線優化）、製造業（電路板鑽孔、機器人組裝路徑）、電信（網路路由、線路安裝）和能源（電網維護、管線檢查）。凡是需要造訪多個地點同時最小化成本、時間或距離的場合都適用。現代變體能處理容量限制、時間窗口等實際約束。企業使用OR-Tools、Gurobi等專業軟體解決這些問題，透過優化倉儲揀貨、切割模式、3D列印路徑和車隊管理等作業，往往能節省數百萬成本。

(樸素) Visualize TSP (Traveling Salesman Problem) by A* search 使其可以改變網路節點個數

(美學) 視覺化 A* for Traveling Salesman Problem 使其可以改變網路節點個數