In the traditional rapidly exploring random tree (RRT) algorithm, the planned path is not
smooth, the distance is long, and the fault tolerance rate of the planned path is low …

A single unmanned surface combatant (USV) has poor mission execution capability, so the
cooperation of multiple unmanned surface ships is widely used. Cooperative hunting is an …

To solve the problems of unsmooth path planning, insufficient dynamic obstacle avoidance
ability, and environmental disturbance effect on the path planning result, this paper …

During material handling processes, automated guided vehicles (AGVs) pose a path conflict
problem. To solve this problem, we proposed a multi‐objective scheduling model based on …

We present the first asymptotically optimal feedback planning algorithm for nonholonomic
systems and additive cost functionals. Our algorithm is based on three well-established …

We present an algorithm that, given a representation of a road network in lane-level detail,
computes a route that minimizes the expected cost to reach a given destination. In doing so …

Many applications require efficient methods for solving continuous shortest path problems.
Such paths can be viewed as characteristics of static Hamilton--Jacobi equations. Several …

Floor field methods are one of the most popular medium-scale navigation concepts in
microscopic pedestrian simulators. Recently introduced dynamic floor field methods have …

This work presents a waypoint trajectory planning technique for an autonomous vehicle in
the presence of obstacles using a tunnel-MILP formulation for the avoidance constraints …

We revisit an approximate stochastic dynamic programming method that we proposed
earlier for the optimization of multireservoir problems. The method exploited the convexity …