In this paper, we present a novel path planning algorithm called Kinematic Constrained Bi-
directional Rapidly-exploring Random Tree with Efficient Branch Pruning (KB-RRT*), which …

Rapidly-exploring Random Trees (RRTs) have been widely used for motion planning
problems due to their ability to efficiently find solutions. Informed RRT* is an optimized …

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 …

Purpose The goal of this research is to develop a dynamic step path planning algorithm
based on the rapidly exploring random tree (RRT) algorithm that combines Q-learning with …

One key autonomous driving car application that can be utilized to address the problem of
parking spaces is autonomous parking. The goal of this study is to develop a path planning …

For airports with high passenger and luggage flows, a large number of staff members have
to be hired to deploy the scattered passenger luggage trolleys. To release humans from the …

This study proposes a path planning algorithm that combines an informed rapidly-exploring
random tree (RRT*) and particle swarm optimization (PSO) algorithms. The informed RRT …

The sampling process is very inefficient for sampling-based motion planning algorithms that
excess random samples are generated in the planning space. In this paper, we propose an …

Sampling-based motion planning algorithms are very effective at finding solutions in high-
dimensional continuous state spaces as they do not require prior approximations of the …

The case of dual manipulators with shared workspace, asynchronous manufacturing tasks,
and independent objects is named a dual manipulator cooperative manufacturing system …