Expressing dynamic reconfiguration by partial evaluation

1996 ◽  
Author(s):  
Singh ◽  
Hogg ◽  
McAuley
Keyword(s):  
Partial Evaluation ◽  
Dynamic Reconfiguration

Orbital architectures with dynamic reconfiguration

1987 ◽  
Vol 134 (6) ◽  
pp. 281 ◽  
Author(s):  
W.A. Porter ◽  
J.L. Aravena
Keyword(s):  
Dynamic Reconfiguration

Dynamic Reconfiguration in Planetary Exploration: A Sociomaterial Ethnography

MIS Quarterly ◽  
2014 ◽  
Vol 38 (3) ◽  
pp. 831-848 ◽  
Author(s):  
Melissa Mazmanian ◽  
◽  
Marisa Cohn ◽  
Paul Dourish ◽  
◽  
...  
Keyword(s):  
Dynamic Reconfiguration ◽  
Planetary Exploration

Dynamic Reconfiguration and Interoperation in Infospace Communities

2008 ◽  
Author(s):  
Joseph Loyall ◽  
Praveen Sharma ◽  
Matthew Gillen ◽  
Jianming Ye ◽  
Richard Shantz
Keyword(s):  
Dynamic Reconfiguration

scholarly journals Improving PV Resilience by Dynamic Reconfiguration in Distribution Grids: Problem Complexity and Computation Requirements

Energies ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 830
Author(s):  
Filipe F. C. Silva ◽  
Pedro M. S. Carvalho ◽  
Luís A. F. M. Ferreira
Keyword(s):  
Distributed Generation ◽  
Optimal Solution ◽  
Dynamic Reconfiguration ◽  
Scheduling Problem ◽  
Low Carbon ◽  
Distribution Grid ◽  
Medium Voltage ◽  
Classical Computing ◽  
The Impact ◽  
Distribution Grids

The dissemination of low-carbon technologies, such as urban photovoltaic distributed generation, imposes new challenges to the operation of distribution grids. Distributed generation may introduce significant net-load asymmetries between feeders in the course of the day, resulting in higher losses. The dynamic reconfiguration of the grid could mitigate daily losses and be used to minimize or defer the need for network reinforcement. Yet, dynamic reconfiguration has to be carried out in near real-time in order to make use of the most updated load and generation forecast, this way maximizing operational benefits. Given the need to quickly find and update reconfiguration decisions, the computational complexity of the underlying optimal scheduling problem is studied in this paper. The problem is formulated and the impact of sub-optimal solutions is illustrated using a real medium-voltage distribution grid operated under a heavy generation scenario. The complexity of the scheduling problem is discussed to conclude that its optimal solution is infeasible in practical terms if relying upon classical computing. Quantum computing is finally proposed as a way to handle this kind of problem in the future.

scholarly journals L-Shape propagated Array Configuration with Dynamic Reconfiguration Algorithm for Enhancing Energy Conversion Rate of Partial Shaded Photovoltaic Systems

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
A Srinivasan ◽  
S Devakirubakaran ◽  
B Meenakshi Sundaram ◽  
B Praveen Kumar ◽  
Ch Santhan Kumar ◽  
...  
Keyword(s):  
Energy Conversion ◽  
Conversion Rate ◽  
Dynamic Reconfiguration ◽  
Photovoltaic Systems ◽  
Array Configuration
Sign in / Sign up

Export Citation Format

Share Document