Two Fast Marching Methods for Hamilton–Jacobi Equations [PDF]
PAMM, 2007 AbstractWe introduce and analyze two new Fast Marching (FM) methods based on a semi‐Lagrangian (SL) approximation (see [2] for a more complete presentation). The Characteristics driven Fast Marching method accepts more than one node at every iteration using a dynamic condition which leads to a faster convergence.
Emiliano Cristiani, Maurizio Falcone
openalex +3 more sources
Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions [PDF]
The International Journal of Robotics Research, 2015 In this paper we present a novel probabilistic sampling-based motion planning algorithm called the Fast Marching Tree algorithm (FMT*). The algorithm is specifically aimed at solving complex motion planning problems in high-dimensional configuration spaces.
Lucas Janson +3 more
openalex +4 more sources
Rapid global path planning algorithm for unmanned surface vehicles in large-scale and multi-island marine environments [PDF]
PeerJ Computer Science, 2021 A global path planning algorithm for unmanned surface vehicles (USVs) with short time requirements in large-scale and complex multi-island marine environments is proposed.
Dong Wang +4 more
doaj +2 more sources
A Two-Step Surface Reconstruction Method Using Signed Marching Cubes
Applied Sciences, 2022 In this paper, we explore a new approach, a two-step surface reconstruction method to extract the target isosurface from a given implicit function efficiently.
Ju Zhang, Deyun Zhong, Liguan Wang
doaj +1 more source
A Path Planning Method for Ship Collision Avoidance Considering Spatial–Temporal Interaction Effects
Applied Sciences, 2022 Efficient and reliable path planning is crucial for smart ships when avoiding collisions with static and dynamic obstacles in complex marine environments.
Shuwu Wang +4 more
doaj +1 more source
A Multilevel Fast Marching Method for the Minimum Time Problem [PDF]
SIAM Journal on Control and OptimizationWe introduce a new numerical method to approximate the solutions of a class of stationary Hamilton-Jacobi (HJ) partial differential equations arising from minimum time optimal control problems. We rely on nested grid approximations, and look for the optimal trajectories by using the coarse grid approximations to reduce the search space in fine grids ...
Marianne Akian +2 more
openalex +4 more sources
Fast Marching-Based Path Generating Algorithm in Anisotropic Environment With Perturbations
IEEE Access, 2020 Fast Marching is a widely used method in path planning, especially continuity is demanded due to kinodynamic constraints of automatic vehicles. However, its application in real environment with obstacles and perturbations requires simplifications to be ...
Jinshan Xu +3 more
doaj +1 more source
Robot Formations Control Using Fast Marching [PDF]
, 2011 This paper presents the application of the Voronoi Fast Marching (V FM) method to the Control of Robot Formations. The V FM method uses the propagation of a wave (Fast Marching) operating on the world model to de- termine a motion plan over a viscosity ...
Garrido, Santiago +2 more
core +5 more sources
AUTOMATED EXTRACTION OF LIVER OUTLINES FROM COMPUTED TOMOGRAPHY SCAN IMAGES USING A CUDA-BASED SEGMENTATION METHOD [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2019 The traditional fast marching algorithm for segmentation of the liver is suitable for processing on the central processing unit (CPU) platform, however, it is not suitable for implementation on Graphics Processing Unit (GPU).
Y. Chen, D. Li, Q. Zhu, C. Wang, J. Li
doaj +1 more source
A low complexity algorithm for non-monotonically evolving fronts [PDF]
, 2015 A new algorithm is proposed to describe the propagation of fronts advected in the normal direction with prescribed speed function F. The assumptions on F are that it does not depend on the front itself, but can depend on space and time.
Nave, Jean-Christophe, Tcheng, Alexandra
core +1 more source