Piotr Switalski

Dr. Piotr Switalski

Faculty of Exact and Natural Sciences, University of Siedlce, Siedlce, Mazowieckie, Poland
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 May 2014 in Journal of Scheduling
Verified
Journal Article
Open access
PDF file
PSPiotr Switalski
Piotr Switalski
FSFranciszek Seredynski
Franciszek Seredynski
In this paper we propose an efficient offline job scheduling algorithm working in a grid environment that is based on a relatively new evolutionary metaheuristic called generalized extremal optimization (GEO). We compare our experimental results with those obtained using a very popular evolutionary metaheuristic, the genetic algorithm (GA). The scheduling algorithm implies two-stage scheduling. In the first stage, the algorithm allocates jobs to suitable machines of a grid; GEO/GA is used for this purpose. In the second stage, jobs are independently scheduled on each machine; this is performed with a variant of a list scheduling algorithm. Both GEO and GA belong to the class of evolutionary algorithms, but GEO is much simpler and requires the tuning of only one parameter, whereas GA requires the tuning of several parameters. The results of the experimental study show that GEO, despite its simplicity, outperforms the GA in a whole range of scheduling instances and is much easier to use.

14 March 2019 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
ANArtur Niewiadomski
Artur Niewiadomski
PSPiotr Switalski
Piotr Switalski
TSTeofil Sidoruk
Teofil Sidoruk
WPWojciech Penczek
Wojciech Penczek
We present nine SAT-solvers and compare their efficiency for several decision and combinatorial problems: three classical NP-complete problems of the graph theory, bounded Post correspondence problem (BPCP), extended string correction problem (ESCP),

23 December 2009 in Journal of Scheduling
Verified
Journal Article
Closed access
PDF file
PSPiotr Switalski
Piotr Switalski
FSFranciszek Seredynski
Franciszek Seredynski

27 February 2025 in Sensors
Verified
Journal Article
Open access
PDF file
FSFranciszek Seredynski
Franciszek Seredynski
MSMirosław Szaban
Mirosław Szaban
JSJaroslaw Skaruz
Jaroslaw Skaruz
PSPiotr Switalski
Piotr Switalski
MSMichal Seredyński
Michal Seredyński
In this paper, we focus on developing self-organizing algorithms aimed at solving, in a distributed way, the coverage problem in Wireless Sensor Networks (WSNs). For this purpose, we apply a game-theoretical framework based on an application of a variant of the Spatial Prisoner’s Dilemma game. The framework is used to build a multi-agent system, where agent-players in the process of iterated games tend to achieve a Nash equilibrium, providing them the possible maximal values of payoffs. A reached equilibrium corresponds to a global solution for the coverage problem represented by the following two objectives: coverage and the corresponding number of sensors that need to be turned on. A multi-agent system using the game-theoretic framework assumes the creation of a graph model of WSNs and the further interpretation of nodes of the WSN graph as agents participating in iterated games. We use the following two types of reinforcement learning machines as agents: Learning Automata (LA) and Cellular Automata (CA). The main novelty of the paper is the development of a specialized reinforcement learning machine based on the application of (ϵ,h)-learning automata. As the second model of an agent, we use the adaptive CA that we recently proposed. While both agent models operate in discrete time, they differ in the way they store and use available information. LA-based agents store in their memories the current information obtained in the last h-time steps and only use this information to make a decision in the next time step. CA-based agents only retain information from the last time step. To make a decision in the next time step, they participate in local evolutionary competitions that determine their subsequent actions. We show that agent-players reaching the Nash equilibria corresponds to the system achieving a global optimization criterion related to the coverage problem, in a fully distributed way, without the agents’ knowledge of the global optimization criterion and without any central coordinator. We perform an extensive experimental study of both models and show that the proposed learning automata-based model significantly outperforms the cellular automata-based model.

17 November 2016 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
ANArtur Niewiadomski
Artur Niewiadomski
JSJaroslaw Skaruz
Jaroslaw Skaruz
PSPiotr Switalski
Piotr Switalski
WPWojciech Penczek
Wojciech Penczek
The paper deals with the concrete planning problem – a stage of the web service composition in the PlanICS framework. We present several known and new methods of concrete planning including those based on Satisfiability Modulo Theories (SMT), Genetic