Parallel search algorithms harness the multithreading capability of modern processors to
achieve faster planning. One such algorithm is PA* SE (Parallel A* for Slow Expansions) …

The ability of autonomous undersea vehicles (AUVs) to plan paths in unknown marine
environments is the precondition for executing complicated missions. However, existing path …

Lazy search algorithms have been developed to efficiently solve planning problems in
domains where the computational effort is dominated by the cost of edge evaluation. The …

Blue noise sampling has proved useful for many graphics applications, but remains
underexplored in high-dimensional spaces due to the difficulty of generating distributions …

This paper presents the design and development of a technique for an Autonomous and
Versatile mode Parking System (AVPS) that combines a various number of parking modes …

In order to safely and efficiently collaborate with humans, industrial robots need the ability to
alter their motions quickly to react to sudden changes in the environment, such as an …

The quality of the filling algorithm in additive manufacturing directly affects the strength of the
part. The commonly used 3D printing filling algorithm at this stage is the classic filling …

Anytime search algorithms are useful for planning problems where a solution is desired
under a limited time budget. Anytime algorithms first aim to provide a feasible solution …

The task of bin picking is to automatically unload objects from a container using a robotic
manipulator. A widely used solution is to organize the objects into a predictable pattern, eg …

A tractor-trailer vehicle (TTV) consists of an actuated tractor attached with several full trailers.
Because of its nonlinear and noncompleted constraints, it is a challenging task to avoid …