Miroslav Langer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Miroslav Langer has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Valenta
Institute of Computer Science, Faculty of Philosophy and Science in Opava, Silesian University in Opava, Opava, Czech Republic
5 shared publications Luděk Cienciala
Silesian University in Opava
4 shared publicationsLucie Ciencialová
Silesian University in Opava
3 shared publications- Lucie Ciencialová
Silesian University in Opava
3 shared publications - Pawan Kumar Patnaik
Department of Computer Science and Engineering, Bhilai Institute of Technology, Durg, India
3 shared publications Daniel Valenta
Silesian University in Opava
2 shared publications
Latest Publications
- Open Access
- 14 November 2025
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 8 (1) , 135-145
2D P colony for vicinity search optimisation
P colony is a formal computational model suitable for modelling behaviour of simple agents acting in a shared environment. It builds on the framework of membrane systems, where both the environment and agents contain abstract discrete objects and formal rules acting upon them. Adding a 2D geometrical structure and an evolution of the environment results in the model of 2D evolving P colonies. The model is suitable for the simulation of phenomena like stigmergy, hence also for the implementation of multi-agent optimisation strategies. The main motivation lies in the use of P colonies as a high-level description language for optimisation tasks, reconfigurable without programming, and ready for a highly parallel and efficient implementation by existing GPU libraries for P systems. In this paper, we use a 2D P colony to implement an ant colony-inspired optimisation algorithm. The agents—ants—search the environment for food representing the extrema of an objective function. The search is oriented with the help of pheromone trails left by previous agents. The trails are subject to a decay and can eventually vanish. In our previous research, we implemented via a 2D P colony a classical formulation of the ant algorithm where ants immediately collect found food in the nest. Here we introduce an improved 2D P colony implementation inspired by variants of ACO algorithms with local search. We call this variant a vicinity search and we demonstrate experimentally that it greatly improves the search results. Furthermore, the new solution decreases asymptotically the complexity of programs in agents.
- 14 November 2025
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 8 (1) , 135-145
Open Access2D P colony for vicinity search optimisation
P colony is a formal computational model suitable for modelling behaviour of simple agents acting in a shared environment. It builds on the framework of membrane systems, where both the environment and agents contain abstract discrete objects and formal rules acting upon them. Adding a 2D geometrical structure and an evolution of the environment results in the model of 2D evolving P colonies. The model is suitable for the simulation of phenomena like stigmergy, hence also for the implementation of multi-agent optimisation strategies. The main motivation lies in the use of P colonies as a high-level description language for optimisation tasks, reconfigurable without programming, and ready for a highly parallel and efficient implementation by existing GPU libraries for P systems. In this paper, we use a 2D P colony to implement an ant colony-inspired optimisation algorithm. The agents—ants—search the environment for food representing the extrema of an objective function. The search is oriented with the help of pheromone trails left by previous agents. The trails are subject to a decay and can eventually vanish. In our previous research, we implemented via a 2D P colony a classical formulation of the ant algorithm where ants immediately collect found food in the nest. Here we introduce an improved 2D P colony implementation inspired by variants of ACO algorithms with local search. We call this variant a vicinity search and we demonstrate experimentally that it greatly improves the search results. Furthermore, the new solution decreases asymptotically the complexity of programs in agents.
- Open Access
- 30 May 2024
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 6 (3) , 234-244
On simulation of the 2D P colony with evolving environment
To obtain more results in the field of formal models of multi-agent systems it is necessary to step outside of the research done on the paper and move forward to computer simulation. The simulation opens the possibilities to study the behavior of studied model in real-time, or verify designed configurations. To develop suitable application of a good quality and fulfilling all the needs, it is necessary to base the development on detailed analysis. In this paper, we present a development of a simulator of a 2D P colony with the evolving environment. The simulator replaces the previous version of the software we used to simulate the behavior of the 2D P colony with evolving environment. In the previous version, the configuration of the colony was hardcoded into the source code of the simulator; hence, any changes had to be done by developing a new version of the simulator. Recent version is modular and the definition of the simulated colony is held in the separate configuration file. The result of the development is an application in the Python programming language with desired features defined in the analysis of the application. The application was developed under the Open Source license; hence, it is freely accessible and can be used or modified by anyone.
- 30 May 2024
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 6 (3) , 234-244
Open AccessOn simulation of the 2D P colony with evolving environment
To obtain more results in the field of formal models of multi-agent systems it is necessary to step outside of the research done on the paper and move forward to computer simulation. The simulation opens the possibilities to study the behavior of studied model in real-time, or verify designed configurations. To develop suitable application of a good quality and fulfilling all the needs, it is necessary to base the development on detailed analysis. In this paper, we present a development of a simulator of a 2D P colony with the evolving environment. The simulator replaces the previous version of the software we used to simulate the behavior of the 2D P colony with evolving environment. In the previous version, the configuration of the colony was hardcoded into the source code of the simulator; hence, any changes had to be done by developing a new version of the simulator. Recent version is modular and the definition of the simulated colony is held in the separate configuration file. The result of the development is an application in the Python programming language with desired features defined in the analysis of the application. The application was developed under the Open Source license; hence, it is freely accessible and can be used or modified by anyone.
- Open Access
- 6 December 2023
- Published by Springer Nature in Research Square
On Simulation of the 2D P Colony with Evolving Environment
To obtain more results in the field of theoretical models of the multiagent systems it is necessary to step outside of the research done on the paper and move forward to the computer simulation. The simulation opens the possibilities to study the behavior of studied model in real-time, or verify designed configurations. To develop an application of a good quality and fulfilling all the needs, the development of such simulator must pass standard phases of the information system life cycle. In this paper, we present a development of a simulator of a 2D P colony with the evolving environment simulator. The simulator replaces the previous version of the software we used to simulate the behavior of the 2D P colony with evolving environment, where the configuration of the colony was hardcoded into the source code of the simulator, hence, any changes had to be done by developing a new version of the simulator. Recent version is modular and the definition of the simulated colony is held in the separate configuration file. During the development of the application, we followed phases of the information system life cycle. The result of the development is an application in the Python programming language with desired features. The application was developed under the Open Source license; hence, it is freely accessible and can be used or modified by anyone. MSC Classification: 68Q01 , 68Q07 , 68Q42
- 6 December 2023
- Published by Springer Nature in Research Square
Open AccessOn Simulation of the 2D P Colony with Evolving Environment
To obtain more results in the field of theoretical models of the multiagent systems it is necessary to step outside of the research done on the paper and move forward to the computer simulation. The simulation opens the possibilities to study the behavior of studied model in real-time, or verify designed configurations. To develop an application of a good quality and fulfilling all the needs, the development of such simulator must pass standard phases of the information system life cycle. In this paper, we present a development of a simulator of a 2D P colony with the evolving environment simulator. The simulator replaces the previous version of the software we used to simulate the behavior of the 2D P colony with evolving environment, where the configuration of the colony was hardcoded into the source code of the simulator, hence, any changes had to be done by developing a new version of the simulator. Recent version is modular and the definition of the simulated colony is held in the separate configuration file. During the development of the application, we followed phases of the information system life cycle. The result of the development is an application in the Python programming language with desired features. The application was developed under the Open Source license; hence, it is freely accessible and can be used or modified by anyone. MSC Classification: 68Q01 , 68Q07 , 68Q42
- Open Access
- 1 July 2023
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 5 (3) , 117-128
On evolving environment of 2D P colonies: ant colony simulation
P colonies are very simple membrane systems originally derived from the P systems. The 2D P colonies, as a version of P colonies with a two-dimensional environment, were introduced as a theoretical model of the multi-agent system for observing the behavior of a community of very simple agents living in a shared environment. Each agent is equipped with a set of programs consisting of a small number of simple rules. These programs allow the agent to act and move in the environment. Although, the 2D P colonies proved to be suitable for the simulations of various (not only) multi-agent systems, and natural phenomena, like the flash floods, there are phenomena which they are not able to simulate without some additional features or characteristics. One of the ways the agents can share the information is to use the stigmergy, which means to leave some special symbols in the environment. In this paper, we follow our previous research on the 2D P colony. We present a model of the 2D P colony with evolving environment, which allows us to simulate phenomena like the stigmergy, hence to simulate an ant colony.
- 1 July 2023
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 5 (3) , 117-128
Open AccessOn evolving environment of 2D P colonies: ant colony simulation
P colonies are very simple membrane systems originally derived from the P systems. The 2D P colonies, as a version of P colonies with a two-dimensional environment, were introduced as a theoretical model of the multi-agent system for observing the behavior of a community of very simple agents living in a shared environment. Each agent is equipped with a set of programs consisting of a small number of simple rules. These programs allow the agent to act and move in the environment. Although, the 2D P colonies proved to be suitable for the simulations of various (not only) multi-agent systems, and natural phenomena, like the flash floods, there are phenomena which they are not able to simulate without some additional features or characteristics. One of the ways the agents can share the information is to use the stigmergy, which means to leave some special symbols in the environment. In this paper, we follow our previous research on the 2D P colony. We present a model of the 2D P colony with evolving environment, which allows us to simulate phenomena like the stigmergy, hence to simulate an ant colony.
- 4 June 2021
- Published by Springer Nature
- p. 161-177
On Numerical 2D P Colonies with the Blackboard and the Gray Wolf Algorithm
- 4 June 2021
- Published by Springer Nature
- p. 161-177
On Numerical 2D P Colonies with the Blackboard and the Gray Wolf Algorithm
- Open Access
On Numerical 2D P Colonies Modelling the Grey Wolf Optimization Algorithm
The 2D P colonies is a version of the P colonies with a two-dimensional environment designed for observing the behavior of the community of very simple agents living in the shared environment. Each agent is equipped with a set of programs consisting of a small number of simple rules. These programs allow the agent to act and move in the environment. The 2D P colonies have been shown to be suitable for the simulations of various (not only) multi-agent systems, and natural phenomena, like flash floods. The Grey wolf algorithm is the optimization-based algorithm inspired by social dynamics found in packs of grey wolves and by their ability to create hierarchies, in which every member has a clearly defined role, dynamically. In our previous papers, we extended the 2D P colony by the universal communication device, the blackboard. The blackboard allows for the agents to share various information, e.g., their position or the information about their surroundings. In this paper, we follow our previous research on the numerical 2D P colony with the blackboard. We present the computer simulator of the numerical 2D P colony with the blackboard and the results of the computer simulation, and we compare these results with the original algorithm.
Open AccessOn Numerical 2D P Colonies Modelling the Grey Wolf Optimization Algorithm
The 2D P colonies is a version of the P colonies with a two-dimensional environment designed for observing the behavior of the community of very simple agents living in the shared environment. Each agent is equipped with a set of programs consisting of a small number of simple rules. These programs allow the agent to act and move in the environment. The 2D P colonies have been shown to be suitable for the simulations of various (not only) multi-agent systems, and natural phenomena, like flash floods. The Grey wolf algorithm is the optimization-based algorithm inspired by social dynamics found in packs of grey wolves and by their ability to create hierarchies, in which every member has a clearly defined role, dynamically. In our previous papers, we extended the 2D P colony by the universal communication device, the blackboard. The blackboard allows for the agents to share various information, e.g., their position or the information about their surroundings. In this paper, we follow our previous research on the numerical 2D P colony with the blackboard. We present the computer simulator of the numerical 2D P colony with the blackboard and the results of the computer simulation, and we compare these results with the original algorithm.
- 20 September 2020
- Published by STEF92 Technology
- Vol. 20, 231-238
ON 2D P COLONIES AND GREY WOLF ALGORITHM
P colonies (see [2]) are a well-established version of the P systems (see [3]), the computational device based on membrane computing. One branch of the research of the P-colonies focuses on the possibility to consider the two-dimensional environment, in which the agents act, and the 2D P colonies (see [1]) were introduced. 2D P colonies showed to be suitable for the simulations of various (not only) multi-agent systems, and natural phenomena, like the flash floods. The Grey wolf algorithm (see [4]) is the optimization-based algorithm inspired by social dynamics found in packs of grey wolves and by their ability to create dynamically hierarchies in which every member has a clearly defined role. The wolves’ primary goal is to find and hunt down prey, which in our case equals finding the optimal solution to the given problem. The grey wolf algorithm displays positive results thanks to the principles of randomness and communication between wolves. In this paper, we propose a model of the 2D P colonies with the blackboard. The only communicating device in the case of the 2D P colony is the environment, what is not sufficient for some kinds of multi-agent systems. The blackboard is a communication device accessible for all the agents at the same time, and it allows to share all the necessary information. An agent can read and write on the blackboard using its communicating rules. Using the blackboard allows us to simulate the grey wolf algorithm using the 2D P colony, describe and formalize the behavior of the wolves and agents in the multi-agent system in general.
- 20 September 2020
- Published by STEF92 Technology
- Vol. 20, 231-238
ON 2D P COLONIES AND GREY WOLF ALGORITHM
P colonies (see [2]) are a well-established version of the P systems (see [3]), the computational device based on membrane computing. One branch of the research of the P-colonies focuses on the possibility to consider the two-dimensional environment, in which the agents act, and the 2D P colonies (see [1]) were introduced. 2D P colonies showed to be suitable for the simulations of various (not only) multi-agent systems, and natural phenomena, like the flash floods. The Grey wolf algorithm (see [4]) is the optimization-based algorithm inspired by social dynamics found in packs of grey wolves and by their ability to create dynamically hierarchies in which every member has a clearly defined role. The wolves’ primary goal is to find and hunt down prey, which in our case equals finding the optimal solution to the given problem. The grey wolf algorithm displays positive results thanks to the principles of randomness and communication between wolves. In this paper, we propose a model of the 2D P colonies with the blackboard. The only communicating device in the case of the 2D P colony is the environment, what is not sufficient for some kinds of multi-agent systems. The blackboard is a communication device accessible for all the agents at the same time, and it allows to share all the necessary information. An agent can read and write on the blackboard using its communicating rules. Using the blackboard allows us to simulate the grey wolf algorithm using the 2D P colony, describe and formalize the behavior of the wolves and agents in the multi-agent system in general.
- 20 June 2019
- Published by STEF92 Technology
- Vol. 19
ON SYNTACTIC ANALYSIS FOR THE DATA STRUCTURE OF THE CONTEXTUAL BILINGUAL DICTIONARY
- 20 June 2019
- Published by STEF92 Technology
- Vol. 19
ON SYNTACTIC ANALYSIS FOR THE DATA STRUCTURE OF THE CONTEXTUAL BILINGUAL DICTIONARY
- Open Access
- 20 June 2018
- Published by STEF92 Technology
- Vol. 18
ON VARIANTS OF POSITIONED ECO-GRAMMAR SYSTEMS AND FINITE LANGUAGES
- 20 June 2018
- Published by STEF92 Technology
- Vol. 18
Open AccessON VARIANTS OF POSITIONED ECO-GRAMMAR SYSTEMS AND FINITE LANGUAGES
- Open Access
- 20 June 2018
- Published by STEF92 Technology
- Vol. 18
ON DATABASE REPRESENTATION OF DICTIONARIES
- 20 June 2018
- Published by STEF92 Technology
- Vol. 18
Open AccessON DATABASE REPRESENTATION OF DICTIONARIES