No abstract

No abstract

A hybrid path planning algorithm based on membrane pseudo-bacterial potential field (MemPBPF) is proposed. Membrane-inspired algorithms can reach an evolutionary behavior based on biochemical processes to find the best parameters for generating a feasible and safe path. The proposed MemPBPF algorithm uses a combination of the structure and rules of membrane computing. In that sense, the proposed MemPBPF algorithm contains dynamic membranes that include a pseudo-bacterial genetic algorithm for evolving the required parameters in the artificial potential field method. This hybridization between membrane computing, the pseudo-bacterial genetic algorithm, and the artificial potential field method provides an outperforming path planning algorithm for autonomous mobile robots. Computer simulation results demonstrate the effectiveness of the proposed MemPBPF algorithm in terms of path length considering collision avoidance and smoothness. Comparisons with two different versions employing a different number of elementary membranes and with other artificial potential field based algorithms are presented. The proposed MemPBPF algorithm yields improved performance in terms of time execution by using a parallel implementation on a multi-core computer. Therefore, the MemPBPF algorithm achieves high performance yielding competitive results for autonomous mobile robot navigation in complex and real scenarios. INDEX TERMS Artificial potential field, autonomous mobile robots, membrane computing, path planning, pseudo-bacterial genetic algorithm.

No abstract

This paper introduces the pseudo-bacterial potential field (PBPF) as a new path planning method for autonomous mobile robot navigation. The PBPF allows us to obtain an optimal and safe path, in contrast to the classical potential field approach which is not suitable for path planning because it lacks a means of obtaining the optimal proportional gains. The PBPF uses the pseudo-bacterial genetic algorithm (PBGA) and a fitness function based on the potential field concepts to construct viable paths in dynamical environments to mostly result in the optimal path being obtained. Comparative experiments of sequential and parallel implementations of the PBPF for off-line and online in structured and unstructured conditions are presented; the results are contrasted with the artificial potential field (APF) method to demonstrate how the PBPF proposal overcomes the traditional method.