A Tool-Augmented Agentic AI Pipeline for Reliable Circuit-Analysis Tutoring with Local Language Models
Abstract
1. Introduction
Research Questions and Contributions
- RQ1—Architecture-Level Response Quality: How do students evaluate the responses produced by the Pure LLM, RAG and Agentic AI systems, both overall and across the following dimensions: Perceived Correctness, Clarity, Learning Value, Relevance and Style?
- RQ2—Prompt-Type Dependence: How does response quality vary when comparing conceptual prompts to circuit-based questions that require structured technical information?
- RQ3—Local Versus Commercial Reference: What is the response quality difference between the proposed local systems and a more powerful top-tier commercial model?
- We propose a local Agentic AI architecture conceived for tutoring tasks in engineering education, instantiated and assessed in the electrical-circuit-analysis domain. The architecture is leveraged by a Local LLMs and integrates the automatic retrieval of pedagogical documentation curated by experts, deterministic modules for solving electrical circuits using different methods, enhanced visual layers for facilitating the analysis comprehension, and the production of pedagogically structured artefacts.
- We propose a tutoring workflow centred in verifiable artefacts. Unlike a standard chatbot, the system goes far beyond text generation based on parametric model knowledge, general-purpose theory document retrieval, and/or reasoning supported by on-the-fly Python code. Instead, the system’s final response is conditioned by verifiable intermediate results built by deterministic electrical circuit solvers, according to an elaborated graph.
- We define a controlled comparison protocol between three modes of LLM-based system operation: System A—Pure LLM; System B—RAG; System C—Agentic AI. These conditions are tested for two reference Local LLMs. We also conducted a comparison with a top-tier commercial model to better frame the systems’ qualities.
- We conducted a blind evaluation involving 135 students, covering 5 prompts and 7 generation configurations, establishing a total of 35 distinct responses. The responses assessment considers the Perceived Correctness, Clarity, Learning Value, Relevance and Style, comparing the different architectures globally, per dimension and between (merely textual) prompts, covering theoretical circuit-analysis topics and circuit-dependent prompts.
- We present a complementary technical evaluation based on the 72 local responses produced for the original 12-question battery. This analysis allows us to compare the Perceived Correctness assessments conducted by the students with the Technical Correctness assessments, and examine the task types where the circuit-determinist-processed evidence adds value when compared to RAG.
- We present an in-depth statistical analysis per prompt type, distinguishing conceptual from procedural tasks. This helped to examine the task’s performance dependency, and to assess the adequacy of the different systems.
2. Background and Related Work
2.1. LLMs and RAG in Engineering Education
2.2. Local Models and Sustainability
2.3. Previous Work on Circuit Analysis
2.4. Tool-Augmented and Agentic AI Systems
3. Materials and Methods
3.1. LLM-Based System Architectures
3.2. Experimental Conditions and Response Generation
3.3. HALO Agentic AI Pipeline
- The deterministic (symbolic) component is responsible for the formalization, normalisation, circuit solving and evidence production;
- The LLM-based (connectionist) component is used as a linguistic mediator, routing mechanism, response composer and, when applicable, assisting with the preprocessing of ambiguous or incomplete inputs.
- Routing: evaluating the user question and selecting the most appropriate path through the pipeline, i.e., determining which modules should be activated and in what sequence.
- Experimental flows: supporting the comparison of different response-generation systems, namely:
- Pure LLM: using solely the LLM’s parametric knowledge;
- RAG: augmenting the LLM’s parametric knowledge with information retrieved from a human-curated pedagogical dataset.
- Agentic AI: combining deterministic and AI-based modules through an orchestrated process.
- LLM composer: generating the final response.
- Linguistic and tutorial line: corresponds to the student question and it is used to identify the scope of the tutorial response and guide the activation of evidence-generation nodes.
- Circuit representation line: This corresponds to the circuit data associated with the query, when applicable. The pipeline currently supports the circuit representations considered appropriate for the scope of this study, which are converted, when necessary, into a common structured representations compatible with the deterministic processing components:
- Netlist provided as inline text or as a file;
- JavaScript Object Notation (JSON) representation of the circuit, compatible with the U=RIsolve Editor;
- Quite Universal Circuit Simulator (QUCS) schematic file, which is automatically converted into a valid JSON representation.
Furthermore, previously used circuit data can be reused as input and can also be automatically produced by the pipeline itself using the iGen module. Regardless of the initial input modality, the pipeline ultimately operates on a common structured circuit representation. Thus, future modalities, such as handwritten circuit diagrams, can be supported by introducing an appropriate translation module before the processing chain.
- Question with no circuit data: a question with no circuit data available (not even by inference), usually related to theoretical/conceptual aspects.
- Question with circuit data: a question accompanied with the circuit data model, in one of the following forms:
- –
- Generic netlist description: for example, a netlist written by the student (it can be incomplete—in this case, the system will try to repair it).
- –
- Netlist file: a formal netlist file generated by a software (e.g., as used in QUCS).
- –
- Schematic file: a file with a visual representation of the circuit. The pipeline accepts a QUCS schematic file or a U=RIsolve Editor JSON file.
- –
- Pedagogical document: a Markdown file containing pedagogical data from the circuit. Some systems can use it for RAG to complement LLM context.
- Fundamental variables: counts of branches, nodes, and current sources.
- Loop analysis: the counting of loops used in the analysis and its identification.
- Equation system: the equation system used to solve the circuit and all steps of the symbolic solution (using the variable names present in the circuit).
- Loop currents: the numerical values for each loop current.
- Branch currents arbitration: the information regarding the branch currents direction.
- Branch currents computation: the establishment of the equations for compute the branch currents based on the loop currents values and directions.
- Solution tips: various interpretation tips on different stages of the solution.
3.4. Prompt Set and Tutoring Task Categories
- Generic prompts—questions addressing abstract circuit aspects through textual descriptions, without supplying an explicit circuit netlist.
- Circuit-specific prompts—questions concerning a specific circuit represented by an explicit netlist.
3.5. Student-Based Evaluation (Blind Study)
3.6. Evaluation Metrics
3.7. Statistical Analysis
4. Performance Evaluation
4.1. Overall Comparative Performance
4.2. Dimension-Level Comparison Between Architectures
4.3. Effect of Prompt Type
4.4. Selection of the Students’ Highest-Rated Local Configuration
4.5. Comparison with GPT-5.5 Instant
4.6. Complementary Criterion-Based Technical Evaluation
4.6.1. Overall Architecture Profiles
4.6.2. Consistency of the Pattern Across Base Models
4.6.3. Effect of Question Type
4.6.4. Relationship with the Student Evaluation
4.6.5. Architectural Interpretation and Study Limitations
4.7. Final Considerations
5. Conclusions
Author Contributions
Funding
Institutional Review Board Statement
Informed Consent Statement
Data Availability Statement
Acknowledgments
Conflicts of Interest
Abbreviations
| ISEP | Instituto Superior de Engenharia do Porto |
| FEUP | Faculdade de Engenharia da Universidade do Porto |
| LLM | Large Language Model |
| AI | Artificial Intelligence |
| NLP | Natural Language Processing |
| RAG | Retrieval-Augmented Generation |
| GPT | Generative Pre-trained Transformer |
| STEM | Science, Technology, Engineering, and Mathematics |
| VRAM | Video Random Access Memory |
| SOTA | State-of-the-Art |
| API | Application Programming Interface |
| DC | Direct Current |
| AC | Alternating Current |
| ECE | Electrical and Computer Engineering |
| EE | Electrical Engineering |
| KVL | Kirchhoff’s Voltage Law |
| LCM | Loop Current Method |
| NVM | Node Voltage Method |
| BCM | Branch Current Method |
| SI | International System of Units |
| MoE | Mixture of Experts |
| PMB | Pedagogical Markdown Builder |
| KG | Knowledge Graph |
| SPSS | Statistical Package for the Social Sciences |
| LoRA | Low-Rank Adaptation |
| QLoRA | Quantized Low-Rank Adaptation |
| GPU | Graphics Processing Unit |
| MaaS | Model-as-a-Service |
| URL | Uniform Resource Locator |
| RQ | Research Question |
| QUCS | Quite Universal Circuit Simulator |
| SPICE | Simulation Program with Integrated Circuit Emphasis |
| JSON | JavaScript Object Notation |
| TC | Technical Correctness |
Appendix A. HALO Agentic AI Composer Prompt
{You are} HALO Agentic AI. Answer as a rigorous but student-friendly circuit-analysis tutor. Use only the supplied compact evidence packand visual references.
# HALO Agentic LLM Composer Prompt
## System roleYou are HALO Agentic AI, a pedagogical circuit-analysis assistant.Produce a clear, student-friendly answer grounded only in the evidence pack below.
## Non-negotiable constraints
- -
Answer only from deterministic facts, selected sections and visual references in this context pack.- -
Do not invent circuit values, equations, currents, branches, loops or assets.- -
Explain negative currents as direction/reference-direction information, not as automatic errors.- -
Distinguish fictitious loop currents from physical branch currents.- -
Reference only available artefacts, theory datasets, PMB sections or visual assets by real label/path; do not invent URLs or document names.- -
Define LCM symbols such as B, N, C, Ma and Mp before using their formulas.- -
Keep the answer concise enough for a tutoring turn; cite real theory/artefact labels or paths only when they are present.- -
Do not merely list evidence. Synthesize it into a clear explanation with the essential numeric facts.- -
When available, include B, N, C, Ma, Mp, the equation count, loop-current results and branch-current results.- -
When using B, N, C, Ma or Mp, define the symbol before using the formula.- -
Prefer a student-facing shape: short answer, setup, key results, sign interpretation, and what to inspect next.- -
If evidence is insufficient, say what is missing and point to the relevant artefact instead of guessing.
## Student question<student_question>
## Knowledge guidance<knowledge_guidance_items>
Each knowledge-guidance item may include:
- -
intent;- -
description;- -
prerequisites;- -
likely misconceptions;- -
recovery hints.
## Deterministic facts```json<compact_deterministic_facts>```
## LCM symbol glossary<lcm_symbol_glossary>
Examples:
- -
B: number of branches.- -
N: number of principal nodes.- -
C: number of ideal current sources.- -
Ma: number of auxiliary loops.- -
Mp: number of principal loops.
## Solver evidence<selected_solver_sections>
This section may include:
- -
validation status;- -
normalized netlist;- -
LCM counts;- -
KVL equation count;- -
loop-current results;- -
branch-current results;- -
solver warnings.
## Official course theory sections<selected_theory_sections>
## Selected PMB sections<selected_pedagogical_markdown_sections>
## Visual references<available_visual_references>
Each visual reference must correspond to an existing generated artefact.The model must not invent image names, file paths, URLs or links.
## Required outputReturn Markdown only. Use a student-facing structure appropriate to the question type.
Do not change or invent facts: use only claims supported by the supplied context.
Use this structure when useful:
- 1.
Short answer to the student question.- 2.
Reasoning grounded in the supplied context.- 3.
Symbols, results or references only when they are actually present.
Appendix B. Prompts and Questionnaire Organisation
| Prompt Code | Prompt Type | Prompt Statement |
|---|---|---|
| Q1 | Generic prompt | In a circuit with 3 nodes, 5 branches and 1 ideal current source, using the Loop Current Method, determine: (1) the total number of independent loops; (2) the number of auxiliary loops; (3) the number of main loops; and (4) the minimum number of KVL equations to be written. Explain your reasoning. |
| Q2 | Generic prompt | Consider a circuit with two nodes, consisting of one ideal current source in parallel with four resistors R1, R2, R3 and R4. According to the Loop Current Method described in the course, determine: (1) how many independent loops exist; (2) how many auxiliary loops should be selected; (3) how many main loops remain; and (4) how many KVL equations should be written. |
| Q3 | Circuit-specific prompt | There are several possible loops in this circuit. Explain the difference between: (1) possible loops; (2) independent loops; (3) auxiliary loops; and (4) main loops. Why is a KVL equation not written for all possible loops? The prompt included a circuit netlist. |
| Q4 | Circuit-specific prompt | In this circuit, identify a valid choice of auxiliary loop. Explain why this loop is auxiliary and why its current is no longer an unknown. The prompt included a circuit netlist. |
| Q5 | Circuit-specific prompt | Explain the solution of this circuit using the Loop Current Method described in the course, identifying: (1) the auxiliary loops; (2) the main loops; (3) which loop currents are already known due to current sources; (4) how many KVL equations must be written; and (5) how to obtain the real branch currents from the loop currents. The prompt included a circuit netlist. |
| Configuration | Base Model | Architecture/System | Configuration Label |
|---|---|---|---|
| C1 | GPT-OSS-20b | Pure LLM | GPT-OSS-20b–Pure LLM |
| C2 | GPT-OSS-20b | RAG | GPT-OSS-20b–RAG |
| C3 | GPT-OSS-20b | Agentic AI | GPT-OSS-20b–Agentic AI |
| C4 | Llama 3.3-70B | Pure LLM | Llama 3.3-70B–Pure LLM |
| C5 | Llama 3.3-70B | RAG | Llama 3.3-70B–RAG |
| C6 | Llama 3.3-70B | Agentic AI | Llama 3.3-70B–Agentic AI |
| C7 | ChatGPT | External commercial reference | ChatGPT external |
| Form | Number of Students | Number of Responses Evaluated Per Student |
|---|---|---|
| Form 1 | 26 | 7 |
| Form 2 | 25 | 7 |
| Form 3 | 25 | 7 |
| Form 4 | 29 | 7 |
| Form 5 | 30 | 7 |
| Total | 135 | — |
Appendix C. Questions Used in the Complementary Technical Evaluation
| Original | English translation |
| Q01: | Q01: |
| Num circuito conexo com B ramos, N nós e C fontes ideais de corrente, usando o Método das Correntes nas Malhas descrito na disciplina, indique: (1) o número total de malhas independentes; (2) o número de malhas auxiliares; (3) o número de malhas principais; (4) o número mínimo de equações KVL a escrever. Explique também porque a corrente de uma malha auxiliar deixa de ser uma incógnita. | In a connected circuit with B branches, N nodes and C ideal current sources, using the Loop Current Method described in the course, state: (1) the total number of independent loops; (2) the number of auxiliary loops; (3) the number of main loops; (4) the minimum number of KVL equations to be written. Also explain why the current of an auxiliary loop is no longer an unknown. |
| Q02: | Q02: |
| Num circuito com 3 nós, 5 ramos e 1 fonte ideal de corrente, utilizando o Método das Correntes nas Malhas, determine: (1) o número total de malhas independentes; (2) o número de malhas auxiliares; (3) o número de malhas principais; e (4) o número mínimo de equações KVL a escrever. Explique o seu raciocínio. | In a circuit with 3 nodes, 5 branches and 1 ideal current source, using the Loop Current Method, determine: (1) the total number of independent loops; (2) the number of auxiliary loops; (3) the number of main loops; and (4) the minimum number of KVL equations to be written. Explain your reasoning. |
| Q03: | Q03: |
| Considere um circuito com dois nós, constituído por uma fonte ideal de corrente em paralelo com quatro resistências R1, R2, R3 e R4. De acordo com o Método das Correntes nas Malhas descrito na disciplina, determine: (1) quantas malhas independentes existem; (2) quantas malhas auxiliares devem ser selecionadas; (3) quantas malhas principais restam; e (4) quantas equações KVL devem ser escritas. | Consider a circuit with two nodes, consisting of one ideal current source in parallel with four resistors R1, R2, R3 and R4. According to the Loop Current Method described in the course, determine: (1) how many independent loops exist; (2) how many auxiliary loops should be selected; (3) how many main loops remain; and (4) how many KVL equations should be written. |
| Q04: | Q04: |
| Neste circuito, indique: 1. o número de nós elétricos; 2. o número de ramos; 3. o número total de malhas independentes; 4. o número de fontes ideais de corrente; 5. o número de malhas auxiliares; 6. o número de malhas principais; 7. o número mínimo de equações KVL a escrever. Explique o raciocínio. | In this circuit, state: 1. the number of electrical nodes; 2. the number of branches; 3. the total number of independent loops; 4. the number of ideal current sources; 5. the number of auxiliary loops; 6. the number of main loops; 7. the minimum number of KVL equations to be written. Explain your reasoning. |
| Q05: | Q05: |
| Existem várias malhas possíveis neste circuito. Explique a diferença entre: (1) malhas possíveis; (2) malhas independentes; (3) malhas auxiliares; (4) malhas principais. Porque não se escreve uma equação KVL para todas as malhas possíveis? O prompt incluía uma netlist do circuito. | There are several possible loops in this circuit. Explain the difference between: (1) possible loops; (2) independent loops; (3) auxiliary loops; and (4) main loops. Why is a KVL equation not written for all possible loops? The prompt included a circuit netlist. |
| Q06: | Q06: |
| Neste circuito, identifique uma escolha válida de malha auxiliar. Explique porque esta malha é auxiliar e porque a sua corrente deixa de ser uma incógnita. O prompt incluía uma netlist do circuito. | In this circuit, identify a valid choice of auxiliary loop. Explain why this loop is auxiliary and why its current is no longer an unknown. The prompt included a circuit netlist. |
| Q07: | Q07: |
| Considere um circuito constituído por 1 fonte de corrente If1, em paralelo com 3 resistências, R1, R2, R3 e um último ramo constituído pela série da fonte de tensão V1 e uma resistência R4. A fonte de corrente If1 encontra-se no extremo esquerdo, com a corrente a circular do nó A, em baixo, para o nó B, em cima. Considere que a polaridade da fonte V1 tem o polo negativo voltado para R4 e o polo positivo voltado para o nó B. Se formarmos uma malha nos dois ramos mais à direita, R3 em paralelo com a série de V1 e R4, com sentido de circulação de A para B quando observado no ramo de R3, como fica a equação KVL dessa malha (Im1)? | Consider a circuit consisting of 1 current source If1 in parallel with 3 resistors, R1, R2, R3, and a final branch consisting of the series combination of voltage source V1 and resistor R4. The current source If1 is located at the far left, with the current flowing from node A, at the bottom, to node B, at the top. Consider that voltage source V1 has its negative terminal facing R4 and its positive terminal facing node B. If we form a loop using the two rightmost branches, with R3 in parallel with the series combination of V1 and R4, and with a direction of circulation from A to B when viewed along the R3 branch, what is the KVL equation for this loop (Im1)? |
| Nota: considere que em R3 passa também a corrente da malha Im2 com o mesmo sentido da malha que estamos a analisar. | Note: Consider that the current of loop Im2 also flows through R3 in the same direction as the loop being analysed. |
| Q08: | Q08: |
| Considere um circuito constituído por 1 fonte de corrente If1, em paralelo com 3 resistências, R1, R2, R3 e um último ramo constituído pela série da fonte de tensão V1 e uma resistência R4. A fonte de corrente If1 encontra-se no extremo esquerdo, com a corrente a circular do nó A, em baixo, para o nó B, em cima. Considere que a polaridade da fonte V1 tem o polo positivo voltado para R4 e o polo negativo voltado para o nó B. Se formarmos uma malha nos dois ramos mais à direita, R3 em paralelo com a série de V1 e R4, com sentido de circulação de A para B quando observado no ramo de R3, como fica a equação KVL dessa malha (Im1)? | Consider a circuit consisting of 1 current source If1 in parallel with 3 resistors, R1, R2, R3, and a final branch consisting of the series combination of voltage source V1 and resistor R4. The current source If1 is located at the far left, with the current flowing from node A, at the bottom, to node B, at the top. Consider that voltage source V1 has its positive terminal facing R4 and its negative terminal facing node B. If we form a loop using the two rightmost branches, with R3 in parallel with the series combination of V1 and R4, and with a direction of circulation from A to B when viewed along the R3 branch, what is the KVL equation for this loop (Im1)? |
| Nota: considere que em R3 passa também a corrente da malha Im2 com o mesmo sentido da malha que estamos a analisar. | Note: Consider that the current of loop Im2 also flows through R3 in the same direction as the loop being analysed. |
| Q09: | Q09: |
| Explique a resolução deste circuito utilizando o Método das Correntes nas Malhas descrito na disciplina, identificando: (1) as malhas auxiliares; (2) as malhas principais; (3) quais as correntes de malha que já são conhecidas devido às fontes de corrente; (4) quantas equações KVL devem ser escritas; e (5) como obter as correntes reais dos ramos a partir das correntes de malha. O prompt incluía uma netlist do circuito. | Explain the solution of this circuit using the Loop Current Method described in the course, identifying: (1) the auxiliary loops; (2) the main loops; (3) which loop currents are already known due to current sources; (4) how many KVL equations must be written; and (5) how to obtain the real branch currents from the loop currents. The prompt included a circuit netlist. |
| Q10: | Q10: |
| Neste circuito, indique o valor da corrente no ramo da resistência R8 e explique o significado do seu sinal. Use o Método das Correntes nas Malhas para a resolução. | In this circuit, determine the value of the current in the branch containing resistor R8 and explain the meaning of its sign. Use the Loop Current Method to solve the circuit. |
| Q11: | Q11: |
| Porque é que, se o circuito tem M malhas independentes, eu não escrevo M equações KVL quando existe uma fonte ideal de corrente? | Why, if the circuit has M independent loops, do I not write M KVL equations when an ideal current source is present? |
| Q12: | Q12: |
| Vi uma explicação a dizer que se deve usar supermalha quando há uma fonte de corrente. Isso é a mesma coisa que o Método das Correntes nas Malhas usado nesta disciplina, com malhas auxiliares e malhas principais? | I saw an explanation stating that a supermesh should be used when there is a current source. Is that the same as the Loop Current Method used in this course, with auxiliary loops and main loops? |
Appendix D. Pairwise Comparisons Between System Architectures
| Comparison | Z | p-Value | Interpretation |
|---|---|---|---|
| RAG vs. Pure LLM | −3.388 | 0.001 | Significant after Bonferroni correction |
| Agentic AI vs. Pure LLM | −4.121 | <0.001 | Significant after Bonferroni correction |
| Agentic AI vs. RAG | −1.792 | 0.073 | Not significant after Bonferroni correction |
| Dimension | Comparison | Z | p-Value | Interpretation |
|---|---|---|---|---|
| D1—Correctness | RAG vs. Pure LLM | −0.020 | 0.984 | Not significant |
| D1—Correctness | Agentic AI vs. Pure LLM | −2.881 | 0.004 | Significant after Bonferroni correction |
| D1—Correctness | Agentic AI vs. RAG | −2.958 | 0.003 | Significant after Bonferroni correction |
| D2—Clarity | RAG vs. Pure LLM | −4.279 | <0.001 | Significant after Bonferroni correction |
| D2—Clarity | Agentic AI vs. Pure LLM | −3.499 | <0.001 | Significant after Bonferroni correction |
| D2—Clarity | Agentic AI vs. RAG | −0.244 | 0.807 | Not significant |
| D3—Learning Value | RAG vs. Pure LLM | −0.736 | 0.462 | Not significant |
| D3—Learning Value | Agentic AI vs. Pure LLM | −1.364 | 0.172 | Not significant |
| D3—Learning Value | Agentic AI vs. RAG | −0.575 | 0.565 | Not significant |
| D4—Relevance | RAG vs. Pure LLM | −1.332 | 0.183 | Not significant |
| D4—Relevance | Agentic AI vs. Pure LLM | −0.189 | 0.850 | Not significant |
| D4—Relevance | Agentic AI vs. RAG | −1.382 | 0.167 | Not significant |
| D5—Style | RAG vs. Pure LLM | −3.498 | <0.001 | Significant after Bonferroni correction |
| D5—Style | Agentic AI vs. Pure LLM | −4.528 | <0.001 | Significant after Bonferroni correction |
| D5—Style | Agentic AI vs. RAG | −1.336 | 0.182 | Not significant |
Appendix E. Pairwise Comparisons by Prompt Type
| Prompt Type | Comparison | Z | p-Value | Interpretation |
|---|---|---|---|---|
| Circuit-specific | RAG vs. Pure LLM | −2.622 | 0.009 | Significant after Bonferroni correction |
| Circuit-specific | Agentic AI vs. Pure LLM | −3.554 | <0.001 | Significant after Bonferroni correction |
| Circuit-specific | Agentic AI vs. RAG | −1.484 | 0.138 | Not significant |
| Dimension | Comparison | Z | p-value | Interpretation |
|---|---|---|---|---|
| D1—Correctness | RAG vs. Pure LLM | −0.187 | 0.851 | Not significant |
| D1—Correctness | Agentic AI vs. Pure LLM | −2.614 | 0.009 | Significant after Bonferroni correction |
| D1—Correctness | Agentic AI vs. RAG | −2.314 | 0.021 | Not significant after Bonferroni correction |
| D2—Clarity | RAG vs. Pure LLM | −4.067 | <0.001 | Significant after Bonferroni correction |
| D2—Clarity | Agentic AI vs. Pure LLM | −3.999 | <0.001 | Significant after Bonferroni correction |
| D2—Clarity | Agentic AI vs. RAG | −0.547 | 0.584 | Not significant |
| D5—Style | RAG vs. Pure LLM | −3.047 | 0.002 | Significant after Bonferroni correction |
| D5—Style | Agentic AI vs. Pure LLM | −3.655 | <0.001 | Significant after Bonferroni correction |
| D5—Style | Agentic AI vs. RAG | −1.737 | 0.082 | Not significant |
Appendix F. System Configuration
Appendix F.1. Hardware Platform
- CPU: Intel(R) Core(TM) i7-9700K @ 3.60 GHz (8 cores, up to 4.9 GHz boost clock).
- Memory: 64 GB DDR4–2 × 32 GB (KF3200C16D4/32GX) running at 2400 MT/s.
- Storage: Kingston NV2 NVMe SSD (1 TB)—for OS and the following applications:
- –
- Interface: PCIe 4.0 × 4 NVMe.
- –
- Sequential Read/Write Speeds: Up to 3500 MB/s read, 2800 MB/s write.
- Graphics Cards: 2 × Asus GeForce RTX 3090 GAMING (24 GB GDDR6X):
- –
- Memory: 24 GB GDDR6X (384-bit interface).
- –
- Memory Speed: 19.5 Gbps.
- –
- Boost Clock: 1800 MHz (factory overclocked).
- –
- Core Count: 10,496 CUDA cores.
- –
- Cooling Solution: Triple-fan.
- –
- Interface: PCIe 4.0 ×16.
- –
- DLSS Support: Yes (2nd-gen RT cores, 3rd-gen Tensor cores).
- Power Supply: Cooler Master V1200 Platinum:
- –
- Output Capacity: 1200 W.
- –
- Certification: 80 Plus Platinum (93% efficiency).
Appendix F.2. Software Platform
- Operating System: Ubuntu 24.04.1 LTS (Codename: noble).
- Containerization Platform: Docker 26.1.3 (build 26.1.3-0ubuntu1 24.04.1).
- Python Environment: Python 3.11.4, managed with Conda (base environment).
- Python Packages:
- –
- TensorFlow: 2.13.1.
- –
- PyTorch: 2.3.1.
- –
- Transformers: 4.45.2.
- Jupyter Environment:
- –
- IPython: 8.15.0.
- –
- JupyterLab: 4.0.6.
- –
- Jupyter Notebook: 7.0.4.
- –
- Jupyter Core: 5.3.2.
- –
- Jupyter Server: 2.7.3.
- –
- Nbconvert: 7.8.0.
- –
- Nbclient: 0.8.0.
- Machine Learning Acceleration:
- –
- CUDA Version: 12.1.
- –
- NVIDIA Driver: 530.41.03.
- –
- CUDNN Version: 8.9.2.
- Version Control: Git 2.43.0.
- Compiler: GCC 13.3.0.
References
- Citil, C. Student perspectives on integrating generative artificial intelligence into dual higher education curriculum. Discov. Educ. 2026, 5, 518. [Google Scholar] [CrossRef] [Scilit]
- Walton, J.; Bearman, M.; Crawford, N.; Tai, J.; Boud, D. How university students work on assessment tasks with generative artificial intelligence: Matters of judgement. In Assessment & Evaluation in Higher Education; Taylor & Francis: Abingdon, UK, 2025; pp. 1–17. [Google Scholar]
- Qu, Y.; Loo, H.E.; Wang, J. Generative artificial intelligence in higher education: Emotional tensions and ethical declaration. Br. J. Educ. Technol. 2025, 1–20. [Google Scholar] [CrossRef] [Scilit]
- Rocha, A.; Ferreira, J.; Oliveira, P.; Alves, M.; Sousa, A. Fine-Tuning Lightweight LLMs With Human-Curated Data on Electrical Circuit Fundamentals for E-Learning. Comput. Appl. Eng. Educ. 2026, 34, e70176. [Google Scholar] [CrossRef] [Scilit]
- Sousa, L.; Rocha, A.; Alves, M.; Pereira, F. U= RIsolve: A web-based application for learning electrical circuit analysis [Education]. IEEE Circuits Syst. Mag. 2021, 21, 66–95. [Google Scholar] [CrossRef] [Scilit]
- Sousa, L.; Rocha, A.; Alves, M.; Pereira, F. Revisiting the nodal voltage method for both human comprehension and software implementation: Towards a teaching/self-learning simulation tool. Comput. Appl. Eng. Educ. 2021, 29, 1642–1664. [Google Scholar] [CrossRef] [Scilit]
- Rocha, A.; Oliveira, P.; Ferreira, J.; Alves, M.; Sousa, A. Lightweight Llama Models with Experts’ Curated RAG for Electrical Engineering Education: An Exploratory Comparison. Appl. Sci. 2026, 16, 7745. [Google Scholar] [CrossRef] [Scilit]
- Albadarin, Y.; Saqr, M.; Pope, N.; Tukiainen, M. A systematic literature review of empirical research on ChatGPT in education. Discov. Educ. 2024, 3, 60. [Google Scholar] [CrossRef] [Scilit]
- Filippi, S.; Motyl, B. Large language models (LLMs) in engineering education: A systematic review and suggestions for practical adoption. Information 2024, 15, 345. [Google Scholar] [CrossRef] [Scilit]
- Kasneci, E.; Seßler, K.; Küchemann, S.; Bannert, M.; Dementieva, D.; Fischer, F.; Gasser, U.; Groh, G.; Günnemann, S.; Hüllermeier, E.; et al. ChatGPT for good? On opportunities and challenges of large language models for education. Learn. Individ. Differ. 2023, 103, 102274. [Google Scholar] [CrossRef] [Scilit]
- Li, R.; Li, M.; Qiao, W. Engineering students’ use of large language model tools: An empirical study based on a survey of students from 12 universities. Educ. Sci. 2025, 15, 280. [Google Scholar] [CrossRef] [Scilit]
- Chen, M.; Tworek, J.; Jun, H.; Yuan, Q.; Pinto, H.P.D.O.; Kaplan, J.; Edwards, H.; Burda, Y.; Joseph, N.; Brockman, G.; et al. Evaluating large language models trained on code. arXiv 2021, arXiv:2107.03374. [Google Scholar]
- Finnie-Ansley, J.; Denny, P.; Becker, B.A.; Luxton-Reilly, A.; Prather, J. The robots are coming: Exploring the implications of openai codex on introductory programming. In Proceedings of the 24th Australasian Computing Education Conference, Virtual, 14–18 February 2022; pp. 10–19. [Google Scholar]
- Denny, P.; Kumar, V.; Giacaman, N. Conversing with copilot: Exploring prompt engineering for solving cs1 problems using natural language. In Proceedings of the 54th ACM Technical Symposium on Computer Science Education V. 1, Toronto, ON, Canada, 15–18 March 2023; pp. 1136–1142. [Google Scholar]
- Rocha, A.; Sousa, L.; Alves, M.; Sousa, A. The underlying potential of NLP for microcontroller programming education. Comput. Appl. Eng. Educ. 2024, 32, e22778. [Google Scholar] [CrossRef] [Scilit]
- Hu, E.J.; Shen, Y.; Wallis, P.; Allen-Zhu, Z.; Li, Y.; Wang, S.; Wang, L.; Chen, W. Lora: Low-rank adaptation of large language models. arXiv 2024, arXiv:2106.09685. [Google Scholar]
- Dettmers, T.; Pagnoni, A.; Holtzman, A.; Zettlemoyer, L. Qlora: Efficient finetuning of quantized llms. Adv. Neural Inf. Process. Syst. 2023, 36, 10088–10115. [Google Scholar] [CrossRef] [Scilit]
- Lewis, P.; Perez, E.; Piktus, A.; Petroni, F.; Karpukhin, V.; Goyal, N.; Küttler, H.; Lewis, M.; Yih, W.t.; Rocktäschel, T.; et al. Retrieval-augmented generation for knowledge-intensive nlp tasks. Adv. Neural Inf. Process. Syst. 2020, 33, 9459–9474. [Google Scholar]
- Karpukhin, V.; Oguz, B.; Min, S.; Lewis, P.; Wu, L.; Edunov, S.; Chen, D.; Yih, W.t. Dense passage retrieval for open-domain question answering. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), Online, 16–20 November 2020; pp. 6769–6781. [Google Scholar] [CrossRef] [Scilit]
- Asai, A.; Wu, Z.; Wang, Y.; Sil, A.; Hajishirzi, H. Self-rag: Learning to retrieve, generate, and critique through self-reflection. In Proceedings of the International Conference on Learning Representations, Vienna, Austria, 7–11 May 2024; Volume 2024, pp. 9112–9141. [Google Scholar]
- Schick, T.; Dwivedi-Yu, J.; Dessì, R.; Raileanu, R.; Lomeli, M.; Hambro, E.; Zettlemoyer, L.; Cancedda, N.; Scialom, T. Toolformer: Language models can teach themselves to use tools. Adv. Neural Inf. Process. Syst. 2023, 36, 68539–68551. [Google Scholar] [CrossRef] [Scilit]
- Yao, S.; Zhao, J.; Yu, D.; Du, N.; Shafran, I.; Narasimhan, K.; Cao, Y. REACT: SYNERGIZING REASONING AND ACTING IN LANGUAGE MODELS. In Proceedings of the 11th International Conference on Learning Representations, ICLR 2023, Kigali, Rwanda, 1–5 May 2023; ICLR: Dublin, Ireland, 2023. [Google Scholar]
- Shinn, N.; Cassano, F.; Gopinath, A.; Narasimhan, K.; Yao, S. Reflexion: Language agents with verbal reinforcement learning. Adv. Neural Inf. Process. Syst. 2023, 36, 8634–8652. [Google Scholar] [CrossRef] [Scilit]
- Wang, Y.; Li, Z.; Wang, Z.; Teiletche, P.; Jin, L.; Zaharia, M.; Gonzalez, J.E.; Min, S. PIXELRAG: Web Screenshots Beat Text for Retrieval-Augmented Generation. arXiv 2026, arXiv:2606.28344. [Google Scholar]
- Jonah, S. When Do Multimodal and Graph-Augmented RAG Help? A Controlled Evaluation for Document Question Answering. arXiv 2026, arXiv:2607.16604. [Google Scholar]
- Huang, C.Y.; Chen, H.I.; Ho, H.W.; Kang, P.H.; Lin, M.P.H.; Liu, W.H.; Ren, H. Netlistify: Transforming circuit schematics into netlists with deep learning. In Proceedings of the 2025 ACM/IEEE 7th Symposium on Machine Learning for CAD (MLCAD), Santa Cruz, CA, USA, 8–10 September 2025; IEEE: New York, NY, USA, 2025; pp. 1–8. [Google Scholar]
- Hu, W.; Zhan, X.; Tong, M. Parsing netlists of integrated circuits from images via graph attention network. Sensors 2023, 24, 227. [Google Scholar] [CrossRef] [Scilit]
- Peker, Ö.B.; Toker, E.; Öcal, D.; Dalyan, T.; Afacan, E.; Gökdel, Y.D. A Fully Automated SPICE-Compatible Netlist Extraction From Image Using Deep Learning and Image Preprocessing Techniques. IEEE Access 2026, 14, 19750–19765. [Google Scholar] [CrossRef] [Scilit]
- Luccioni, A.S.; Viguier, S.; Ligozat, A.L. Estimating the carbon footprint of bloom, a 176b parameter language model. J. Mach. Learn. Res. 2023, 24, 1–15. [Google Scholar]
- Oviedo, F.; Kazhamiaka, F.; Choukse, E.; Kim, A.; Luers, A.; Nakagawa, M.; Bianchini, R.; Ferres, J.M.L. Energy use of AI inference, efficiency pathways, and test-time scaling. Joule, 2026; in press. [CrossRef] [Scilit]
- Xiao, T.; Nerini, F.F.; Matthews, H.D.; Tavoni, M.; You, F. Environmental impact and net-zero pathways for sustainable artificial intelligence servers in the USA. Nat. Sustain. 2025, 8, 1541–1553. [Google Scholar] [CrossRef] [Scilit]
- OpenAI. OpenAI API Pricing. 2026. Available online: https://developers.openai.com/api/docs/pricing (accessed on 28 June 2026).
- Minaee, S.; Mikolov, T.; Nikzad, N.; Chenaghlu, M.; Socher, R.; Amatriain, X.; Gao, J. Large language models: A survey. arXiv 2024, arXiv:2402.06196. [Google Scholar]
- Osborne, C.; Ding, J.; Kirk, H.R. The AI community building the future? A quantitative analysis of development activity on Hugging Face Hub. J. Comput. Soc. Sci. 2024, 7, 2067–2105. [Google Scholar] [CrossRef] [Scilit]
- Chiang, W.L.; Zheng, L.; Sheng, Y.; Angelopoulos, A.N.; Li, T.; Li, D.; Zhu, B.; Zhang, H.; Jordan, M.I.; Gonzalez, J.E.; et al. Chatbot arena: An open platform for evaluating LLMs by human preference. In Proceedings of the 41st International Conference on Machine Learning, JMLR.org, ICML’24, Vienna, Austria, 21–27 July 2024. [Google Scholar]
- VanLehn, K. The relative effectiveness of human tutoring, intelligent tutoring systems, and other tutoring systems. Educ. Psychol. 2011, 46, 197–221. [Google Scholar] [CrossRef] [Scilit]
- Butz, B.P.; Duarte, M.; Miller, S.M. An intelligent tutoring system for circuit analysis. IEEE Trans. Educ. 2006, 49, 216–223. [Google Scholar] [CrossRef] [Scilit]
- Skromme, B.J.; Rayes, P.J.; McNamara, B.E.; Seetharam, V.; Gao, X.; Thompson, T.; Wang, X.; Cheng, B.; Huang, Y.F.; Robinson, D.H. Step-based tutoring system for introductory linear circuit analysis. In Proceedings of the 2015 IEEE Frontiers in Education Conference (FIE), Erie, PA, USA, 21–24 October 2015; IEEE: New York, NY, USA, 2015; pp. 1–9. [Google Scholar]
- Skromme, B.J.; Bansal, S.K.; Barnard, W.M.; O’Donnell, M.A. Step-based tutoring software for complex procedures in circuit analysis. In Proceedings of the 2019 IEEE Frontiers in Education Conference (FIE), Covington, KY, USA, 16–19 October 2019; IEEE: New York, NY, USA, 2019; pp. 1–5. [Google Scholar]
- Skromme, B.J.; Wong, M.; Redshaw, C.; O’donnell, M. Teaching series and parallel connections. IEEE Trans. Educ. 2021, 65, 461–470. [Google Scholar] [CrossRef] [Scilit]
- Skromme, B.J.; Seetharam, V.; Gao, X.; Korrapati, B.; McNamara, B.E.; Huang, Y.F.; Robinson, D.H. Impact of step-based tutoring on student learning in linear circuit courses. In Proceedings of the 2016 IEEE Frontiers in Education Conference (FIE), Erie, PA, USA, 12–15 October 2016; IEEE: New York, NY, USA, 2016; pp. 1–9. [Google Scholar]
- Chen, L.; Qin, Z.; Guo, Y.; Rohde, J.; Zhang, Y. Benchmarking large language models on homework assessment in circuit analysis. Int. J. Artif. Intell. Educ. 2025, 35, 3294–3355. [Google Scholar] [CrossRef] [Scilit]
- Chen, L.; Xie, H.; Rohde, J.; Zhang, Y. WIP: Large Language Model-Enhanced Smart Tutor for Undergraduate Circuit Analysis. In Proceedings of the 2025 IEEE Frontiers in Education Conference (FIE), Nashville, TN, USA, 2–5 November 2025; IEEE: New York, NY, USA, 2025; pp. 1–5. [Google Scholar]
- Knievel, C.; Bernhardt, A.; Bernhardt, C. Recognition, Retrieval, and Response: The AITEE Framework for Socratic Tutoring in Electrical Engineering. IEEE Access 2026, 14, 50109–50126. [Google Scholar] [CrossRef] [Scilit]
- Sweller, J. Cognitive load during problem solving: Effects on learning. Cogn. Sci. 1988, 12, 257–285. [Google Scholar] [CrossRef] [Scilit]
- Kircher, P.; Sweller, J.; Clark, R.E. Why minimal guidance during instruction does not work: An analysis of the failure of constructivist, discovery, problem-based, experiential, and inquiry-based teaching. Educ. Psychol. 2006, 4, 75–86. [Google Scholar] [CrossRef] [Scilit]
- Hmelo-Silver, C.E.; Duncan, R.G.; Chinn, C.A. Scaffolding and achievement in problem-based and inquiry learning: A response to Kirschner, Sweller, and. Educ. Psychol. 2007, 42, 99–107. [Google Scholar] [CrossRef] [Scilit]
- Kalyuga, S. The expertise reversal effect. In Managing Cognitive Load in Adaptive Multimedia Learning; IGI Global Scientific Publishing: Hershey, PA, USA, 2009; pp. 58–80. [Google Scholar]
- Ding, K.; Yu, J.; Huang, J.; Yang, Y.; Zhang, Q.; Chen, H. SciToolAgent: A knowledge-graph-driven scientific agent for multitool integration. Nat. Comput. Sci. 2025, 5, 962–972. [Google Scholar] [CrossRef] [Scilit]
- Haykin, S. Neural Networks and Learning Machines, 3/E; Pearson Education: Noida, India, 2009. [Google Scholar]
- Russell, S.J. Artificial Intelligence a Modern Approach; Pearson Education, Inc.: London, UK, 2010. [Google Scholar]
- Weizenbaum, J. ELIZA—A computer program for the study of natural language communication between man and machine. Commun. ACM 1966, 9, 36–45. [Google Scholar] [CrossRef] [Scilit]


| System | Additional Processing Resources and Evidence Made Available to the Composer |
|---|---|
| A—Pure LLM | No document retrieval or tool-generated evidence. |
| B—RAG | Text excerpts retrieved from an expert-curated pedagogical corpus. |
| C—Agentic AI | Pedagogical excerpts, normalized representation, topological information, equations, results, validations, and visual artefacts produced and selected by the pipeline according to the question. |
| Artefact | Origin | Main Content | Use |
|---|---|---|---|
| User question | Textual input | Doubt, tutorial intention, and response focus | Guides the system routing, evidence selection, and the final composition |
| Input classification | Main runtime | Input type, circuit mode, and available artefacts | Defines the conditional branches of the pipeline |
| Circuit JSON | Input or frontend | Components, values, wires, (inter)connection points, and geometric information | Basis for connectivity extraction, netlist construction, and rendering |
| JSON–netlist map | JSON circuit extractor | Relationship between components, electrical nodes, and netlist lines | Explains how the drawing was converted into a formal representation |
| Extracted netlist | JSON circuit extractor | Initial textual representation obtained from the circuit connectivity | Input for validation and normalisation |
| Normalised netlist | Netlist builder/validator | Formal and computable circuit representation, with normalised nodes and components | Input for the deterministic solver and the evidence package |
| Solver output | U=RIsolve | Circuit patterns, equations, currents, intermediate values, and final results | Technical basis for circuit-dependent explanations |
| Topological metadata | Extractor, parser, and solver | Nodes, branches, loops, sources, relationships between variables, and reference directions | Supports structural explanation and method interpretation |
| Layered renderings | Circuit Renderer | Base circuit and overlays of nodes, branches, loops, and currents | Visual support for the response and for human review |
| PMB | Pedagogical Markdown Builder | Theory, circuit, netlist, solution steps, equations, results, tips and notes | Structured pedagogical artefact for consultation, and LLM retrieval |
| Evidence package | Evidence Pack Builder | Compact selection of facts, sections, results, visual references, limitations, and constraints | Basis for constructing the context sent to the LLM |
| LLM context | Context Pack Builder | Question, deterministic facts, normalised netlist, solver evidence, pedagogical sections, and response contract | Structured prompt for composing the final response |
| Final response | LLM composer | Tutorial explanation in natural language, generated by the model | Output presented to the student |
| Response verification | Contract checks | Warnings about omissions, non-existent references, lack of sign explanation, or incomplete use of evidence | Quality control and response traceability |
| Trace package | Pipeline orchestrator | Input, artefacts used, selected evidence, context, response, and verification | Review, auditing, and subsequent analysis |
| Prompt Code | Prompt Type | Main Focus | Brief Description |
|---|---|---|---|
| Q1 | Generic | Structural identification of the circuit | Determination of the number of independent loops, main loops, auxiliary loops and minimum number of KVL equations in a circuit described textually. |
| Q2 | Generic | Loops in a circuit with a current source | Analysis of a circuit with an ideal current source in parallel with resistors, requiring the identification of relevant loops and equations. |
| Q3 | Circuit-specific | Distinction between loops (auxiliary and independent) | Explanation of the difference between possible loops, independent loops, auxiliary loops and main loops, based on a circuit netlist. |
| Q4 | Circuit-specific | Selection of an auxiliary loop | Identification of a valid auxiliary loop and explanation of why the associated loop current is no longer unknown. |
| Q5 | Circuit-specific | Structured solution using the Loop Current Method | Explanation of the solution procedure, including auxiliary loops, main loops, known loop currents, KVL equations and real (branch) currents. |
| Code | Dimension | Statement |
|---|---|---|
| D1 | Perceived Correctness | I believe the answer is correct. |
| D2 | Clarity | The answer is clear and easy to understand. |
| D3 | Learning Value | I learned something from this answer. |
| D4 | Relevance | The answer addresses what was asked. |
| D5 | Style | I like the style of the answer. |
| Dimension | Pure LLM M | RAG M | Agentic AI M | Friedman | p-Value | Post hoc Interpretation |
|---|---|---|---|---|---|---|
| D1—Perceived Correctness | 4.267 | 4.267 | 4.452 | 13.050 | 0.001 | Agentic AI rated higher than Pure LLM and RAG |
| D2—Clarity | 3.678 | 4.033 | 4.000 | 25.010 | 0.000 | RAG and Agentic AI rated higher than Pure LLM |
| D3—Learning Value | 3.911 | 3.967 | 3.974 | 2.116 | 0.347 | No significant differences |
| D4—Relevance | 4.448 | 4.374 | 4.444 | 1.600 | 0.449 | No significant differences |
| D5—Style | 3.604 | 3.944 | 4.033 | 23.839 | 0.000 | RAG and Agentic AI rated higher than Pure LLM |
| Prompt Type | Architecture | N | Mean | SD |
|---|---|---|---|---|
| Generic | Pure LLM | 110 | 4.211 | 0.656 |
| Generic | RAG | 82 | 4.268 | 0.662 |
| Generic | Agentic AI | 104 | 4.258 | 0.678 |
| Circuit-specific | Pure LLM | 135 | 3.848 | 0.868 |
| Circuit-specific | RAG | 110 | 4.110 | 0.717 |
| Circuit-specific | Agentic AI | 135 | 4.116 | 0.749 |
| Prompt Type | Dimension | Friedman | p-Value | Post hoc Interpretation |
|---|---|---|---|---|
| Generic | D1—Perceived Correctness | 0.057 | 0.972 | No significant differences |
| Generic | D2—Clarity | 3.138 | 0.208 | No significant differences |
| Generic | D3—Learning Value | 4.037 | 0.133 | No significant differences |
| Generic | D4—Relevance | 1.000 | 0.607 | No significant differences |
| Generic | D5—Style | 5.069 | 0.079 | No significant differences |
| Circuit-specific | D1—Perceived Correctness | 10.607 | 0.005 | Agentic AI rated higher than Pure LLM |
| Circuit-specific | D2—Clarity | 22.605 | 0.000 | RAG and Agentic AI rated higher than Pure LLM |
| Circuit-specific | D3—Learning Value | 1.891 | 0.388 | No significant differences |
| Circuit-specific | D4—Relevance | 1.264 | 0.532 | No significant differences |
| Circuit-specific | D5—Style | 13.910 | 0.001 | RAG and Agentic AI rated higher than Pure LLM |
| Local Configuration | N | Mean | Standard Deviation |
|---|---|---|---|
| GPT-OSS-20b–Pure LLM | 135 | 3.893 | 0.942 |
| GPT-OSS-20b–RAG | 135 | 4.164 | 0.712 |
| GPT-OSS-20b–Agentic AI | 135 | 4.099 | 0.752 |
| Llama 3.3-70B–Pure LLM | 135 | 4.070 | 0.740 |
| Llama 3.3-70B–RAG | 135 | 4.070 | 0.854 |
| Llama 3.3-70B–Agentic AI | 135 | 4.262 | 0.716 |
| Comparison | Llama 3.3-70B Agentic AI M | ChatGPT M | Z | p-Value | Interpretation |
|---|---|---|---|---|---|
| Global score | 4.262 | 4.222 | −0.740 | 0.459 | No significant difference |
| D1—Perceived Correctness | 4.510 | 4.340 | −1.739 | 0.082 | No significant difference |
| D2—Clarity | 4.120 | 4.160 | −0.327 | 0.743 | No significant difference |
| D3—Learning Value | 4.070 | 4.050 | −0.346 | 0.729 | No significant difference |
| D4—Relevance | 4.500 | 4.520 | −0.403 | 0.687 | No significant difference |
| D5—Style | 4.120 | 4.040 | −0.945 | 0.345 | No significant difference |
| Questions | Main Focus | Type of Competence Evaluated |
|---|---|---|
| Q01–Q04 | Topological counting and method structure | LCM structure and concepts |
| Q05–Q06 | Mesh identification and selection | Application of topological structure |
| Q07–Q10 | Circuit equations and quantities | Application and interpretation |
| Q11–Q12 | Current sources and loop types | Conceptual understanding |
| Criterion | Dimension | Evaluation Focus |
|---|---|---|
| TC | Technical Correctness | Technical Correctness of the content and results |
| QA | Question Alignment | Adequacy of the response to the prompt request |
| SC | Symbol Clarity | Clarity and consistency of symbols, quantities and references |
| PR | Paper-and-Pencil Reasoning | Adequacy of the reasoning for a manual solution of the problem |
| MH | Misconception Handling | Ability to avoid or clarify incorrect interpretations |
| VR | Visual Reference Usefulness | Usefulness and adequacy of the visual references presented |
| CT | Conciseness for Tutoring | Conciseness and focus of the response in a tutoring-like context |
| NL | Next Learning Step | Usefulness of the response in guiding further learning |
| Metric | Pure LLM | RAG | Agentic AI |
|---|---|---|---|
| TC | 1.79 | 2.63 | 3.71 |
| QA | 2.67 | 3.21 | 3.83 |
| SC | 3.05 | 3.54 | 3.79 |
| PR | 2.50 | 3.10 | 3.71 |
| MH | 1.77 | 2.30 | 3.13 |
| VR | 1.87 | 2.00 | 3.65 |
| CT | 3.08 | 3.83 | 3.46 |
| NL | 2.00 | 1.80 | 3.50 |
| TC | 1/24 (4.2%) | 5/24 (20.8%) | 13/24 (54.2%) |
| TC | 21/24 (87.5%) | 14/24 (58.3%) | 1/24 (4.2%) |
| Question | GPT-OSS:20b | Llama-3.3:70b | ||||
|---|---|---|---|---|---|---|
| Pure LLM | RAG | Agentic AI | Pure LLM | RAG | Agentic AI | |
| Q01 | 2 | 5 | 5 | 3 | 2 | 3 |
| Q02 | 2 | 3 | 5 | 2 | 2 | 3 |
| Q03 | 1 | 2 | 4 | 1 | 2 | 2 |
| Q04 | 2 | 2 | 3 | 2 | 2 | 4 |
| Q05 | 1 | 2 | 4 | 2 | 2 | 4 |
| Q06 | 4 | 5 | 5 | 1 | 1 | 4 |
| Q07 | 3 | 2 | 3 | 2 | 1 | 3 |
| Q08 | 2 | 3 | 3 | 2 | 5 | 4 |
| Q09 | 1 | 3 | 5 | 1 | 2 | 3 |
| Q10 | 1 | 1 | 3 | 1 | 2 | 5 |
| Q11 | 1 | 4 | 4 | 2 | 3 | 3 |
| Q12 | 2 | 3 | 4 | 2 | 4 | 3 |
| 1—Very poor | 2—Poor | 3—Acceptable | ||||
| 4—Good | 5—Excellent | |||||
| Base Model | Pure LLM | RAG | Agentic AI |
|---|---|---|---|
| GPT-OSS:20b | 1.83 | 2.92 | 4.00 |
| Llama-3.3:70b | 1.75 | 2.33 | 3.42 |
| Group | Questions | Pure LLM | RAG | Agentic AI |
|---|---|---|---|---|
| Counting and method structure | Q01–Q04 | 1.88 | 2.50 | 3.63 |
| Mesh identification and selection | Q05–Q06 | 2.00 | 2.50 | 4.25 |
| Equations and quantities | Q07–Q10 | 1.63 | 2.38 | 3.63 |
| Conceptual doubts | Q11–Q12 | 1.75 | 3.50 | 3.50 |
| Architecture | Student-Reported Perceived Correctness (D1) | Technical Correctness (TC) |
|---|---|---|
| Pure LLM | 4.267 | 1.60 |
| RAG | 4.267 | 2.40 |
| Agentic AI | 4.452 | 3.90 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.
Share and Cite
Rocha, A.; Ferreira, J.; Oliveira, P.C.; Alves, M.; Sousa, A. A Tool-Augmented Agentic AI Pipeline for Reliable Circuit-Analysis Tutoring with Local Language Models. Computers 2026, 15, 647. https://doi.org/10.3390/computers15100647
Rocha A, Ferreira J, Oliveira PC, Alves M, Sousa A. A Tool-Augmented Agentic AI Pipeline for Reliable Circuit-Analysis Tutoring with Local Language Models. Computers. 2026; 15(10):647. https://doi.org/10.3390/computers15100647
Chicago/Turabian StyleRocha, André, João Ferreira, Paulo C. Oliveira, Mário Alves, and Armando Sousa. 2026. "A Tool-Augmented Agentic AI Pipeline for Reliable Circuit-Analysis Tutoring with Local Language Models" Computers 15, no. 10: 647. https://doi.org/10.3390/computers15100647
APA StyleRocha, A., Ferreira, J., Oliveira, P. C., Alves, M., & Sousa, A. (2026). A Tool-Augmented Agentic AI Pipeline for Reliable Circuit-Analysis Tutoring with Local Language Models. Computers, 15(10), 647. https://doi.org/10.3390/computers15100647

