This paper formulates a generic framework for the social path planning problem. Previous
works deal with very specific cases of socially-aware motion planning. Instead, here we …

Fast methods are very popular algorithms to compute time-of-arrival maps (distance maps
measured in time units) solving the Eikonal equation. Since fast marching was proposed in …

Traditional path planning for robots is a well-studied problem. However, the classical setting
of the problem is simple to state: plan a path for a robot, starting from an initial point, and …

Path planning is defined as the process to establish the sequence of states a system must
go through in order to reach a desired state. Additionally, motion planning (or trajectory …

Operations of transportation in cluttered environments require robust motion planning
algorithms. Specially with large and heavy vehicles under hazardous operations of …

In this paper, a novel motion learning method is introduced: Fast Marching Learning (FML).
While other learning methods are focused on optimising probabilistic functions or fitting …

This study investigates the application of the Fast Marching Method, particularly Fast
Marching Square (FM2), as a local planner for Unmanned Ground Vehicles (UGVs). Key …

Abstract The Fast Marching Method is a very popular algorithm to compute times-of-arrival
maps (distances map measured in time units). Since their proposal in 1995, it has been …