Gilbert L. Peterson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Gilbert L. Peterson has a total of 166 co-authors. Here are the top co-authors by number of shared publications:
- Michael E. Miller
Air Force Institute of Technology
7 shared publications Benjamin M. Rodriguez
Air Force Institute of Technology
6 shared publicationsRobert F. Mills
6 shared publicationsGary B. Lamont
Department of Electrical and Computer Engineering Graduate School of Engineering and Management Air Force Institute of Technology Wright-Patterson AFB, Ohio 45433
5 shared publicationsJames S. Okolica
Air Force Institute of Technology (AFIT)
5 shared publicationsBarry E. Mullins
Department of Electrical and Computer Engineering, Air Force Institute of Technology, 2950 Hobson Way, Wright-Patterson AFB, OH, USA
4 shared publications
Latest Publications
- Open Access
- 20 July 2026
- Published by MDPI AG in AI in Education
- Vol. 2 (3) , 25
A Personalized Learning Path Problem Based on the Cognitive Theory of Multimedia Learning
Educators increasingly rely on e-learning to supplement traditional classroom learning. Personalized learning paths (PLPs) have emerged as one type of supplement. A PLP is a sequence of learning materials (LMs) and activities that are selected according to LM fitness for the learner’s preferences and ordered according to prerequisite relationships. A problem that consistently emerges in PLP research is the use of pseudo-scientific learning theories to inform PLP design. This research presents LM and PLP rubrics, derived from the Cognitive Theory of Multimedia Learning (an experimentally validated learning theory) as a foundation that informs the PLP design process. The LM and PLP rubrics are decomposed into two problem domains, which include selecting and sequencing LMs to create PLPs. These problem domains are supported by proofs of NP-completeness. Next, real-world data are presented and used to derive instances of these multi-objective problems, which are then solved using the Non-Dominated Sorting Genetic Algorithm, a simulated annealing algorithm, and a Random Hill Climber algorithm. These metaheuristics produce satisfactory results, with the rubric scores of 12 student profiles ranging from to on a four-point scale. The rubrics, data, and algorithms used in this paper are publicly available.- 20 July 2026
- Published by MDPI AG in AI in Education
- Vol. 2 (3) , 25
Open AccessA Personalized Learning Path Problem Based on the Cognitive Theory of Multimedia Learning
Educators increasingly rely on e-learning to supplement traditional classroom learning. Personalized learning paths (PLPs) have emerged as one type of supplement. A PLP is a sequence of learning materials (LMs) and activities that are selected according to LM fitness for the learner’s preferences and ordered according to prerequisite relationships. A problem that consistently emerges in PLP research is the use of pseudo-scientific learning theories to inform PLP design. This research presents LM and PLP rubrics, derived from the Cognitive Theory of Multimedia Learning (an experimentally validated learning theory) as a foundation that informs the PLP design process. The LM and PLP rubrics are decomposed into two problem domains, which include selecting and sequencing LMs to create PLPs. These problem domains are supported by proofs of NP-completeness. Next, real-world data are presented and used to derive instances of these multi-objective problems, which are then solved using the Non-Dominated Sorting Genetic Algorithm, a simulated annealing algorithm, and a Random Hill Climber algorithm. These metaheuristics produce satisfactory results, with the rubric scores of 12 student profiles ranging from to on a four-point scale. The rubrics, data, and algorithms used in this paper are publicly available. - 20 May 2026
- Published by Elsevier in Cognitive Systems Research
- Vol. 98
Cognitive team models in press Diplomacy
- 20 May 2026
- Published by Elsevier in Cognitive Systems Research
- Vol. 98
Cognitive team models in press Diplomacy
- 24 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Focus: A One-vs-All Resolution Strategy for Temporal Metadata Analysis
In digital forensics, temporal metadata analysis involves collecting, examining, and extracting time-related trace data to find answers to investigative questions. To answer questions, experts apply platform-specific knowledge to identify and group corroborating traces. This paper extends previous work with rule-based binary classifiers by introducing a novel resolution strategy inspired by human expert methods of analyzing temporal metadata. The presented approach represents expert knowledge as rule-based binary classifiers to group patterns associated with specific activities and leverages these rules over time similar to how experts reason over the same data. Focus distinguishes itself by dynamically highlighting the most relevant label from each classifier by creating a working and long-term memory of the most relevant classifier based on rules with weighted values that increase and decrease over time. The system is evaluated across 10 scenarios on a Windows 10 workstation. Results show a 190% increase in F1 score from 0.31 to 0.90, highlighting the efficacy of Focus as an OvA resolution strategy for temporal metadata machine learning classification applications.
- 24 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Focus: A One-vs-All Resolution Strategy for Temporal Metadata Analysis
In digital forensics, temporal metadata analysis involves collecting, examining, and extracting time-related trace data to find answers to investigative questions. To answer questions, experts apply platform-specific knowledge to identify and group corroborating traces. This paper extends previous work with rule-based binary classifiers by introducing a novel resolution strategy inspired by human expert methods of analyzing temporal metadata. The presented approach represents expert knowledge as rule-based binary classifiers to group patterns associated with specific activities and leverages these rules over time similar to how experts reason over the same data. Focus distinguishes itself by dynamically highlighting the most relevant label from each classifier by creating a working and long-term memory of the most relevant classifier based on rules with weighted values that increase and decrease over time. The system is evaluated across 10 scenarios on a Windows 10 workstation. Results show a 190% increase in F1 score from 0.31 to 0.90, highlighting the efficacy of Focus as an OvA resolution strategy for temporal metadata machine learning classification applications.
- Open Access
- 5 February 2025
- Published by Wiley in Advanced Intelligent Systems
- Vol. 7 (4)
Accelerated Multiobjective Calibration of Fused Deposition Modeling 3D Printers Using Multitask Bayesian Optimization and Computer Vision
Proper process parameter calibration is critical to the success of fused deposition modeling (FDM) three‐dimensional (3D) printing, but is time‐consuming and requires expertise. While existing systems for autonomous calibration have demonstrated success in calibrating for a single objective, users may need to balance multiple conflicting objectives. Herein, an easily deployable, camera‐based system for autonomous calibration of FDM printers that optimizes for both part quality and completion time is presented. Autonomous calibration is achieved through a novel, multifaceted computer vision characterization and a multitask learning extension to Bayesian optimization. The system is demonstrated on four popular filament types using two distinct 3D printers. The results show that the system significantly outperforms manufacturer calibration across the machine and material configurations, achieving an average improvement of 32.2% in quality and a 31.2% decrease in completion time with respect to a popular benchmark.
- 5 February 2025
- Published by Wiley in Advanced Intelligent Systems
- Vol. 7 (4)
Open AccessAccelerated Multiobjective Calibration of Fused Deposition Modeling 3D Printers Using Multitask Bayesian Optimization and Computer Vision
Proper process parameter calibration is critical to the success of fused deposition modeling (FDM) three‐dimensional (3D) printing, but is time‐consuming and requires expertise. While existing systems for autonomous calibration have demonstrated success in calibrating for a single objective, users may need to balance multiple conflicting objectives. Herein, an easily deployable, camera‐based system for autonomous calibration of FDM printers that optimizes for both part quality and completion time is presented. Autonomous calibration is achieved through a novel, multifaceted computer vision characterization and a multitask learning extension to Bayesian optimization. The system is demonstrated on four popular filament types using two distinct 3D printers. The results show that the system significantly outperforms manufacturer calibration across the machine and material configurations, achieving an average improvement of 32.2% in quality and a 31.2% decrease in completion time with respect to a popular benchmark.
- Open Access
- 31 October 2024
- Published by Elsevier in Forensic Science International: Digital Investigation
- Vol. 51
Temporal metadata analysis: A learning classifier system approach
- 31 October 2024
- Published by Elsevier in Forensic Science International: Digital Investigation
- Vol. 51
Open AccessTemporal metadata analysis: A learning classifier system approach
- Open Access
- 18 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 6 (3) , 574-588
Personalized Learning Path Problem Variations: Computational Complexity and AI Approaches
E-learning courses often suffer from high dropout rates and low student satisfaction. One way to address this issue is to use Personalized Learning Paths (PLPs), which are sequences of learning materials that meet the individual needs of students. However, creating PLPs is difficult and often involves combining knowledge graphs, student profiles, and learning materials. Researchers typically assume that the problem of creating PLPs belong to the NP-Hard class of computational problems. However, previous research in this field has neither defined the different variations of the PLP problem nor formally established their computational complexity. Without clear definitions of the PLP variations, researchers risk making invalid comparisons and conclusions when they use different metaheuristics for different PLP problems. In order to unify this conversation, this paper formally proves the NP-completeness of two common PLP variations and their generalizations and uses them to categorize recent research in the PLP field. It then presents an instance of the PLP problem using real-world data and shows how this instance can be cast into two different NP-complete variations. This paper then presents three AI strategies, solving one of the PLP variations with back-tracking and branch and bound heuristics and also converting the PLP variation instance to XCSP 3 , an intermediate constraint satisfaction language to be resolved with a general Constraint Optimization solver. This paper solves the other PLP variation instance using a greedy search heuristic. The paper finishes by comparing the results of the two different PLP variations.
- 18 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 6 (3) , 574-588
Open AccessPersonalized Learning Path Problem Variations: Computational Complexity and AI Approaches
E-learning courses often suffer from high dropout rates and low student satisfaction. One way to address this issue is to use Personalized Learning Paths (PLPs), which are sequences of learning materials that meet the individual needs of students. However, creating PLPs is difficult and often involves combining knowledge graphs, student profiles, and learning materials. Researchers typically assume that the problem of creating PLPs belong to the NP-Hard class of computational problems. However, previous research in this field has neither defined the different variations of the PLP problem nor formally established their computational complexity. Without clear definitions of the PLP variations, researchers risk making invalid comparisons and conclusions when they use different metaheuristics for different PLP problems. In order to unify this conversation, this paper formally proves the NP-completeness of two common PLP variations and their generalizations and uses them to categorize recent research in the PLP field. It then presents an instance of the PLP problem using real-world data and shows how this instance can be cast into two different NP-complete variations. This paper then presents three AI strategies, solving one of the PLP variations with back-tracking and branch and bound heuristics and also converting the PLP variation instance to XCSP 3 , an intermediate constraint satisfaction language to be resolved with a general Constraint Optimization solver. This paper solves the other PLP variation instance using a greedy search heuristic. The paper finishes by comparing the results of the two different PLP variations.
- 4 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3-8
Kingmaking in Press Diplomacy
Humans play games like Diplomacy for more reasons than just trying to win. For example, when they know they are losing, they may choose to aid an opponent rather than concede. This paper presents Lyre, an agent skilled at playing/communicating in Diplomacy and adept at working towards the benefit or harm of a given opponent - kingmaking. We parallel Lyre's kingmaking with real human Diplomacy games and analyze how Lyre can best play kingmaker. Results show statistically significant benefit in Lyre's boardplay, negotiation, and kingmaking.
- 4 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3-8
Kingmaking in Press Diplomacy
Humans play games like Diplomacy for more reasons than just trying to win. For example, when they know they are losing, they may choose to aid an opponent rather than concede. This paper presents Lyre, an agent skilled at playing/communicating in Diplomacy and adept at working towards the benefit or harm of a given opponent - kingmaking. We parallel Lyre's kingmaking with real human Diplomacy games and analyze how Lyre can best play kingmaker. Results show statistically significant benefit in Lyre's boardplay, negotiation, and kingmaking.
- Open Access
- 20 July 2023
- Published by Springer Nature in Progress in Additive Manufacturing
- Vol. 9 (4) , 767-777
A hybrid metaheuristic and computer vision approach to closed-loop calibration of fused deposition modeling 3D printers
Fused deposition modeling (FDM) is one of the most popular additive manufacturing (AM) technologies for reasons including its low cost and versatility. However, like many AM technologies, the FDM process is sensitive to changes in the feedstock material. Utilizing a new feedstock requires a time-consuming trial-and-error process to identify optimal settings for a large number of process parameters. The experience required to efficiently calibrate a printer to a new feedstock acts as a barrier to entry. To enable greater accessibility to non-expert users, this paper presents the first system for autonomous calibration of low-cost FDM 3D printers that demonstrates optimizing process parameters for printing complex 3D models with submillimeter dimensional accuracy. Autonomous calibration is achieved by combining a computer vision-based quality analysis with a single-solution metaheuristic to efficiently search the parameter space. The system requires only a consumer-grade camera and computer capable of running modern 3D printing software and uses a calibration budget of just 30 g of filament (~ $1 USD). The results show that for several popular thermoplastic filaments, the system can autonomously calibrate a 3D printer to print complex 3D models with an average deviation in dimensional accuracy of 0.047 mm, which is more accurate than the 3D printer’s published tolerance of 0.1–0.4 mm.
- 20 July 2023
- Published by Springer Nature in Progress in Additive Manufacturing
- Vol. 9 (4) , 767-777
Open AccessA hybrid metaheuristic and computer vision approach to closed-loop calibration of fused deposition modeling 3D printers
Fused deposition modeling (FDM) is one of the most popular additive manufacturing (AM) technologies for reasons including its low cost and versatility. However, like many AM technologies, the FDM process is sensitive to changes in the feedstock material. Utilizing a new feedstock requires a time-consuming trial-and-error process to identify optimal settings for a large number of process parameters. The experience required to efficiently calibrate a printer to a new feedstock acts as a barrier to entry. To enable greater accessibility to non-expert users, this paper presents the first system for autonomous calibration of low-cost FDM 3D printers that demonstrates optimizing process parameters for printing complex 3D models with submillimeter dimensional accuracy. Autonomous calibration is achieved by combining a computer vision-based quality analysis with a single-solution metaheuristic to efficiently search the parameter space. The system requires only a consumer-grade camera and computer capable of running modern 3D printing software and uses a calibration budget of just 30 g of filament (~ $1 USD). The results show that for several popular thermoplastic filaments, the system can autonomously calibrate a 3D printer to print complex 3D models with an average deviation in dimensional accuracy of 0.047 mm, which is more accurate than the 3D printer’s published tolerance of 0.1–0.4 mm.
- 24 May 2023
- Published by Springer Nature
- p. 59-69
Incentivizing Information Gain in Hidden Information Multi-Action Games
- 24 May 2023
- Published by Springer Nature
- p. 59-69
Incentivizing Information Gain in Hidden Information Multi-Action Games
- 5 March 2023
- Published by Elsevier in Cognitive Systems Research
- Vol. 81, 11-24
Imitating human responses via a Dual-Process Model
- 5 March 2023
- Published by Elsevier in Cognitive Systems Research
- Vol. 81, 11-24
Imitating human responses via a Dual-Process Model