Path planning is one of the most important problems to be explored in unmanned aerial
vehicles (UAVs) for finding an optimal path between source and destination. Although, in …

Robot 3D (three‐dimension) path planning targets for finding an optimal and collision‐free
path in a 3D workspace while taking into account kinematic constraints (including geometric …

Abstract The Rapidly-exploring Random Tree (RRT) algorithm is a popular algorithm in
motion planning problems. The optimal RRT (RRT*) is an extended algorithm of RRT, which …

Abstract Robot Motion Planning (RMP) has been a thrust area of research in computing due
to its complexity, since RMP in dynamic environments for a point robot with bounded velocity …

We describe a practical path-planning algorithm for an autonomous vehicle operating in an
unknown semi-structured (or unstructured) environment, where obstacles are detected …

Heuristic search methods promise to find shortest paths for path-planning problems faster
than uninformed search methods. Incremental search methods, on the other hand, promise …

Mobile robots often operate in domains that are only incompletely known, for example, when
they have to move from given start coordinates to given goal coordinates in unknown terrain …

3D path planning of unmanned aerial vehicle (UAV) targets at finding an optimal and
collision free path in a 3D cluttered environment while taking into account the geometric …

In this paper, we present a method, namely€ CCA, for collision avoidance in dynamic
environments among interacting agents, such as other robots or humans. Given a preferred …

In this paper, we present an algorithm for generating complex dynamically feasible
maneuvers for autonomous vehicles traveling at high speeds over large distances. Our …