Abstract: This paper proposes a path planning algorithm using the hybridization of the rapidly-exploring random tree (RRT) and ant colony system (ACS) algorithms. The RRT algorithm can quickly ...

numpy (v1.17.4 used) optional (used only in coverage_test.py): Given a NxM matrix, where free areas are marked with 0, obstacles with 1 and the starting point with 2, find a trajectory that passes ...

Abstract: The traditional trade-off between execution speed and path quality has forced real-time robotic path planning algorithms to sacrifice path quality in order to execute in real-time. Producing ...

For the low efficiency and poor generalization ability of path planning algorithm of industrial robots, this work proposes an adaptive field co-sampling algorithm (AFCS). Firstly, the environment ...

These include such learning paradigms as Q-Learning and the Deep Q-Networks setups. Reinforcement Learning paradigms essentially aim at teaching robots to undertake certain actions that will be used ...

In this paper, we present a place cell based path planning algorithm that utilizes spiking neural network (SNN) to create efficient routes for drones. First, place cells are characterized by the leaky ...

Aiming at the disadvantages of the basic ant colony algorithm, this paper proposes an improved ant colony algorithm for robot global path planning. First, adjust the pheromone evaporation rate ...