Proximal Policy Optimization-Based Reinforcement Learning and Hybrid Approaches to Explore the Cross Array Task Optimal Solution
-
Published:2023-11-20
Issue:4
Volume:5
Page:1660-1679
-
ISSN:2504-4990
-
Container-title:Machine Learning and Knowledge Extraction
-
language:en
-
Short-container-title:MAKE
Author:
Corecco Samuel1, Adorni Giorgia2ORCID, Gambardella Luca Maria2
Affiliation:
1. Faculty of Informatics, Università della Svizzera Italiana (USI), 6900 Lugano, Switzerland 2. Dalle Molle Institute for Artificial Intelligence (IDSIA), USI-SUPSI, 6900 Lugano, Switzerland
Abstract
In an era characterised by rapid technological advancement, the application of algorithmic approaches to address complex problems has become crucial across various disciplines. Within the realm of education, there is growing recognition of the pivotal role played by computational thinking (CT). This skill set has emerged as indispensable in our ever-evolving digital landscape, accompanied by an equal need for effective methods to assess and measure these skills. This research places its focus on the Cross Array Task (CAT), an educational activity designed within the Swiss educational system to assess students’ algorithmic skills. Its primary objective is to evaluate pupils’ ability to deconstruct complex problems into manageable steps and systematically formulate sequential strategies. The CAT has proven its effectiveness as an educational tool in tracking and monitoring the development of CT skills throughout compulsory education. Additionally, this task presents an enthralling avenue for algorithmic research, owing to its inherent complexity and the necessity to scrutinise the intricate interplay between different strategies and the structural aspects of this activity. This task, deeply rooted in logical reasoning and intricate problem solving, often poses a substantial challenge for human solvers striving for optimal solutions. Consequently, the exploration of computational power to unearth optimal solutions or uncover less intuitive strategies presents a captivating and promising endeavour. This paper explores two distinct algorithmic approaches to the CAT problem. The first approach combines clustering, random search, and move selection to find optimal solutions. The second approach employs reinforcement learning techniques focusing on the Proximal Policy Optimization (PPO) model. The findings of this research hold the potential to deepen our understanding of how machines can effectively tackle complex challenges like the CAT problem but also have broad implications, particularly in educational contexts, where these approaches can be seamlessly integrated into existing tools as a tutoring mechanism, offering assistance to students encountering difficulties. This can ultimately enhance students’ CT and problem-solving abilities, leading to an enriched educational experience.
Funder
Swiss National Science Foundation
Subject
Artificial Intelligence,Engineering (miscellaneous)
Reference63 articles.
1. The CT-cube: A framework for the design and the assessment of computational thinking activities;Piatti;Comput. Hum. Behav. Rep.,2022 2. Computational thinking;Wing;Commun. ACM,2006 3. Seehorn, D., Carey, S., Fuschetto, B., Lee, I., Moix, D., O’Grady-Cunniff, D., Owens, B.B., Stephenson, C., and Verno, A. (2011). CSTA K–12 Computer Science Standards: Revised 2011, Association for Computing Machinery. 4. Bringing Computational Thinking to K-12: What is Involved and What is the Role of the Computer Science Education Community?;Barr;ACM Inroads,2011 5. Poulakis, E., and Politis, P. (2021). Research on E-Learning and ICT in Education: Technological, Pedagogical and Instructional Perspectives, Springer International Publishing.
|
|