Saher Javaid
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Saher Javaid has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Yasuo Tan
Graduate School of Advanced Science and Technology, Japan Advanced Institute of Science and Technology, Nomi 923-1292, Ishikawa, Japan
17 shared publications - Yuto Lim
Graduate School of Advanced Science and Technology, Japan Advanced Institute of Science and Technology, Nomi 923-1292, Ishikawa, Japan
12 shared publications - Iacovos Ioannou
Department of Computer Science, Philips University, Nicosia, Cyprus
7 shared publications - Chalie Charoenlarpnopparut
School of Information, Computer, and Communication Technology (ICT), Sirindhorn International Institute of Technology, Thammasat University, Khlong Luang 12120, Pathum Thani, Thailand
5 shared publications - Mineo Kaneko
Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Nomi-shi, Ishikawa, 923-1292 JAPAN
5 shared publications - Ruengwit Khwanrit
School of Information Science, Japan Advanced Institute of Science and Technology, 1-1 Asahidai, Nomi 923-1292, Ishikawa, Japan
5 shared publications
Latest Publications
- Open Access
- 22 October 2026
- Published by MDPI AG in Information
- Vol. 17 (11) , 1056
Platonic Projection Structures-Based Information Dynamics (PPS-ID): Recursive Transformation of Observable Information
In recursive learning, model outputs can be reused in subsequent training, linking successive models through the reuse and transformation of observable information. Assessing these processes requires distinguishing changes in observable states from the preservation of task-relevant properties. We introduce PPS-Based Information Dynamics (PPS-ID), a framework connecting the observability perspective of Platonic Projection Structures with trajectory-based evaluation of repeated learning. PPS-ID separates latent-to-observable mappings from training-state transitions and evaluates observable discrepancies, task-dependent directional variation, and example-level correctness histories. Standard factorization conditions specify when the chosen observations admit a closed transition, while decision-margin conditions relate changes in prediction probabilities to preservation of classification decisions. Experiments with CIFAR-10 and sentiment classification using Bidirectional Encoder Representations from Transformers (BERT) illustrate three distinctions: local similarity can coexist with departure from an initial state; accuracy decline can coexist with lower expected calibration error and higher prediction entropy; and endpoint improvement can coexist with intermediate losses. In five-generation CIFAR-10 distillation across five seeds, fixed-teacher final accuracy exceeds recursive final accuracy by a mean of 1.542 percentage points under soft-only supervision. Mixing ground-truth and soft-target supervision reverses this ranking and raises mean recursive final accuracy from 70.672% to 73.910%. On the binary Stanford Sentiment Treebank task (SST-2) and IMDb, BERT experiments yield dataset- and seed-dependent endpoint rankings; first-generation branch differences limit causal attribution to teacher replacement. PPS-ID provides a common evaluation structure for examining how observable information changes and which task-relevant properties are preserved along a learning trajectory. The results show how supervision regime, reference choice, and intermediate variation affect the interpretation of repeated learning.
- 22 October 2026
- Published by MDPI AG in Information
- Vol. 17 (11) , 1056
Open AccessPlatonic Projection Structures-Based Information Dynamics (PPS-ID): Recursive Transformation of Observable Information
In recursive learning, model outputs can be reused in subsequent training, linking successive models through the reuse and transformation of observable information. Assessing these processes requires distinguishing changes in observable states from the preservation of task-relevant properties. We introduce PPS-Based Information Dynamics (PPS-ID), a framework connecting the observability perspective of Platonic Projection Structures with trajectory-based evaluation of repeated learning. PPS-ID separates latent-to-observable mappings from training-state transitions and evaluates observable discrepancies, task-dependent directional variation, and example-level correctness histories. Standard factorization conditions specify when the chosen observations admit a closed transition, while decision-margin conditions relate changes in prediction probabilities to preservation of classification decisions. Experiments with CIFAR-10 and sentiment classification using Bidirectional Encoder Representations from Transformers (BERT) illustrate three distinctions: local similarity can coexist with departure from an initial state; accuracy decline can coexist with lower expected calibration error and higher prediction entropy; and endpoint improvement can coexist with intermediate losses. In five-generation CIFAR-10 distillation across five seeds, fixed-teacher final accuracy exceeds recursive final accuracy by a mean of 1.542 percentage points under soft-only supervision. Mixing ground-truth and soft-target supervision reverses this ranking and raises mean recursive final accuracy from 70.672% to 73.910%. On the binary Stanford Sentiment Treebank task (SST-2) and IMDb, BERT experiments yield dataset- and seed-dependent endpoint rankings; first-generation branch differences limit causal attribution to teacher replacement. PPS-ID provides a common evaluation structure for examining how observable information changes and which task-relevant properties are preserved along a learning trajectory. The results show how supervision regime, reference choice, and intermediate variation affect the interpretation of repeated learning.
- Open Access
The Cognitive Power Mini-Grid with Distributed AI, Semantic Control and Agentic Autonomy: Concepts, Applications, Challenges and Future Directions
Power mini-grids are being transformed from locally automated electrical systems into cyber-physical ecosystems in which heterogeneous distributed energy resources, storage, converters, flexible demand and uncertain external conditions must be coordinated. Existing surveys commonly treat microgrid control, artificial intelligence (AI), multi-agent systems, communications, digital twins and cybersecurity as separate research streams. In this survey, the cognitive power mini-grid is introduced as a unifying paradigm in which physical and social contexts are perceived by distributed agents, task-relevant semantic information is exchanged, auditable coordination readiness is checked and proposed actions are subject to independent safety checks. A corpus of 247 scholarly publications, standards and technical sources is synthesized across microgrid engineering, distributed AI, semantic communication, language models, federated learning, neuro-symbolic AI, digital twins, causal reasoning, runtime assurance, cybersecurity and community energy markets. A six-layer architecture is proposed in which fast deterministic control is separated from semantic coordination, distributed learning, agentic deliberation and assurance. Representative studies are compared by problem, method, control horizon, information assumptions, validation environment, hardware-in-the-loop (HIL) status, reported outcome, limitations and architectural relevance. Applications are organized into balancing, resilience, demand-response, maintenance and inter-mini-grid markets. Cross-layer challenges are identified in stability under asynchronous interaction, semantic interoperability, hallucination, common-knowledge failure, edge resources, privacy and cyber-physical security constraints. A research agenda is developed around proof-carrying actions, causal digital twins, edge small language models, federated multimodal foundation models, neuromorphic semantic control and human-agent governance. Cognition is therefore positioned as a safety-gated coordination capability above verified physical control loops rather than as a replacement for established control.
Open AccessThe Cognitive Power Mini-Grid with Distributed AI, Semantic Control and Agentic Autonomy: Concepts, Applications, Challenges and Future Directions
Power mini-grids are being transformed from locally automated electrical systems into cyber-physical ecosystems in which heterogeneous distributed energy resources, storage, converters, flexible demand and uncertain external conditions must be coordinated. Existing surveys commonly treat microgrid control, artificial intelligence (AI), multi-agent systems, communications, digital twins and cybersecurity as separate research streams. In this survey, the cognitive power mini-grid is introduced as a unifying paradigm in which physical and social contexts are perceived by distributed agents, task-relevant semantic information is exchanged, auditable coordination readiness is checked and proposed actions are subject to independent safety checks. A corpus of 247 scholarly publications, standards and technical sources is synthesized across microgrid engineering, distributed AI, semantic communication, language models, federated learning, neuro-symbolic AI, digital twins, causal reasoning, runtime assurance, cybersecurity and community energy markets. A six-layer architecture is proposed in which fast deterministic control is separated from semantic coordination, distributed learning, agentic deliberation and assurance. Representative studies are compared by problem, method, control horizon, information assumptions, validation environment, hardware-in-the-loop (HIL) status, reported outcome, limitations and architectural relevance. Applications are organized into balancing, resilience, demand-response, maintenance and inter-mini-grid markets. Cross-layer challenges are identified in stability under asynchronous interaction, semantic interoperability, hallucination, common-knowledge failure, edge resources, privacy and cyber-physical security constraints. A research agenda is developed around proof-carrying actions, causal digital twins, edge small language models, federated multimodal foundation models, neuromorphic semantic control and human-agent governance. Cognition is therefore positioned as a safety-gated coordination capability above verified physical control loops rather than as a replacement for established control.
- Open Access
Coordinated State-of-Charge Balancing and Energy Management for a DC Microgrid Under Dynamic Renewable Conditions
This paper presents an energy-management and state-of-charge (SoC) balancing scheme, denoted OEMSS, for a DC microgrid comprising photovoltaic generation, a fuel-cell source, two energy storage systems (ESSs), and six household loads. A demand-driven power-allocation layer first determines whether generation is sufficient, ESS support is required, or priority-based load scheduling must be activated. A supervisory balancing layer then allocates the fleet charging or discharging request by using a capacity-weighted average SoC and separate mode-dependent correction laws. The balancing command is dimensionally expressed as an energy-capacity deviation divided by the control interval and is projected onto the SoC and power limits. A Python simulation driven by recorded generation profiles is used to evaluate four seasonal operating conditions. In the tested equal-capacity case, the maximum inter-ESS SoC deviation is reduced from 18% to 4.8%, synchronization is reached within approximately 2 to 4 h, and simulated over-discharge events are avoided. The reported increase from 45% to approximately 70% is interpreted as a 25-percentage-point increase in the ESS storage contribution rate, rather than an increase in conversion efficiency. During shortage intervals, the retained priority demand is supplied, whereas satisfaction of the original uncurtailed demand is not claimed. A discrete-time Lyapunov analysis gives the nominal convergence condition , and the online implementation has time complexity. The study provides simulation evidence for a simple coordinated allocation rule; hardware performance, battery-life extension, converter-level stability, and global optimality remain to be established.Open AccessCoordinated State-of-Charge Balancing and Energy Management for a DC Microgrid Under Dynamic Renewable Conditions
This paper presents an energy-management and state-of-charge (SoC) balancing scheme, denoted OEMSS, for a DC microgrid comprising photovoltaic generation, a fuel-cell source, two energy storage systems (ESSs), and six household loads. A demand-driven power-allocation layer first determines whether generation is sufficient, ESS support is required, or priority-based load scheduling must be activated. A supervisory balancing layer then allocates the fleet charging or discharging request by using a capacity-weighted average SoC and separate mode-dependent correction laws. The balancing command is dimensionally expressed as an energy-capacity deviation divided by the control interval and is projected onto the SoC and power limits. A Python simulation driven by recorded generation profiles is used to evaluate four seasonal operating conditions. In the tested equal-capacity case, the maximum inter-ESS SoC deviation is reduced from 18% to 4.8%, synchronization is reached within approximately 2 to 4 h, and simulated over-discharge events are avoided. The reported increase from 45% to approximately 70% is interpreted as a 25-percentage-point increase in the ESS storage contribution rate, rather than an increase in conversion efficiency. During shortage intervals, the retained priority demand is supplied, whereas satisfaction of the original uncurtailed demand is not claimed. A discrete-time Lyapunov analysis gives the nominal convergence condition , and the online implementation has time complexity. The study provides simulation evidence for a simple coordinated allocation rule; hardware performance, battery-life extension, converter-level stability, and global optimality remain to be established. - Open Access
Platonic Projection Structures: Operator-Induced Observability in Representation Learning
We characterize observability in representation learning through Platonic Projection Structures (PPS), an operator-theoretic framework for analyzing representation accessibility under partial observation. Rather than treating observable outputs as direct reflections of latent representations, PPS models observation as a geometry induced by a self-adjoint positive semidefinite operator acting on a latent Hilbert space. A system is represented as a triple where denotes a latent representation space, is an observation operator, and defines an induced scalar observable. The framework characterizes observability through the quotient geometry which represents equivalence classes of latent states that are indistinguishable under observation. From this perspective, observable behavior is governed not by latent representations themselves, but by the geometry induced through the observation operator. We show that both quantum measurement and representation inference under linear observation models can be formulated within this common operator-theoretic structure while differing in the algebraic properties of their observation operators. Within this perspective, quantum measurement serves primarily as a mathematically canonical example of projection-mediated observability. The correspondence developed in PPS is therefore structural rather than physical. Within the same framework, representation transfer and knowledge distillation can be interpreted as approximate preservation of observable geometry through the intertwining condition PPS further reveals a structural limitation of output-based interpretability: latent components contained in are fundamentally inaccessible from observables generated through the induced observation process. Accordingly, attribution and explanation methods inherit intrinsic constraints imposed by the observation geometry itself. We provide controlled empirical validations demonstrating kernel-invariant observability, projection-induced attribution gaps, and rank-controlled observable geometry in latent representation spaces. Overall, PPS provides a mathematically explicit characterization of observability through operator-induced quotient geometry, offering a unified perspective on representation accessibility, interpretability, and representation transfer.Open AccessPlatonic Projection Structures: Operator-Induced Observability in Representation Learning
We characterize observability in representation learning through Platonic Projection Structures (PPS), an operator-theoretic framework for analyzing representation accessibility under partial observation. Rather than treating observable outputs as direct reflections of latent representations, PPS models observation as a geometry induced by a self-adjoint positive semidefinite operator acting on a latent Hilbert space. A system is represented as a triple where denotes a latent representation space, is an observation operator, and defines an induced scalar observable. The framework characterizes observability through the quotient geometry which represents equivalence classes of latent states that are indistinguishable under observation. From this perspective, observable behavior is governed not by latent representations themselves, but by the geometry induced through the observation operator. We show that both quantum measurement and representation inference under linear observation models can be formulated within this common operator-theoretic structure while differing in the algebraic properties of their observation operators. Within this perspective, quantum measurement serves primarily as a mathematically canonical example of projection-mediated observability. The correspondence developed in PPS is therefore structural rather than physical. Within the same framework, representation transfer and knowledge distillation can be interpreted as approximate preservation of observable geometry through the intertwining condition PPS further reveals a structural limitation of output-based interpretability: latent components contained in are fundamentally inaccessible from observables generated through the induced observation process. Accordingly, attribution and explanation methods inherit intrinsic constraints imposed by the observation geometry itself. We provide controlled empirical validations demonstrating kernel-invariant observability, projection-induced attribution gaps, and rank-controlled observable geometry in latent representation spaces. Overall, PPS provides a mathematically explicit characterization of observability through operator-induced quotient geometry, offering a unified perspective on representation accessibility, interpretability, and representation transfer. - Open Access
PhysGTT: A Physics-Guided Self-Supervised Graph Temporal Transformer for Forecasting Electricity Inconsistencies in Mini-Grids
Electricity inconsistencies in mini-grids, stemming from meter drift, telemetry faults, topology misconfiguration, non-technical losses, phase imbalance or data manipulation, often emerge as weak, spatially distributed deviations that are difficult to anticipate, yet timely warning is important for future monitoring frameworks in rural electrification and island mini-grids. Existing approaches either apply post hoc threshold-based alarms to individual channels or employ deep learning models that treat metering points independently, ignoring the spatial coupling imposed by the electrical topology and lacking mechanisms to enforce physical feasibility under scarce labeled data. This paper introduces PhysGTT, a Physics-Guided Self-Supervised Graph Temporal Transformer that models the mini-grid as a topology-aware graph and combines a residual Graph Convolutional Network encoder with a temporal Transformer. PhysGTT employs self-supervised pretraining via masked multi-sensor reconstruction and contrastive regime alignment to exploit unlabeled operational data and incorporates gradient-coupled physics regularization through power-balance, voltage-bound and ramp-rate penalties applied to a learned reconstruction head, while producing constraint-level attributions that identify the dominant physical violation pattern for each forecast. PhysGTT is evaluated on a proxy benchmark derived from the UCI Individual Household Electric Power Consumption dataset and on the IEEE 13-node test feeder simulated in OpenDSS and it is compared under identical experimental protocols with eight baselines spanning recurrent, graph-temporal and unsupervised architectures. On the proxy benchmark, PhysGTT achieves an AUC-ROC of 0.8959, an F1-score of 0.8307 and a False Alarm Rate of 0.41%, improving the F1-score by 2.2% relative to the strongest recurrent baseline (GRU) and by up to 15.2% relative to the LSTM baseline, while reducing the False Alarm Rate by approximately 52% relative to the LSTM baseline. On the IEEE 13-node feeder, PhysGTT attains an AUC-ROC of 0.9016 and an F1-score of 0.8361. These results indicate that integrating topology-aware encoding, self-supervised pretraining and physics-guided learning provides a promising and interpretable framework for proactive inconsistency forecasting under synthetic and feeder-simulation benchmarks, although field validation on naturally occurring faults remains necessary.
Open AccessPhysGTT: A Physics-Guided Self-Supervised Graph Temporal Transformer for Forecasting Electricity Inconsistencies in Mini-Grids
Electricity inconsistencies in mini-grids, stemming from meter drift, telemetry faults, topology misconfiguration, non-technical losses, phase imbalance or data manipulation, often emerge as weak, spatially distributed deviations that are difficult to anticipate, yet timely warning is important for future monitoring frameworks in rural electrification and island mini-grids. Existing approaches either apply post hoc threshold-based alarms to individual channels or employ deep learning models that treat metering points independently, ignoring the spatial coupling imposed by the electrical topology and lacking mechanisms to enforce physical feasibility under scarce labeled data. This paper introduces PhysGTT, a Physics-Guided Self-Supervised Graph Temporal Transformer that models the mini-grid as a topology-aware graph and combines a residual Graph Convolutional Network encoder with a temporal Transformer. PhysGTT employs self-supervised pretraining via masked multi-sensor reconstruction and contrastive regime alignment to exploit unlabeled operational data and incorporates gradient-coupled physics regularization through power-balance, voltage-bound and ramp-rate penalties applied to a learned reconstruction head, while producing constraint-level attributions that identify the dominant physical violation pattern for each forecast. PhysGTT is evaluated on a proxy benchmark derived from the UCI Individual Household Electric Power Consumption dataset and on the IEEE 13-node test feeder simulated in OpenDSS and it is compared under identical experimental protocols with eight baselines spanning recurrent, graph-temporal and unsupervised architectures. On the proxy benchmark, PhysGTT achieves an AUC-ROC of 0.8959, an F1-score of 0.8307 and a False Alarm Rate of 0.41%, improving the F1-score by 2.2% relative to the strongest recurrent baseline (GRU) and by up to 15.2% relative to the LSTM baseline, while reducing the False Alarm Rate by approximately 52% relative to the LSTM baseline. On the IEEE 13-node feeder, PhysGTT attains an AUC-ROC of 0.9016 and an F1-score of 0.8361. These results indicate that integrating topology-aware encoding, self-supervised pretraining and physics-guided learning provides a promising and interpretable framework for proactive inconsistency forecasting under synthetic and feeder-simulation benchmarks, although field validation on naturally occurring faults remains necessary.
- Open Access
- 23 December 2025
- Published by MDPI AG in Electronics
- Vol. 15 (1) , 61
A Hierarchical Predictive-Adaptive Control Framework for State-of-Charge Balancing in Mini-Grids Using Deep Reinforcement Learning
State-of-charge (SoC) balancing across multiple battery energy storage systems (BESS) is a central challenge in renewable-rich mini-grids. Heterogeneous battery capacities, differing states of health, stochastic renewable generation, and variable loads create a high-dimensional uncertain control problem. Conventional droop-based SoC balancing strategies are decentralized and computationally light but fundamentally reactive and limited, whereas model predictive control (MPC) is insightful but computationally intensive and prone to modeling errors. This paper proposes a Hierarchical Predictive–Adaptive Control (HPAC) framework for SoC balancing in mini-grids using deep reinforcement learning. The framework consists of two synergistic layers operating on different time scales. A long-horizon Predictive Engine, implemented as a federated Transformer network, provides multi-horizon probabilistic forecasts of net load, enabling multiple mini-grids to collaboratively train a high-capacity model without sharing raw data. A fast-timescale Adaptive Controller, implemented as a Soft Actor-Critic (SAC) agent, uses these forecasts to make real-time charge/discharge decisions for each BESS unit. The forecasts are used both to augment the agent’s state representation and to dynamically shape a multi-objective reward function that balances SoC, economic performance, degradation-aware operation, and voltage stability. The paper formulates SoC balancing as a Markov decision process, details the SAC-based control architecture, and presents a comprehensive evaluation using a MATLAB-(R2025a)-based digital-twin simulation environment. A rigorous benchmarking study compares HPAC against fourteen representative controllers spanning rule-based, MPC, and various DRL paradigms. Sensitivity analysis on reward weight selection and ablation studies isolating the contributions of forecasting and dynamic reward shaping are conducted. Stress-test scenarios, including high-volatility net-load conditions and communication impairments, demonstrate the robustness of the approach. Results show that HPAC achieves near-minimal operating cost with essentially zero SoC variance and the lowest voltage variance among all compared controllers, while maintaining moderate energy throughput that implicitly preserves battery lifetime. Finally, the paper discusses a pathway from simulation to hardware-in-the-loop testing and a cloud-edge deployment architecture for practical, real-time deployment in real-world mini-grids.
- 23 December 2025
- Published by MDPI AG in Electronics
- Vol. 15 (1) , 61
Open AccessA Hierarchical Predictive-Adaptive Control Framework for State-of-Charge Balancing in Mini-Grids Using Deep Reinforcement Learning
State-of-charge (SoC) balancing across multiple battery energy storage systems (BESS) is a central challenge in renewable-rich mini-grids. Heterogeneous battery capacities, differing states of health, stochastic renewable generation, and variable loads create a high-dimensional uncertain control problem. Conventional droop-based SoC balancing strategies are decentralized and computationally light but fundamentally reactive and limited, whereas model predictive control (MPC) is insightful but computationally intensive and prone to modeling errors. This paper proposes a Hierarchical Predictive–Adaptive Control (HPAC) framework for SoC balancing in mini-grids using deep reinforcement learning. The framework consists of two synergistic layers operating on different time scales. A long-horizon Predictive Engine, implemented as a federated Transformer network, provides multi-horizon probabilistic forecasts of net load, enabling multiple mini-grids to collaboratively train a high-capacity model without sharing raw data. A fast-timescale Adaptive Controller, implemented as a Soft Actor-Critic (SAC) agent, uses these forecasts to make real-time charge/discharge decisions for each BESS unit. The forecasts are used both to augment the agent’s state representation and to dynamically shape a multi-objective reward function that balances SoC, economic performance, degradation-aware operation, and voltage stability. The paper formulates SoC balancing as a Markov decision process, details the SAC-based control architecture, and presents a comprehensive evaluation using a MATLAB-(R2025a)-based digital-twin simulation environment. A rigorous benchmarking study compares HPAC against fourteen representative controllers spanning rule-based, MPC, and various DRL paradigms. Sensitivity analysis on reward weight selection and ablation studies isolating the contributions of forecasting and dynamic reward shaping are conducted. Stress-test scenarios, including high-volatility net-load conditions and communication impairments, demonstrate the robustness of the approach. Results show that HPAC achieves near-minimal operating cost with essentially zero SoC variance and the lowest voltage variance among all compared controllers, while maintaining moderate energy throughput that implicitly preserves battery lifetime. Finally, the paper discusses a pathway from simulation to hardware-in-the-loop testing and a cloud-edge deployment architecture for practical, real-time deployment in real-world mini-grids.
- Open Access
Mitigating Energy Losses Under Incremental Load Variations in Distributed Power-Flow Systems While Ensuring User Comfort
Renewable energy sources (RESs) such as photovoltaic (PV) and fuel cells (FCs) introduce variability that complicates reliable, loss-aware operation of distributed power-flow systems (DPFSs) in smart homes. Frequent charge/discharge cycling of energy storage systems (ESSs) can inflate losses and jeopardize user comfort when generation and demand are mismatched. This paper addresses the gap in multi-load, multi-source coordination under fluctuating RESs by proposing a Multiple-Load Power-Flow Assignment (MPFA) framework that explicitly minimizes storage-related losses while maintaining demand satisfaction. We evaluate four logical interconnection scenarios among generators (PGs), loads (PLs), and storage (PSs), and compare three control algorithms—total-demand-based (TDPF), adaptive-demand-based (ADPF), and grid-based (GBPF). Using measured PV/FC data across seasons, MPFA consistently reduces storage-related losses as interconnections increase, with GBPF guaranteeing full daily demand satisfaction by flexibly supplementing local generation with grid power. ADPF performs strongly when grid support is limited by prioritizing critical loads and optimizing storage utilization. The results provide actionable guidance for designing smart-home energy management that emphasizes sustainability, reliability, and user comfort.
Open AccessMitigating Energy Losses Under Incremental Load Variations in Distributed Power-Flow Systems While Ensuring User Comfort
Renewable energy sources (RESs) such as photovoltaic (PV) and fuel cells (FCs) introduce variability that complicates reliable, loss-aware operation of distributed power-flow systems (DPFSs) in smart homes. Frequent charge/discharge cycling of energy storage systems (ESSs) can inflate losses and jeopardize user comfort when generation and demand are mismatched. This paper addresses the gap in multi-load, multi-source coordination under fluctuating RESs by proposing a Multiple-Load Power-Flow Assignment (MPFA) framework that explicitly minimizes storage-related losses while maintaining demand satisfaction. We evaluate four logical interconnection scenarios among generators (PGs), loads (PLs), and storage (PSs), and compare three control algorithms—total-demand-based (TDPF), adaptive-demand-based (ADPF), and grid-based (GBPF). Using measured PV/FC data across seasons, MPFA consistently reduces storage-related losses as interconnections increase, with GBPF guaranteeing full daily demand satisfaction by flexibly supplementing local generation with grid power. ADPF performs strongly when grid support is limited by prioritizing critical loads and optimizing storage utilization. The results provide actionable guidance for designing smart-home energy management that emphasizes sustainability, reliability, and user comfort.
- Open Access
- 3 July 2025
- Published by MDPI AG in Electronics
- Vol. 14 (13) , 2691
Autonomous Reinforcement Learning for Intelligent and Sustainable Autonomous Microgrid Energy Management
Effective energy management in microgrids is essential for integrating renewable energy sources and maintaining operational stability. Machine learning (ML) techniques offer significant potential for optimizing microgrid performance. This study provides a comprehensive comparative performance evaluation of four ML-based control strategies: deep Q-networks (DQNs), proximal policy optimization (PPO), Q-learning, and advantage actor–critic (A2C). These strategies were rigorously tested using simulation data from a representative islanded microgrid model, with metrics evaluated across diverse seasonal conditions (autumn, spring, summer, winter). Key performance indicators included overall episodic reward, unmet load, excess generation, energy storage system (ESS) state-of-charge (SoC) imbalance, ESS utilization, and computational runtime. Results from the simulation indicate that the DQN-based agent consistently achieved superior performance across all evaluated seasons, effectively balancing economic rewards, reliability, and battery health while maintaining competitive computational runtimes. Specifically, DQN delivered near-optimal rewards by significantly reducing unmet load, minimizing excess renewable energy curtailment, and virtually eliminating ESS SoC imbalance, thereby prolonging battery life. Although the tabular Q-learning method showed the lowest computational latency, it was constrained by limited adaptability in more complex scenarios. PPO and A2C, while offering robust performance, incurred higher computational costs without additional performance advantages over DQN. This evaluation clearly demonstrates the capability and adaptability of the DQN approach for intelligent and autonomous microgrid management, providing valuable insights into the relative advantages and limitations of various ML strategies in complex energy management scenarios.
- 3 July 2025
- Published by MDPI AG in Electronics
- Vol. 14 (13) , 2691
Open AccessAutonomous Reinforcement Learning for Intelligent and Sustainable Autonomous Microgrid Energy Management
Effective energy management in microgrids is essential for integrating renewable energy sources and maintaining operational stability. Machine learning (ML) techniques offer significant potential for optimizing microgrid performance. This study provides a comprehensive comparative performance evaluation of four ML-based control strategies: deep Q-networks (DQNs), proximal policy optimization (PPO), Q-learning, and advantage actor–critic (A2C). These strategies were rigorously tested using simulation data from a representative islanded microgrid model, with metrics evaluated across diverse seasonal conditions (autumn, spring, summer, winter). Key performance indicators included overall episodic reward, unmet load, excess generation, energy storage system (ESS) state-of-charge (SoC) imbalance, ESS utilization, and computational runtime. Results from the simulation indicate that the DQN-based agent consistently achieved superior performance across all evaluated seasons, effectively balancing economic rewards, reliability, and battery health while maintaining competitive computational runtimes. Specifically, DQN delivered near-optimal rewards by significantly reducing unmet load, minimizing excess renewable energy curtailment, and virtually eliminating ESS SoC imbalance, thereby prolonging battery life. Although the tabular Q-learning method showed the lowest computational latency, it was constrained by limited adaptability in more complex scenarios. PPO and A2C, while offering robust performance, incurred higher computational costs without additional performance advantages over DQN. This evaluation clearly demonstrates the capability and adaptability of the DQN approach for intelligent and autonomous microgrid management, providing valuable insights into the relative advantages and limitations of various ML strategies in complex energy management scenarios.
- Open Access
- 16 June 2025
- Published by MDPI AG in Preprints.org
Autonomous Reinforcement Learning for Intelligent and Sustainable Autonomous Microgrid Energy Management
Effective energy management in microgrids is essential for integrating renewable energy sources and maintaining operational stability. Machine learning (ML) techniques offer significant potential for optimizing microgrid performance. This study provides a comprehensive comparative performance evaluation of four ML-based control strategies: Deep Q-Networks (DQN), Proximal Policy Optimization (PPO), Q-Learning, and Advantage Actor-Critic (A2C). These strategies were rigorously tested using simulation data from a representative islanded microgrid model, with metrics evaluated across diverse seasonal conditions (Autumn, Spring, Summer, Winter). Key performance indicators included overall episodic reward, unmet load, excess generation, energy storage system (ESS) state-of-charge (SoC) imbalance, ESS utilization, and computational runtime. Results from the simulation indicate that the DQN-based agent consistently achieved superior performance across all evaluated seasons, effectively balancing economic rewards, reliability, and battery health while maintaining competitive computational runtimes. Specifically, DQN delivered near-optimal rewards by significantly reducing unmet load, minimizing excess renewable energy curtailment, and virtually eliminating ESS SoC imbalance, thereby prolonging battery life. Although the tabular Q-Learning method showed the lowest computational latency, it was constrained by limited adaptability in more complex scenarios. PPO and A2C, while offering robust performance, incurred higher computational costs without additional performance advantages over DQN. This evaluation clearly demonstrates the capability and adaptability of the DQN approach for intelligent and autonomous microgrid management, providing valuable insights into the relative advantages and limitations of various ML strategies in complex energy management scenarios.
- 16 June 2025
- Published by MDPI AG in Preprints.org
Open AccessAutonomous Reinforcement Learning for Intelligent and Sustainable Autonomous Microgrid Energy Management
Effective energy management in microgrids is essential for integrating renewable energy sources and maintaining operational stability. Machine learning (ML) techniques offer significant potential for optimizing microgrid performance. This study provides a comprehensive comparative performance evaluation of four ML-based control strategies: Deep Q-Networks (DQN), Proximal Policy Optimization (PPO), Q-Learning, and Advantage Actor-Critic (A2C). These strategies were rigorously tested using simulation data from a representative islanded microgrid model, with metrics evaluated across diverse seasonal conditions (Autumn, Spring, Summer, Winter). Key performance indicators included overall episodic reward, unmet load, excess generation, energy storage system (ESS) state-of-charge (SoC) imbalance, ESS utilization, and computational runtime. Results from the simulation indicate that the DQN-based agent consistently achieved superior performance across all evaluated seasons, effectively balancing economic rewards, reliability, and battery health while maintaining competitive computational runtimes. Specifically, DQN delivered near-optimal rewards by significantly reducing unmet load, minimizing excess renewable energy curtailment, and virtually eliminating ESS SoC imbalance, thereby prolonging battery life. Although the tabular Q-Learning method showed the lowest computational latency, it was constrained by limited adaptability in more complex scenarios. PPO and A2C, while offering robust performance, incurred higher computational costs without additional performance advantages over DQN. This evaluation clearly demonstrates the capability and adaptability of the DQN approach for intelligent and autonomous microgrid management, providing valuable insights into the relative advantages and limitations of various ML strategies in complex energy management scenarios.
- 27 March 2025
- Published by Springer Nature
- p. 307-313
Optimal Storage Design of Distributed Power Flow System Considering Incremental Power Load
- 27 March 2025
- Published by Springer Nature
- p. 307-313
Optimal Storage Design of Distributed Power Flow System Considering Incremental Power Load