Tomasz Kulpa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Tomasz Kulpa has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Krzysztof Trojanowski
Cardinal Stefan Wyszynski University in Warsaw
6 shared publications - Franciszek Seredynski
Institute of Computer Science University of Siedlce
4 shared publications - Rolf Hoffmann
Technical University Darmstadt
4 shared publications Dominique Désérable
Institut National des Sciences Appliquées
1 shared publication- Dominique Désérable
Institut National des Sciences Appliquées Rennes France
1 shared publication Krzysztof Trojanowski
1 shared publication
Latest Publications
- Open Access
Coverage and Lifetime Optimization by Self-Optimizing Sensor Networks
We propose an approach to self-optimizing wireless sensor networks (WSNs) which are able to find, in a fully distributed way, a solution to a coverage and lifetime optimization problem. The proposed approach is based on three components: (a) a multi-agent, social-like interpreted system, where the modeling of agents, discrete space, and time is provided by a 2-dimensional second-order cellular automata, (b) the interaction between agents is described in terms of the spatial prisoner’s dilemma game, and (c) a local evolutionary mechanism of competition between agents exists. Nodes of a WSN graph created for a given deployment of WSN in the monitored area are considered agents of a multi-agent system that collectively make decisions to turn on or turn off their batteries. Agents are controlled by cellular automata (CA)-based players participating in a variant of the spatial prisoner’s dilemma iterated game. We propose for players participating in this game a local payoff function that incorporates issues of area coverage and sensors energy spending. Rewards obtained by agent players depend not only on their personal decisions but also on their neighbor’s decisions. Agents act in such a way to maximize their own rewards, which results in achieving by them a solution corresponding to the Nash equilibrium point. We show that the system is self-optimizing, i.e., can optimize in a distributed way global criteria related to WSN and not known for agents, provide a balance between requested coverage and spending energy, and result in expanding the WSN lifetime. The solutions proposed by the multi-agent system fulfill the Pareto optimality principles, and the desired quality of solutions can be controlled by user-defined parameters. The proposed approach is validated by a number of experimental results.
Open AccessCoverage and Lifetime Optimization by Self-Optimizing Sensor Networks
We propose an approach to self-optimizing wireless sensor networks (WSNs) which are able to find, in a fully distributed way, a solution to a coverage and lifetime optimization problem. The proposed approach is based on three components: (a) a multi-agent, social-like interpreted system, where the modeling of agents, discrete space, and time is provided by a 2-dimensional second-order cellular automata, (b) the interaction between agents is described in terms of the spatial prisoner’s dilemma game, and (c) a local evolutionary mechanism of competition between agents exists. Nodes of a WSN graph created for a given deployment of WSN in the monitored area are considered agents of a multi-agent system that collectively make decisions to turn on or turn off their batteries. Agents are controlled by cellular automata (CA)-based players participating in a variant of the spatial prisoner’s dilemma iterated game. We propose for players participating in this game a local payoff function that incorporates issues of area coverage and sensors energy spending. Rewards obtained by agent players depend not only on their personal decisions but also on their neighbor’s decisions. Agents act in such a way to maximize their own rewards, which results in achieving by them a solution corresponding to the Nash equilibrium point. We show that the system is self-optimizing, i.e., can optimize in a distributed way global criteria related to WSN and not known for agents, provide a balance between requested coverage and spending energy, and result in expanding the WSN lifetime. The solutions proposed by the multi-agent system fulfill the Pareto optimality principles, and the desired quality of solutions can be controlled by user-defined parameters. The proposed approach is validated by a number of experimental results.
- 13 March 2023
- Published by Elsevier in Journal of Computational Science
- Vol. 68
Evolutionary self-optimization of large CA-based multi-agent systems
- 13 March 2023
- Published by Elsevier in Journal of Computational Science
- Vol. 68
Evolutionary self-optimization of large CA-based multi-agent systems
- 13 August 2022
- Published by Springer Nature
- p. 208-219
Towards Self–optimizing Sensor Networks: Game–Theoretic Second–Order CA–Based Approach
- 13 August 2022
- Published by Springer Nature
- p. 208-219
Towards Self–optimizing Sensor Networks: Game–Theoretic Second–Order CA–Based Approach
- 15 June 2022
- Published by Springer Nature
- p. 610-623
Competition and Cooperation Mechanisms for Collective Behavior in Large Multi-agent Systems
- 15 June 2022
- Published by Springer Nature
- p. 610-623
Competition and Cooperation Mechanisms for Collective Behavior in Large Multi-agent Systems
- 7 October 2020
- Published by Springer Nature
- p. 566-575
Particle Classification Based on Movement Behavior in IPSO Stochastic Model
- 7 October 2020
- Published by Springer Nature
- p. 566-575
Particle Classification Based on Movement Behavior in IPSO Stochastic Model
- 30 May 2019
- Published by Springer Nature
- p. 1-18
Particle Stability Time in the Stochastic Model of PSO
- 30 May 2019
- Published by Springer Nature
- p. 1-18
Particle Stability Time in the Stochastic Model of PSO
- 4 October 2018
- Published by Springer Nature
- p. 67-86
Particle Convergence Expected Time in the Stochastic Model of PSO
- 4 October 2018
- Published by Springer Nature
- p. 67-86
Particle Convergence Expected Time in the Stochastic Model of PSO
- Open Access
- 1 January 2017
- Published by INSTICC
- p. 273-280
Particle Stability in PSO under Stagnation Assumption
- 1 January 2017
- Published by INSTICC
- p. 273-280
Open AccessParticle Stability in PSO under Stagnation Assumption
- 24 November 2016
- Published by Springer Nature
- p. 175-194
Particle Convergence Time in the Deterministic Model of PSO
- 24 November 2016
- Published by Springer Nature
- p. 175-194
Particle Convergence Time in the Deterministic Model of PSO