Path planning: A 2013 survey
In the recent decades an impressive progress was done in automation and robotic fields.
Projects such as Google driverless car with “sense and avoid” capabilities or intelligent …
Projects such as Google driverless car with “sense and avoid” capabilities or intelligent …
Path-planning modules for Autonomous Vehicles: Current status and challenges
SG Anavatti, SLX Francis… - … Conference on Advanced …, 2015 - ieeexplore.ieee.org
A detailed survey of the available literature on path planning of Autonomous Ground Vehicle
(AGV) is conducted, including the overview of single-robot control architectures, different …
(AGV) is conducted, including the overview of single-robot control architectures, different …
Model predictive trajectory planning for automated driving
In order to enable automated driving systems on the road, several key challenges need to
be solved. One of these issues is real-time maneuver decision and trajectory planning. This …
be solved. One of these issues is real-time maneuver decision and trajectory planning. This …
MOD* Lite: An incremental path planning algorithm taking care of multiple objectives
T Oral, F Polat - IEEE Transactions on Cybernetics, 2015 - ieeexplore.ieee.org
The need for determining a path from an initial location to a target one is a crucial task in
many applications, such as virtual simulations, robotics, and computer games. Almost all of …
many applications, such as virtual simulations, robotics, and computer games. Almost all of …
[PDF][PDF] Novel algorithm for mobile robot path planning in constrained environment
This paper presents a development of a novel path planning algorithm, called Generalized
Laser simulator (GLS), for solving the mobile robot path planning problem in a two …
Laser simulator (GLS), for solving the mobile robot path planning problem in a two …
[PDF][PDF] Moving target D* lite
Incremental search algorithms, such as Generalized Fringe-Retrieving A* and D* Lite, reuse
search trees from previous searches to speed up the current search and thus often find cost …
search trees from previous searches to speed up the current search and thus often find cost …
Truncated incremental search
Incremental heuristic search algorithms reuse their previous search efforts whenever these
are available. As a result, they can often solve a sequence of similar planning problems …
are available. As a result, they can often solve a sequence of similar planning problems …
X*: Anytime multi-agent path finding for sparse domains using window-based iterative repairs
Real-world multi-agent systems such as warehouse robots operate under significant time
constraints–in such settings, rather than spending significant amounts of time solving for …
constraints–in such settings, rather than spending significant amounts of time solving for …
Incremental ara*: An incremental anytime search algorithm for moving-target search
Moving-target search, where a hunter has to catch a moving target, is an important problem
for video game developers. In our case, the hunter repeatedly moves towards the target and …
for video game developers. In our case, the hunter repeatedly moves towards the target and …
Anytime truncated D*: Anytime replanning with truncation
Incremental heuristic searches reuse their previous search efforts to speed up the current
search. Anytime search algorithms iteratively tune the solutions based on available search …
search. Anytime search algorithms iteratively tune the solutions based on available search …