상세정보
Export to Refworks부가기능
Paradigm and Paradox in Power Networks
상세 프로파일
| 자료유형 | 학위논문 |
|---|---|
| 서명/저자사항 | Paradigm and Paradox in Power Networks. |
| 개인저자 | Wang, Shuai. |
| 단체저자명 | Boston University. Systems Engineering ENG. |
| 발행사항 | [S.l.]: Boston University., 2018. |
| 발행사항 | Ann Arbor: ProQuest Dissertations & Theses, 2018. |
| 형태사항 | 139 p. |
| 기본자료 저록 | Dissertation Abstracts International 79-12B(E). Dissertation Abstract International |
| ISBN | 9780438149830 |
| 학위논문주기 | Thesis (Ph.D.)--Boston University, 2018. |
| 일반주기 |
Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.
Adviser: John Baillieul. |
| 요약 | Well known in the theory of network flows, Braess paradox states that adding path(s) to a congested road network may increase overall journey time. In transportation networks, the phenomenon results from selfish routing. In power systems, an ana |
| 요약 | The thesis starts with the discussion of Braess-like congestion phenomena in linear circuits. We prove that adding electrical path(s) always increases congestion in networks powered by voltage sources, while the opposite in networks driven by cu |
| 요약 | We go on to explore network decomposition in combination with greedy sequential line switching heuristics to address the NP-hardness of power grid topology control. By means of some low order examples, it is shown that within a reasonably large |
| 요약 | The final part of the thesis presents a new approach to grid decomposition using vertex cut sets. We show that each vertex cut set and corresponding grid decomposition establishes a natural upper bound on the interactions between subgrids as nod |
| 일반주제명 | Electrical engineering. |
| 언어 | 영어 |
| 바로가기 | 
: 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
