PÉREZ HURTADO DE MENDOZA , Ignacio

La presente memoria está estructurada en tres partes que constan de un total de siete capítulos cuyos contenidos se describen sucintamente a continuación. Parte I: Preliminares La memoria comienza con un breve recorrido histórico acerca del desarrollo y evolución de diversos conceptos relacionados con la Teoría de la Computación y la Teoría...

Methods based on Rapidly-exploring Random Trees (RRTs) have been in use in robotics to solve motion planning problems for nearly two decades. On the other hand, models based on Enzymatic Numerical P systems (ENPS) have been applied to robot controllers for more than six years. These controllers in real robots handle the power of motors...

It is a long-cherished wish to implement numerical P systems (NPS) on a parallel architecture so that its large scale parallelism can be exploited to speedup computation tremendously. FPGA is a reconfigurable hardware in which operations are triggered so synchronized by edge or level of activating signals, making it an eligible platform...

Robots navigating in a social way should use some knowledge about common motion patterns of people in the environment. Moreover, it is known that people move intending to reach certain points of interest, and machine learning techniques have been widely used for acquiring this knowledge by observation. Learning algorithms such as Growing...

This article introduces a formalism/framework able to describe different variants of P systems having a dynamic structure. This framework can be useful for the definition of new variants of P systems with dynamic structure, for the comparison of existing definitions as well as for their extension. We give a precise definition of the formalism...

Robots navigating in a social way should reason about people intentions when acting. For instance, in applications like robot guidance or meeting with a person, the robot has to consider the goals of the people. Intentions are inherently nonobservable, and thus we propose Partially Observable Markov Decision Processes (POMDPs) as a...

This article introduces a general formalism/framework flexible enough to cover descriptions of different variants of P systems having a dynamic membrane structure. Our framework can be useful for the precise definition of new variants of P systems with a dynamic structure and for the comparison of existing definitions as well as for their...

Membrane computing is a bio-inspired computing paradigm that lacks in vivo implementation. That is why software or hardware implementations have to be used to validate models. Several tools have been created for this purpose; some of them are created for specific purposes, such as solving a computationally hard problem; and others are...

Methods based on Rapidly-exploring Random Trees (RRTs) have been in use in robotics to solve motion planning problems for nearly two decades. On the other hand, in the membrane computing framework, models based on Enzymatic Numerical P systems (ENPS) have been applied to robot controllers. These controllers handle the power of motors...

Methods based on Rapidly-exploring Random Trees (RRTs) have been widely used in robotics to solve motion planning problems. On the other hand, in the membrane computing framework, models based on Enzymatic Numerical P systems (ENPS) have been applied to robot controllers, but today there is a lack of planning algorithms based on membrane...

Ministerio de Economía, Industria y Competitividad TIN2017-89842-P

P system simulators are critical tools to enable them as formal modeling framework for real-life applications. Such simulators abstract the concept of P systems in various ways, depending on the needs of the users and the requirements of the specific application. We identify three main levels of abstraction: graphical user interfaces,...

P system simulators are of high importance in Membrane Computing, since they provide tools to assist on model validation and verification. Keeping a balance between generality and flexibility, on the one side, and efficiency, on the other hand, is always challenging, but it is worth the effort. Besides, in order to prove the feasibility of P...

The dependency graph technique was initially thought as a method to find short paths in the computation tree of a membrane system using weak metrics. It could be used to obtain reasonably fast SAT-solvers, capable of competing with the ones available in the literature. Later on, they were used as a method to demonstrate the non-efficiency...

Formal verification of P systems using model checking has attracted a significant amount of research in recent years. However, up to now only P systems with static structure have been considered. This paper makes significant advances in this area by considering P systems with active membranes, in particular P systems with division rules....

Software development for cellular computing has already been addressed, yielding a first generation of applications. In this paper, we develop a new programming language: P-Lingua. Furthermore, we present a simulator for the class of recognizing P systems with active membranes. We illustrate it by giving a solution to the SAT problem as an example.

P systems provide a high level computational modelling framework that combines the structural and dynamical aspects of ecosystems in a compressive and relevant way. The inherent randomness and uncertainty in biological systems is captured by using probabilistic strategies. The design of efficient simulation algorithms in order to reproduce the...

A new programming language for membrane computing, PLingua, is developed in this paper. This language is not designed for a speci c simulator software. On the contrary, its purpose is to o er a general syntactic framework that could de ne a uni ed standard for membrane computing, covering a broad variety of models. At the present stage,...

Membrane Computing has recently proved to be a suitable framework for addressing the modelling of dynamical biological systems in general, and ecosystems in particular. Due to the inherent randomness and uncertainty in biological systems, when designing a model the relevant tasks to be addressed are the validation and virtual...