Deep Learning and Adaptive Control, 3rd Edition

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Mathematics and Computer Science".

Deadline for manuscript submissions: 28 February 2025 | Viewed by 506

Special Issue Editors


E-Mail Website
Guest Editor
School of Mechanical and Electrical Engineering, Guangzhou University, Guangzhou 510006, China
Interests: adaptive control; learning control; flexible mechanical systems
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Institute of Artificial Intelligence & School of Automation and Electrical Engineering, University of Science and Technology Beijing, Beijing 100083, China
Interests: boundary control of distributed parameter systems; soft robots; intelligent control
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Deep learning is a research hotspot in artificial intelligence, machine learning, and data science. It has made many achievements in search technology, machine learning, machine translation, natural language processing, and other related fields. The applications of deep learning are undoubtedly worthy of attention. Recent results in deep learning have left no doubt that it is amongst the most powerful modeling and control tools that we possess. The real question is how we can utilize deep learning for control without losing stability and performance guarantees. At present, with the increasing number of data to be processed, the calculation process is more complex and cumbersome than before, and the efficiency of the algorithm may be reduced due to overfitting. As the models become more and more complex, their interpretability will be reduced, and the performance as well as efficacy of the algorithms will be reduced accordingly, which requires further research. Even though recent successes in deep reinforcement learning (DRL) have shown that deep learning can be a powerful value function approximator, several key questions must be answered before deep learning enables a new frontier in unmanned systems.

The Special Issue on the research progress in deep learning will help to update the most advanced methods, technologies, and applications in this field. DRL is closely tied theoretically to adaptive control. Recent work has shown how to use DRL to develop new forms of adaptive controllers that effectively deal with some existing open problems in adaptive control, such as handling unmatched uncertainties. Any actual system has varying degrees of uncertainty. When facing the changes in internal characteristics and the influence of external disturbances, it is necessary to adopt adaptive control. Since its first development, adaptive control has been keeping pace with the development of science and engineering, and more new methods as well as applications have been introduced over time. This Special Issue aims to introduce the latest progress in adaptive control theory and application. The key points are system modeling, parameter identification, structural analysis, controller design, performance analysis, and the application research results of adaptive control algorithms. We are looking for the latest research results in deep learning and adaptive control. Topics of interest include, but are not limited to, the keywords listed below.

Prof. Dr. Zhijia Zhao
Prof. Dr. Zhijie Liu
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • deep learning, CNN, RNN, transformer model
  • optimization of deep learning
  • applications of deep learning
  • reinforcement-learning-based control
  • applications of reinforcement learning
  • adaptive iterative learning control
  • modeling of adaptive systems
  • design of adaptive controllers
  • application of adaptive control

Related Special Issue

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

28 pages, 5264 KiB  
Article
Remote-Sensing Satellite Mission Scheduling Optimisation Method under Dynamic Mission Priorities
by Xiuhong Li, Chongxiang Sun, Huilong Fan and Jiale Yang
Mathematics 2024, 12(11), 1704; https://doi.org/10.3390/math12111704 - 30 May 2024
Abstract
Mission scheduling is an essential function of the management control of remote-sensing satellite application systems. With the continuous development of remote-sensing satellite applications, mission scheduling faces significant challenges. Existing work has many inherent shortcomings in dealing with dynamic task scheduling for remote-sensing satellites. [...] Read more.
Mission scheduling is an essential function of the management control of remote-sensing satellite application systems. With the continuous development of remote-sensing satellite applications, mission scheduling faces significant challenges. Existing work has many inherent shortcomings in dealing with dynamic task scheduling for remote-sensing satellites. In high-load and complex remote sensing task scenarios, there is low scheduling efficiency and a waste of resources. The paper proposes a scheduling method for remote-sensing satellite applications based on dynamic task prioritization. This paper combines the and Bound methodologies with an onboard task queue scheduling band in an active task prioritization context. A purpose-built emotional task priority-based scheduling blueprint is implemented to mitigate the flux and unpredictability characteristics inherent in the traditional satellite scheduling paradigm, improve scheduling efficiency, and fine-tune satellite resource allocation. Therefore, the Branch and Bound method in remote-sensing satellite task scheduling will significantly save space and improve efficiency. The experimental results show that comparing the technique to the three heuristic algorithms (GA, PSO, DE), the BnB method usually performs better in terms of the maximum value of the objective function, always finds a better solution, and reduces about 80% in terms of running time. Full article
(This article belongs to the Special Issue Deep Learning and Adaptive Control, 3rd Edition)
Show Figures

Figure 1

23 pages, 2938 KiB  
Article
An Improved Expeditious Meta-Heuristic Clustering Method for Classifying Student Psychological Issues with Homogeneous Characteristics
by Muhammad Suhail Shaikh, Xiaoqing Dong, Gengzhong Zheng, Chang Wang and Yifan Lin
Mathematics 2024, 12(11), 1620; https://doi.org/10.3390/math12111620 - 22 May 2024
Viewed by 331
Abstract
Nowadays, cluster analyses are widely used in mental health research to categorize student stress levels. However, conventional clustering methods experience challenges with large datasets and complex issues, such as converging to local optima and sensitivity to initial random states. To address these limitations, [...] Read more.
Nowadays, cluster analyses are widely used in mental health research to categorize student stress levels. However, conventional clustering methods experience challenges with large datasets and complex issues, such as converging to local optima and sensitivity to initial random states. To address these limitations, this research work introduces an Improved Grey Wolf Clustering Algorithm (iGWCA). This improved approach aims to adjust the convergence rate and mitigate the risk of being trapped in local optima. The iGWCA algorithm provides a balanced technique for exploration and exploitation phases, alongside a local search mechanism around the optimal solution. To assess its efficiency, the proposed algorithm is verified on two different datasets. The dataset-I comprises 1100 individuals obtained from the Kaggle database, while dataset-II is based on 824 individuals obtained from the Mendeley database. The results demonstrate the competence of iGWCA in classifying student stress levels. The algorithm outperforms other methods in terms of lower intra-cluster distances, obtaining a reduction rate of 1.48% compared to Grey Wolf Optimization (GWO), 8.69% compared to Mayfly Optimization (MOA), 8.45% compared to the Firefly Algorithm (FFO), 2.45% Particle Swarm Optimization (PSO), 3.65%, Hybrid Sine Cosine with Cuckoo search (HSCCS), 8.20%, Hybrid Firefly and Genetic Algorithm (FAGA) and 8.68% Gravitational Search Algorithm (GSA). This demonstrates the effectiveness of the proposed algorithm in minimizing intra-cluster distances, making it a better choice for student stress classification. This research contributes to the advancement of understanding and managing student well-being within academic communities by providing a robust tool for stress level classification. Full article
(This article belongs to the Special Issue Deep Learning and Adaptive Control, 3rd Edition)
Show Figures

Figure 1

Back to TopTop