Applied sciences

Archives of Control Sciences

Content

Archives of Control Sciences | 2026 | vol. 36 | No 1

Download PDF Download RIS Download Bibtex

Abstract

The emergence of Game theory (GT) enabled with demand side management (DSM) has the applications in the field of smart grid applications. A mathematical method called game theory uses desirable rules to identify the circumstances under which all actors can win. Various agents can be used to optimize their gains. In terms of customer utility, demand response algorithms are categorized as agents in terms of customer utility. A centralized demand response (DR) scheduling algorithm that meets the varied energy consumption needs of a community can be difficult owing to the differences among residents. A non-cooperative DR-GT model is proposed to improve individual benefits in the energy consumption scheduling algorithm. The appliance information comprises different power levels to categorize the residents, which reduces the scheduling traffic between the residents and aggregator. There is a 23% reduction in the peak-to average ratio and increase in renewable energy usage by 13–25%, as better scheduling based on the flexibility of consumer loads and pricing schemes. Smart grid efficiency is improved by 23–30%, owing to reduced energy losses, fewer system imbalances, and lower wears on grid infrastructure.
Go to article

Authors and Affiliations

Murugeswari Palanisamy
1
ORCID: ORCID
Amalorpava Mary Rajee Samuel
2
ORCID: ORCID
Yamuna Devi Manickam.Malu
3
Priya Baldoss
4
ORCID: ORCID

  1. Department of Electronics and Communication Engineering, Sethu Institute of Technology Kariapatti-626 115,TN, India
  2. Department of Electricaland Information Engineering, University of Witwatersrand, Johannesburg, South Africa
  3. Department of Computer Science and Engineering, Koneru LakshmaiahEducation Foundation, Vijayawada, AP, India
  4. Department of CSE, Sri Sairam Engineering College, Chennai, India
Download PDF Download RIS Download Bibtex

Abstract

In this research work, we first obtain a new 3-D chaotic Lü system by modifying the dynamics of the classical Lü chaotic system (2002). Next, by introducing a state feedback to the new 3-D modified Lü chaotic system, we obtain a new 4-D hyperchaotic Lü system with a curve equilibrium.We carry out a detailed bifurcation analysis of the new4-D hyperchaotic system with a curve equilibrium and describe the bifurcation transition diagrams and Lyapunov exponents diagrams.We also derive new multistability results of the new 4-D hyperchaotic Lü system with a curve equilibrium. For engineering applications, we provide an electronic circuit simulation of the proposed hyperchaotic Lü system using MultiSim 14.0. As a control application, we derive new results for the complete synchronization for a pair of new hyperchaotic Lü systems taken as the master and slave systems. We have used integral sliding mode control for the derivation of the synchronizing control law for the complete synchronization design for the new hyperchaotic Lü system. MATLAB simulations are provided to illustrate the main results of this research work.
Go to article

Authors and Affiliations

Sundarapandian Vaidyanathan
1
ORCID: ORCID
Fareh Hannachi
2
ORCID: ORCID
Irene M. Moroz
3
ORCID: ORCID
Mohamad Afendee Mohamed
4
ORCID: ORCID
Aceng Sambas
5
ORCID: ORCID
R. Bullibabu
6

  1. Centre for Control Systems, Vel Tech University, 400 Feet Outer Ring Road, Avadi, Chennai-600062 Tamil Nadu, India andFaculty of Information and Computing, Universiti Sultan Zainal Abidin Terengganu, Malaysia
  2. Department of Management Sciences,Echahid Cheikh Larbi Tebessi University, Route de Constantine, 12022, Tebessa, Algeria
  3. Mathematical Institute, University of Oxford, Andrew Wiles Building, ROQ, Oxford Ox2 6GG, UK
  4. Faculty of Information and Computing, Universiti Sultan Zainal Abidin, Terengganu, Malaysia
  5. Faculty of Informaticsand Computing, Universiti Sultan ZainalAbidin, Gong Badak, 21300, Terengganu, Malaysia and Departmentof Mechanical Engineering, Universitas Muhammadiyah Tasikmalaya, Jawa Barat 46196, Indonesia
  6. Department of Artificial Intelligence, Machine Learning and Data Science, KITS Akshar Institute of Technology, NH-16, Yanamadala, Guntur-522019, Andhra Pradesh, India
Download PDF Download RIS Download Bibtex

Abstract

As cyberattacks become more advanced, advanced AI-based big data visualization is now needed for effective threat detection. Yet, choosing the best visualization tools is some multicriteria decision-making (MCDM) task that involves considering many criteria containing both positive and negative aspects. WhileMCDMmethods that address the selection and classification of AI-driven big data visualization tools focus on the positive aspects of the evaluation criteria and ignore the negative aspects of the criteria, resulting in incomplete evaluations. Further, although Einstein operators have shown strong results in uncertain and imprecise situations and MCDM approaches, they have not yet been used in bipolar fuzzy frameworks, which leaves a major gap in decision-making methods. To overcome these problems, this article interprets a bipolar fuzzy MCDM methodology based on Einstein prioritized operators to systematically evaluate and classify AI-driven big data visualization tools for cybersecurity threat detection. For this method, Einstein prioritized operators within a bipolar fuzzy framework devised in this article, which can aggregate both positive and negative aspects of the criteria.Acomprehensive case study is shown to assess and classify the prominent AI-driven big data visualization tools for cybersecurity threat detection, considering critical criteria with dual aspects. The proposed methodology is meticulously compared with the prevailing MCDM methods to validate its dominance in handling uncertainty and the bipolarity of the criteria. This article helps security professionals choose the right AI-powered visualization tools which, in turn improve the cybersecurity of their organizations and make it easier to detect threats.
Go to article

Authors and Affiliations

Ubaid ur Rehman
1
ORCID: ORCID
Tahir Mahmood
2
ORCID: ORCID
Hafiz Muhammad Waqas
2
ORCID: ORCID
Abaid ur Rehman Virk
1
ORCID: ORCID

  1. Department of Mathematics, University of Management and Technology, C-II, Johar Town, Lahore, 54700, Punjab, Pakistan
  2. Department of Mathematics and Statistics, International Islamic University Islamabad, Islamabad 44000, Pakistan
Download PDF Download RIS Download Bibtex

Abstract

The aim of this paper is to analyze the development of algorithms for Fast Matrix Multiplication (FMM) in both historical and technical contexts, as well as to compare available solutions on consumer-grade computer hardware. We review advancements in estimating the theoretical computational complexity of FMM and optimization techniques that are used in widely adopted algorithms, with a particular focus on optimal cache memory usage and leveraging Graphics Processing Units (GPU). The methodology of tests and their analysis highlight the performance differences of the considered algorithms depending on the matrix size and the nature of the data stored in them. Results indicate the significant role of tailoring the chosen algorithm to the available hardware and the specific application in which the algorithm is being performed. Also, we emphasize that the FMM algorithms can be applied not only to linear algebra problems but also to current problems in science and engineering, such as artificial intelligence, databases, parallel computations, computational biology, pattern recognition, and compiler construction, to mention just a few examples.
Go to article

Authors and Affiliations

Marek Kubale
1
ORCID: ORCID
Damian Niemczyk
2

  1. Gdynia Maritime University, Faculty of Computer Science, Gdynia, Poland
  2. Gdańsk University of Technology, Facultyof Electronics, Telecommunications and Informatics, Gdańsk, Poland
Download PDF Download RIS Download Bibtex

Abstract

This paper presents a novel computational framework for assessing cardiovascular disease (CVD) risk by integrating unsupervised clustering techniques with survival analysis. The proposed method enables dynamic and individualized risk prediction by organizing patient data into structured clusters based on shared cardiovascular risk factors. The framework begins with competitive learning, an unsupervised clustering method, to group patients into clusters that reflect distinct risk profiles. Each cluster is represented by its centroid, calculated as the mean of the 9-dimensional feature vectors of its members, ensuring that the clusters effectively summarize patient data while preserving critical risk characteristics. For each cluster, an independent Cox Proportional Hazards Model is applied to analyze survival data, capturing the unique relationships between cardiovascular risk factors and survival outcomes within that cluster. A key innovation of this study is the introduction of the Cumulative Prevalence Ratio (CPR), a new metric that aggregates hazard rates over time separately for each cluster. This approach provides a comprehensive view of cumulative cardiovascular risk, enabling precise categorization of the patient into risk groups based on cumulative exposure to evolving risk factors. By integrating cluster-specific hazard functions and temporal risk metrics, the proposed framework improves the precision and adaptability of CVD risk predictions, paving the way for personalized and data-driven healthcare interventions.
Go to article

Authors and Affiliations

Himanshi Liyanage
1
ORCID: ORCID
Marta Lipnicka
1
ORCID: ORCID

  1. Faculty of Mathematics and Computer Science, University of Lodz, Stefana Banacha 22, 90-238 Łódź, Poland
Download PDF Download RIS Download Bibtex

Abstract

This work presents a reinforcement learning framework for controlling a planar threesection continuum robot in environments with static obstacles. Assuming constant curvature for each section, the robot is trained to navigate toward a fixed goal while avoiding collisions with multiple static objects. A custom simulation environment was developed to support three levels of scenario difficulty, easy, medium and hard, each with varying obstacle density and placement. The learning process is driven by the Deep Deterministic Policy Gradient (DDPG) algorithm, which enables smooth and continuous curvature control. Careful attention was paid to the design of the reward function and the network architecture, both of which were critical to achieving stable and reliable policy learning. Performance was evaluated across multiple runs, revealing that the agent successfully generalized its behavior across scenarios of increasing complexity. The proposed framework demonstrates the potential of reinforcement learning as a viable approach to safe and adaptive control in continuum robotic systems, with promising implications for applications such as medical navigation, search and rescue, and inspection in confined environments.
Go to article

Authors and Affiliations

Jakub Kołota
1
ORCID: ORCID
Turhan Can Kargin
2
ORCID: ORCID

  1. Institute of Automatic Control and Robotics, Poznan University of Technology, Piotrowo 3A, 60-965 Poznań, Poland
  2. unafiliated, Izmir, Turkey
Download PDF Download RIS Download Bibtex

Abstract

In this paper, we provide some sufficient conditions for the exponential stability of solutions of nonlinear impulsive differential systems by using some inequality of Gronwall-Bellman type. Practical exponential stability is also investigated for a class of perturbed impulsive systems. Several numerical examples are provided to demonstrate the effectiveness of the theoretical results. Furthermore, Hopfield neural networks system is discussed as an application.
Go to article

Authors and Affiliations

Wided Gouadri
1
ORCID: ORCID
Mohamed Ali Hammami
1
ORCID: ORCID

  1. Laboratory Stability and Control of Systems and NonlinearPDEs, University of Sfax, Faculty of Sciences of Sfax, Tunisia
Download PDF Download RIS Download Bibtex

Abstract

The invariant properties of the stability, reachability, observability and transfer matrices of positive linear continuous-time systems with integer and fractional orders are investigated. It is shown that the stability, reachability, observability and transfer matrix of positive linear systems are invariant under their integer and fractional orders.
Go to article

Authors and Affiliations

Tadeusz Kaczorek
1
ORCID: ORCID

  1. Faculty of Electrical Engineering, Bialystok University of Technology, Wiejska 45D, 15-351 Białystok, Poland
Download PDF Download RIS Download Bibtex

Abstract

This article addresses modeling systems using fractional order derivatives, highlighting three basic approaches: differential equations, operator methods, and state space representations. Each approach carries different advantages and limitations in the context of time invariant linear systems (LTI) of fractional order. The focus of the article is on Fractional Order Transfer Functions, which represent a special subject of interest because they offer practical utility with available simulation libraries (e.g., CRONE, FOMCON, NiNteger) and approximation techniques (e.g., Oustaloup, CFE, Thiele, Padé). This paper describes a transition between fractional order transfer functions (FOTF) and pseudo-rational representations of such systems. While the existing literature contains the basics of fractional differential equations and operator theory, it often omits explicit formulas for conversion between different representations. The paper fills a significant gap by proposing a novel algorithm for converting FOTF models to fractional LTI representations. Unlike previous works that implicitly assume such transitions exist, this paper provides formulas for coefficient transformations and demonstrates its effectiveness by minimizing the degree of the system.
Go to article

Authors and Affiliations

Jacek Jagodziński
1
ORCID: ORCID
Marta Lampasiak
1
ORCID: ORCID

  1. Faculty of Information and Communication Technology, Department of Control and Quantum Computing, Wrocław University of Science and Technology, Wrocław, Poland

Instructions for authors

Each paper submitted is subject to a review procedure, and the publication decision is based on reviers' comments on the paper. To avoid delay, please prepare the manuscript carefully following the suggestions listed below.

Computer file of the manuscript may be sent by e-mail to the address of Assistant Editor or acs@polsl.pl. Preferred text processors is TeX or LaTeX, however Word and other processors are also acceptable. In case of difficulties in processing the text, the author may be asked to supply the ASCII export of the original file.

Manuscripts sent via ordinary post should be typewritten double-spaced on one side of a standard size (A4) paper. Left side margin should be approximately 3cm (1.2'') wide. Each page should contain approximately 30 lines of 60 characters each. The manuscript including figures and tables together with their captions should be submitted. A separate signed letter giving the Author's preferred address for correspondence and return of proofs should be enclosed. Manuscript is the basis for editorial work.

First page should include the title of the paper, first name(s) and surname(s) of the Author(s), and a short summary (abstract), not longer than 20 lines.

Keywords of max. 5 - 7 items should be included in manuscript.

Numeration. All chapters, including the introduction, should be numbered in arabic numerals. Equations, tables and figures as well as theorems, corollaries, examples etc., should be numbered consecutively throughout the paper in arabic numerals, except in appendices. Appendices should be numbered with capital letters, and numeration should be closed within individual appendices.

If the manuscript is not prepared with TeX, mathematical expressions should be carefully written so as not to arouse confusion. Care should be taken that subscripts and superscripts are easily readable.

Tables and figures should be placed as desired by the Author within the text or on separate sheets with their suggested location indicated by the number of table or figure in the text. Figures, graphs and pictures (referred to as Fig. in the manuscript) should be numbered at the beginning of their caption following the figure. All figures should be prepared as PostScript EPS files or LaTeX picture files; in special cases, bitmaps of figure are also acceptable. The numbers and titles of tables should be placed above the main body of each table.

References should be listed alphabetically at the end of the manuscript. They should be numbered in ascending order and the numbers should be inserted in square brackets. References should be organized as follows. First initial(s), surname(s) of the author(s) and title of article or book. Then, for papers: title of periodical or collective work, volume number (year of issue), issue number, and numbers of the first and the last page; for books: publisher's name(s), place and year of issue. Example:

  1. R. E. Kalman: Mathematical description of linear dynamical system. SIAM J. Control. 1(2), (1963), 152-192.
  2. F. C. Shweppe: Uncertain dynamic systems. Prentice-Hall, Englewood Cliffs, N.J. 1970.


Please, give full titles of journals; only common words like Journal, Proceedings, Conference, etc. may be abbreviated ( to J., Proc., Conf., ... respectively). References to publications in the body of the manuscript should be indicated by the numbers of the adequate references in square brackets. When the paper is set in TeX the preferable form of preparing references is Bib TeX bib database.

Footnotes should be placed in the manuscript, beginning with "Received..." (date to be filled in by Editor), the author's institutional affiliation and acknowledgement of financial support,

This page uses 'cookies'. Learn more